Scribd
Upload
375 views

Assignment 5

This document contains 15 questions related to number theory concepts such as mathematical induction, divisibility rules, prime numbers, modular arithmetic, and complete sets of residues. The questions ask the reader to prove statements, find examples, write programs, and verify equations involving integers and their properties.

Uploaded by

Akhlaq Husain
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
375 views

Assignment 5

This document contains 15 questions related to number theory concepts such as mathematical induction, divisibility rules, prime numbers, modular arithmetic, and complete sets of residues. The questions ask the reader to prove statements, find examples, write programs, and verify equations involving integers and their properties.

Uploaded by

Akhlaq Husain
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

The LNM Institute of Information Technology Jaipur, Rajsthan Discrete Mathematical Structures (Number Theory) Q1.

Use second principle of mathematical induction to prove that for all n 1, an 1 = (a 1)(an1 + an2 + an3 + . . . + a + 1). 2.6.10.14. . . . (4n 2) = Use this to deduce that 2n (n!)2 (2n)! for all n 1. Q3. Use division algorithm to show that any integer of the form 6k + 5 is also of the form 3j + 2. Show by an example that the converse is not true. Q4. Show that the cube of any integer is of the form 7k or 7k 1. Q5. Prove that for a given positive integer n and any integer a, gcd(a, a + n) divides n. Hence gcd(a, a + 1) = 1. Q6. Prove that d is a common divisor of a and b, then d = gcd(a, b) if and only if gcd Q7. For nonzero integers a and b, verify that the following conditions are equivalent: (i) a|b, (ii) gcd(a, b) = |a|, (iii) lcm(a, b) = |b|. Q8. Prove the following: (i) Every integer of the form 3n + 2 has a prime factor of this form. (ii) If p 5 is a prime number then show that p2 + 2 is composite. (iii) The only prime of the form n3 1 is 7. Q9. An open problem in number theory is that there exists innitely many primes of the form n2 + 1 (For example 17 = 42 + 1). Find 10 more primes of this type. Q10. Prove that p is irrational for any prime p. Q11. Verify that the integers 1949 and 1951 are twin primes. Also show that the sum of twin primes p and p + 2 is divisible by 12, provided p > 3. Q12. The prime numbers which dier by 4 are called cousin primes (For example, (3, 7), (7, 11) etc.). Find several such pairs? Write a program to generate all such pairs of primes for integers less than or equal to n = 1000. Q13. Give an example to show that a2 b2 (mod n) need not imply that a b (mod n). Q14. (i) Find the remainders when 250 and 4165 are divided by 7. (ii) What is the remainder when the following sum is divided by 4? 15 + 25 + 35 + . . . + 995 + 1005 . Q15. If a1 , a2 , . . . , an is a complete set of residue modulo n and gcd(a, n) = 1. Prove that aa1 , aa2 , . . . , aan is also a complete set of residue modulo n. [Hint: Show that the numbers aa1 , aa2 , . . . , aan are incongruent modulo n.]
a b b, d

Assignment #5

Q2. Verify that for all n 1,

(2n!) . n!

= 1.

You might also like