Scribd
Upload
2 views1 page

Problem Sheet - 4

The document contains a problem sheet with 27 mathematical problems that require proofs or calculations related to number theory, divisibility, congruences, and properties of prime numbers. Each problem presents a unique challenge, ranging from proving divisibility to finding specific integer values. The problems are designed for individuals with a strong understanding of mathematics, particularly in modular arithmetic and number theory.

Uploaded by

bibhash731201
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
2 views1 page

Problem Sheet - 4

The document contains a problem sheet with 27 mathematical problems that require proofs or calculations related to number theory, divisibility, congruences, and properties of prime numbers. Each problem presents a unique challenge, ranging from proving divisibility to finding specific integer values. The problems are designed for individuals with a strong understanding of mathematics, particularly in modular arithmetic and number theory.

Uploaded by

bibhash731201
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 - 4

(1) Prove that 53103 + 10353 is divisible by 39.


(2) Prove that 27 divides 25n+1 + 5n+2 for any integer n ≥ 1.
(3) Suppose ab ≡ cd (mod n) and b ≡ d (mod n). If gcd(b, n) = 1, then prove that a ≡ c
(mod n).
√
(4) If p is a prime number, then prove that p is an irrational number.
(5) If n ≥ 3 is an integer, then prove that there exists a prime number p with n < p < n!.
(6) If n ≥ 2, then prove that every prime divisor of n! + 1 is bigger than n.
(7) Prove that there exist infinitely many prime numbers p such that both p − 2 and p + 2
are composite numbers.
(8) Find the remainder when 1! + 2! + . . . + 100! is divided by 12.
(9) Let a, b, c and n be non-zero integers such that ca ≡ cb (mod n). Prove that a ≡ b
n
(mod gcd(c,n) ).
(10) Prove that 111333 + 333111 is divisible by 7.
(11) Using the properties of congruence, prove that 43 divides 6n+2 + 72n+1 .
(12) Let f (X) ∈ Z[X] be a non-constant polynomial. Prove that if a, b and n are integers
with a ≡ b (mod n), then f (a) ≡ f (b) (mod n).
(13) Let n ≥ 1 be an integer. Prove that the unit’s digit of n2 − n + 7 is either 3 or 7 or 9.
(14) Find the values of n ≥ 1 such that 1! + . . . + n! is a perfect square.
(15) For any prime number p ≥ 5, prove that 13 divides 102p − 10p + 1.
1
(16) Let a < b < c be positive integers such that a + 1b + 1c = 1. Find the values of a, b and c.
(17) Prove that 147 + 247 + . . . + 647 is divisible by 7.
(18) Is it true that 3 does not divide n2 + 1 for any integer n ≥ 1?
(19) Prove that if p and 8p − 1 are prime numbers, then 8p + 1 is composite.
(20) Find all prime numbers p such that 17p + 1 is a perfect square.
(21) Prove that an integer n ≥ 1 is divisible by 4 if and only if the integer formed by its last
two digits is divisible by 4.
(22) If the integer 11 . . . 1, made of k times the digit 1, is prime then prove that k is also
prime.
(23) Let p ̸= 5 be a prime number. Prove that p divides infinitely many integers in the
sequence 1, 11, 111, 1111, . . ..
(24) Prove that there exist infinitely many prime numbers of the form 6k + 5.
(25) A positive integer n is called a palindrome if it remains unchanged when its digits are
reversed. For example, 121, 142241 are palindromes but 1231 is not a palindrome. Prove
that a palindrome having an even number of digits is divisible by 11.
(26) Find all integers x such that 34x ≡ 60 (mod 98).
(27) Prove that there exist infinitely many integers n ≥ 1 such that n, n + 1 and n + 2 all
have a square divisor.

You might also like