Scribd
Upload
6 views1 page

Problem Sheet - 5

The document contains a problem sheet with 12 mathematical problems related to number theory and modular arithmetic. Each problem requires proofs or demonstrations of various mathematical properties involving integers, primes, and divisibility. The problems range from proving properties of factorials to finding specific integers under certain conditions.

Uploaded by

taslimaparvin329
Copyright
© All Rights Reserved
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
6 views1 page

Problem Sheet - 5

The document contains a problem sheet with 12 mathematical problems related to number theory and modular arithmetic. Each problem requires proofs or demonstrations of various mathematical properties involving integers, primes, and divisibility. The problems range from proving properties of factorials to finding specific integers under certain conditions.

Uploaded by

taslimaparvin329
Copyright
© All Rights Reserved
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

Problem Sheet - 5

(1) Prove that an integer n ≥ 2 is prime if and only if (n − 2)! ≡ 1 (mod n).
(2) For an odd prime number p, prove that (p − 1)! ≡ p − 1 (mod 1 + 2 + . . . + (p − 1)).
(3) Let p be a prime number of the form 4k + 3. If a and b are two integers such that
a2 + b2 ≡ 0 (mod p), then prove that a ≡ b ≡ 0 (mod p).
(4) Let p and q be two distinct odd prime numbers. Prove that pq divides (apq − ap − aq + a)
for any integer a.
(5) Let x1 , . . . , x5 ∈ Z be such that x31 + . . . + x35 = 0. Prove that at least one xi is a multiple
of 7.
(6) Let abc be a three digit positive integer. Prove that it is divisible by 7 if and only if 7
divides (2a + 3b + c).
12 13 23
(7) For any integer n ≥ 1, prove that 35 n + 35 n is also an integer.
(8) Find an integer x such that 0 ≤ x ≤ 12 and x24 + 7x ≡ 2 (mod 13).
(9) Prove that a positive integer is divisible by 8 if and only if the integer formed by its last
three digits is also divisible by 8.
(10) Prove that if p is an odd prime number then 1p + 2p + . . . + (p − 1)p ≡ 0 (mod p).
(11) Determine the smallest integer n ≥ 3 such that 2 | n, 3 | (n + 1), 4 | (n + 2), 5 | (n + 3)
and 6 | (n + 4).
(12) For which integers n ≥ 1 is the integer 3n + 1 a multiple of 10?

You might also like