Scribd
Upload
43 views1 page

Modular Arithmetic Questions

This document contains 10 modular arithmetic and number theory questions: 1) Compute 515 (mod 7) and 713 (mod 11). 2) Find the last two digits of 7100. 3) Prove that if x3 + y3 = z3 has a solution in integers, then one of the numbers must be a multiple of 7.

Uploaded by

AbhilashVerma
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
43 views1 page

Modular Arithmetic Questions

This document contains 10 modular arithmetic and number theory questions: 1) Compute 515 (mod 7) and 713 (mod 11). 2) Find the last two digits of 7100. 3) Prove that if x3 + y3 = z3 has a solution in integers, then one of the numbers must be a multiple of 7.

Uploaded by

AbhilashVerma
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
You are on page 1/ 1

Modular Arithmetic Questions

1. Compute 515 (mod 7) and 713 (mod 11).


2. Find the last two digits of 7100 .
3. Prove that if x3 + y 3 = z 3 has a solution in integers, then one of the
numbers must be a multiple of 7.
4. Show that an integer is divisible by 9 if and only if the sum of its digits is
divisible by 9.
5. Prove that n7 − n is divisible by 42 for any n.

6. Given a set of 7 integers, show that there is a pair either whose sum or
whose difference is divisible by 10.
7. Given n integers, show that there’s a subset whose sum is divisible by n.
8. Prove that if p is a prime, then (p − 1)! ≡ −1 (mod p)

9. Let f be a nonconstant polynomial with positive integer coefficients. Prove


that if n is a positive integer, then f (n) divides f (f (n) + 1) if and only if
n = 1.
10. The number d1 d2 . . . d9 has nine (not necessarily distinct) decimal digits.
The number e1 e2 . . . e9 is such that each of the nine 9-digit numbers formed
by replacing just one of the digits di is d1 d2 . . . d9 by the corresponding
digit ei (1 ≤ i ≤ 9) is divisible by 7. The number f1 f2 . . . f9 is related to
e1 e2 . . . e9 is the same way: that is, each of the nine numbers formed by
replacing one of the ei by the corresponding fi is divisible by 7. Show that,
for each i, di −fi is divisible by 7. [For example, if d1 d2 . . . d9 = 199501996,
then e6 may be 2 or 9, since 199502996 and 199509996 are multiples of 7.]

You might also like