Scribd
Upload
3 views1 page

Problem Sheet - 3

The document contains a problem sheet with 20 mathematical problems related to prime and composite numbers, including proofs and determinations of specific integer forms. Each problem addresses various properties of prime numbers, composite numbers, and their relationships. The problems range from simple equations to more complex proofs involving number theory concepts.

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
3 views1 page

Problem Sheet - 3

The document contains a problem sheet with 20 mathematical problems related to prime and composite numbers, including proofs and determinations of specific integer forms. Each problem addresses various properties of prime numbers, composite numbers, and their relationships. The problems range from simple equations to more complex proofs involving number theory concepts.

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 - 3

• An integer n ≥ 2 is said to be a composite number if it is not a prime number.

(1) Determine all integers x and y such that 18x + 5y = 48.

(2) Prove that each positive integer of the form 3n + 2 has a prime factor of the same form.

(3) Let n ≥ 1 be an integer such that n3 − 1 is a prime number. Prove that n = 2.

(4) Let p ≥ 5 be a prime number. Prove that p = 6k + 1 or p = 6k + 5 for some integer k.

(5) Let p1 , . . . , pn be prime numbers all bigger than 5 such that 6 | (p21 + . . . + p2n ). Prove
that 6 | n.

(6) Let p be a prime number such that 3p + 1 is a perfect square. Prove that p = 5.

(7) Prove that the only prime number of the form n2 − 4 is 5.

(8) Prove that if p is a prime number, then p2 + 2 is not prime.

(9) Let p > q ≥ 5 be prime numbers. Prove that 24 | (p2 − q 2 ).

(10) If p ̸= 5 is an odd prime number, then prove that either 10 | (p2 − 1) or 10 | (p2 + 1).

(11) Prove that 8n + 1 is never a prime number for any integer n ≥ 1.

(12) Prove that each integer n ≥ 12 can be written as a sum of two composite integers.

(13) Prove that there are infinitely many prime numbers of the form 6n + 5.

(14) Prove that the binomial coefficient 2n



n is divisible by all prime numbers p with n < p <
2n .

(15) Prove that n5 + n4 + 1 is not a prime number for any integer n ≥ 2.

(16) Determine all prime numbers p such that p + 2 and p + 4 are also prime numbers.

(17) Let f (X) be a polynomial of degre with rational coefficients n such that f (1), f (2), . . . , f (n+
1) ∈ Z. Does f (X) also have integer coefficients?
√
(18) Prove that p is an irrational number for every prime number p.
1
(19) If pn stands for the nth prime number, then prove that p1 + . . . + p1n is never an integer.

(20) Assuming Dirichlet’s theorem for primes in arithmetic progressions, prove that there are
infinitely many prime numbers ending with the digit 7.

You might also like