Scribd
Upload
6 views3 pages

Modular Arithmetic

The document is a problem set focused on modular arithmetic, containing 18 problems that require finding remainders, divisibility, and last digits of various expressions. Each problem includes hints to assist in solving them. The problems range from basic calculations to proofs involving modular relationships.

Uploaded by

Abdullah Chowdhury Rafi
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 views3 pages

Modular Arithmetic

The document is a problem set focused on modular arithmetic, containing 18 problems that require finding remainders, divisibility, and last digits of various expressions. Each problem includes hints to assist in solving them. The problems range from basic calculations to proofs involving modular relationships.

Uploaded by

Abdullah Chowdhury Rafi
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

Modular Arithmetic

Problem Set

Problem 1: For a positive integer k, k ≡ 7 (mod 12).


What will be the reminder when 4k + 3 is divided by 12 ?

Problem 2: What will be the reminder if 22011 is divided 7


?

Problem 3: What is the last digit of 381 ? [Hint 2]

36!
Problem 4: What will be the reminder if 26! is divided 13
? [Hint 1]

Problem 5: What will be the reminder if 430 is divided 23


? [Hint 2, 4]

Problem 6: What is the last two digits of 999 ?

Problem 7: What will be the reminder if 717 is divided 7


? [Hint 8]

Problem 8: Show that 237 − 1 is a multiple of 223

1
Problem 9: Find the values of the variables:
• 3500 ≡ x (mod 13)
• 12! ≡ y (mod 13)
• 516 ≡ z (mod 17)
• 5500 ≡ a (mod 15)
• 340 ≡ k (mod 11)
• 4337 ≡ p (mod 11)

Problem 10: Show that 248 − 1 is divisible by 97.

Problem 11: Show that 523 + 1 is divisible by 47

Problem 12: Is 7.320 + 6 divisible by 41 ?

Problem 13: What will be the reminder if 1! + 2! + 3! +


4! + · · · + 100! is divided by 45 ? [Hint 5]

Problem 14: Determine the last three digits of 7493 . [Hint


2, 3]

Problem 15: Show that 169323 + 323169 is a multiple of


12.

Problem 16: What will be the reminder if 1522 + 2215 is


divided by 330 ? [Hint 6, 7]

Problem 17: Is 332 + 8 is divisible by 227 ?

2
Problem 18: Is 553 − 1 divisible by 117 ?

Hints:
1. Simplify.
2. If the last n digits are wanted, take mod of 10n
3. Try to prove that 720 ≡ 1 (mod 100).
4. Try to determine, 940 ≡ 1 (mod 100)
5. Every single term will be divisible by 45 after a certain
range.
6. Try to do the prime factorization of 330.
7. To be divisible by 330 is the same as divisible by 2, 3, 5, 11
at a time.
8. Try to work with small powers.

You might also like