INDIAN INSTITUTE OF TECHNOLOGY, KHARAGPUR

Date: 26th April. 2012 . . . AN Time: 3 Hrs. Full Marks . . . 75 . . . No. of Students . . . 46 . . . Spring Semester, 2011-2012 Deptt. . . . CSE . . . Sub No. . . . CS60094 . . . B. Tech.(Hons.) / M. Tech. / M. Sc. Sub. Name . . . Computational Number Theory . . .

Instructions : Answer Q1 and any 3 from the remaining 4.

1. [6 7] (a) Let n > 1 be an integer. Prove that Z n = {a : 1 a < n and gcd(a, n) = 1} is a group under multiplication modulo n. (b) Prove that 2n < (c) Prove that
2n n

< 22n , where n is an integer > 1.

p x p

(d) Let m, n be integers where n > 0, and let d be the gcd(m, (n)), where () is the m m Eulars function. Z n is dened as usual. (Zn ) = {a : a Zn } for any integer m. (n)/d = 1. m m Prove that, (i) if d = 1, then (Z n ) = Zn , and (ii) if a (Zn ) , then a (e) Let n > 1 be an integer and p be a prime number. Dene p (n) as the largest n integer k so that pk |n, but pk+1 |n. Assume that p (n!) = k1 p k . Prove that p
2m m

< 4x1 , where x 2, is a real number and ps are primes.

(f) Following is the Lehmanns randomized algorithm to test primality of an odd positive integer. Here l is the number of iterations (random experiments). isprimeLR(n, l) for i 1 to l do a rand{1, 2, n 1} // uniformly at random n1 r a 2 mod n if r {1, n 1} return 0 else b[i] r if i, s .t. b[i] = n 1, then return 1 else return 0 Clearly explain the probability of getting a wrong output. 2. What is the quadratic reciprocity law? Use this law to answer the following questions. (a) If p > 3 is an odd prime, then prove that
2n 3 p

log 2m log p .

[2 + 5 + 4] = 1 if and only if p 1 (mod 12).

(b) If Fn = 2 + 1 is a prime number (Fermat prime), then prove that 3 is a primitive root of it. 3. Give a proof of each of the following propositions. [(2 + 2 + 5) + 2]

(b) If n is an integer such that n 2 and an1 1 (mod n), for all 1 a < n, then n is a prime number. (c) If n is an odd composite number so that n 3, and there is an a Z n such that an1 1 (mod n) (a is an F-witness for n as composite), then more than half of the elements of Z n are F-witnesses. [Assume the Lagranges theorem.] What is your conclusion about the Fermat-primality test on the basis of the last proposition? 1

(a) If n, a and r are integers such that n 2, 1 a < n, and ar 1 (mod n), then a Z n.

4. The Miller-Rabin test for prime indicates that both 15841 and 22657 are odd composite numbers. [(2 + 2) + (2 + 5)] (a) In case of 15841, it computes the sequence of values, b0 = 3495 mod 15841 = 12802, b1 = 128022 mod 15841 = 218, and b2 = 2182 mod 15841 = 1. It concludes that it is not a prime. Give an explanation for the conclusion. Also use these data to factorise 15841. Explain your method clearly. [No credit will be given for factorisation using trial division.] 2 = 151 and (b) In case of 22657 we compute (H + i) 22657, where H = 22657 i = 0, 1, , as long as H + i 2 22657. Some values of (H + i)2 22657 are factorised over the prime factor base b = {2, 3, 17, 19, 23}, and the following set of data is collected: 1512 22657 1552 22657 1612 22657 1792 22657 1872 22657 1912 22657 1932 22657 24 32 (mod 22657) 23 32 191 (mod 22657) 26 31 171 (mod 22657) 23 31 171 231 (mod 22657) 23 34 191 (mod 22657) 29 33 (mod 22657) 28 31 191 (mod 22657)

i. Factorise 22657 using the data corresponding to 1512 22657. ii. Use the remaining data (1552 22657 to 1932 22657) to formulate a set homogeneous simultaneous equations over F2 . Reduce the coecient matrix to reduced row-echelon form, and nd out the basis vectors of the null space. Use these vectors to factorise 22657. [No credit for trial division or any other method.] 5. Answer the following questions. [5 + 2 + 2 + 2]

(a) Let p be an odd prime and a be an integer such that gcd(a, p) = 1. Let n be the 1 number of elements of the set S = {a, 2a, 3a, , p 2 a}, whose remainders exceed p a n 2 , when divided by p. Gauss proved that p = (1) . Use this theorem to formulate rules to compute the value of
8 495 2 p

(b) Compute the value of

(c) Let n 3 be an odd composite number. An integer a Zn is called an E-witness n1 a for n if a 2 n 1(mod n). Otherwise it is called an E-liar. Denote the set of E E-liars for n as Ln . Prove that every E-liar for n is an F-liar and LE n is a subgroup of Zn . (d) How do you modify the sieve of Eratosthenes to test whether a number is b-smooth?

Sig.of the Paper-Setter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .