Scribd
Upload
69 views3 pages

NT Problem Set 1

The document presents a series of mathematical problems that require proofs or solutions involving integers, divisibility, prime numbers, and sequences. Each problem is numbered and addresses a specific mathematical concept or theorem. The problems range from finding integers that satisfy certain conditions to proving properties of numbers and sequences.

Uploaded by

kokcio45
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
69 views3 pages

NT Problem Set 1

The document presents a series of mathematical problems that require proofs or solutions involving integers, divisibility, prime numbers, and sequences. Each problem is numbered and addresses a specific mathematical concept or theorem. The problems range from finding integers that satisfy certain conditions to proving properties of numbers and sequences.

Uploaded by

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

Problem 1

Find all integers n, which satisfy n + 5|n5 + 5.

Problem 2
Find all integers n, which satisfy 7n−1 + 5n−1 |7n + 5n .

Problem 3
21n+4
Prove that fraction 14n+3 is irreducible for all integers n.

Problem 4
Prove that there exists only one triple (a, b, c), which satisfy 1 < a < b < c and
a|bc + 1, b|ca + 1, c|ab + 1.

Problem 5
2n

Prove that n + 1| n for all positive integers n.

Problem 6
Prove that gcd(an − 1, am − 1) = agcd(n,m) − 1.

Problem 7
Sequence (an )n≥1 (an ∈ Z+ ) satisfy condition gcd(ak , al ) = gcd(k, l) for all
k ̸= l. Prove that an = n for all integers n.

Problem 8
Assume that p < q are two consecutive odd prime numbers. Prove that p + q
has at least three prime (not neccesarily distinct) divisors.

Prolem 9
We call a number Novak’s number if n|2n + 1. Prove that
1. if n is Novak’s number, then 2n + 1 is also Novak’s number.
2. gcd and lcm of two Novak’s numbers is also Novak’s number

3. There exist Novak’s number, which have exactly 2025 prime divisors.

Problem 10
Number n has 30 digits. All of them are 0 and 6. can n be a perfect square?

1
Problem 11
Numbers a, b satisfy a2 + a = 3b2 . Prove that a + 1 is a perfect square.

Problem 12
Show that for any natural number n, between n2 and (n + 1)2 one can find three
distinct natural numbers a, b, c such that c|a2 + b2 .

Problem 13
Find all integers a, b, c with 1 < a < b < c such that (a − 1)(b − 1)(c − 1) divides
abc − 1.

Problem 14
Find all positive integers (x, n) such that xn + 2n + 1 divides xn+1 + 2n+1 + 1.

Problem 15
Find all integers (a, b) such that a4 + 4b4 is a prime number.

Problem 16
Let a > b > c > d be positive integers and suppose ac + bd = (b + d − a + c)(b +
d + a − c). Prove that ab + cd is not prime.

Problem 17
a+1 b+1
The natural numbers a, b are such that + is an integer. Proof that
√ b a
gcd(a, b) ≤ a + b

Problem 18
For which positive integers n do there exist positive integers a, b such that
lcm(a, b) = n! and gcd(a, b) = 1998?
For which n is the number of such pairs a, b with a ≤ b less than 1998?

Problem 19
Let d1 < d2 < d3 < d4 be four smallest divisors of n. Assume that d21 + d22 +
d23 + d24 = n. Find all possible values of n.

Problem 20
Show that there exist an increasing sequence {an }∞
n≥1 of positive integers such
that for any k ≥ 0, the sequence {an + k} contains only finitely many primes.

2
Problem 21
Let p ≥ 5 be a prime and choose k ∈ {0, 1, 2, ..., p − 1}. Find the maximum
length of an arithmetic progression, none of whose elements contain the digit k
when written in base p.

Problem 22
A positive integer is said to be balanced if the number of its decimal digits
equals the number of its distinct prime factors. For instance, 15 is balanced,
while 49 is not. Prove that there are only finitely many balanced numbers.

Problem 23
Prove that for any n ∈ Z+ the number 11n+2 + 122n+1 is divisible by 133.

Problem 24
Find the smallest number of the form:
|11k − 5l |
|53k − 37l |
where k and l are positive integers.

Problem 25
n
Let Fn = 22 + 1 be nth Fermat number. Prove that Fn |2Fn − 2 for all n ≥ 1.

Problem 26
Find a polynomial f with integer coefficients such that 27|4n +f (n) for all n ≥ 1.

Problem 27
Prove that n2 |2n + 3n for infinitely many integers n.

Problem 28
Are there integers a, b such that a5 b + 3 and ab5 + 3 are both perfect cubes?

Problem 29
Let n ≥ 3. Prove that there exist n pairwise different positive integers a1 , a2 , ..., an
such that a1 a2 ...ai−1 ai+1 ...an − 1 is divisible by ai for 1 ≤ i ≤ n.

Problem 30
Find all pairs of primes (p, q) such that pq + 4 is perfect fourth power.

You might also like