3588
3588
3588
Divisibility Theory
www.artofproblemsolving.com/community/c3588
by Peter, Hawk Tiger, Naphthalin, ideahitme, Ilthigore, ZetaX, TTsphn, TomciO, Leonhard Euler, Euler-ls,
Tiks, mathmanman, Vaf, rem, freemind, Rust, tim1234133, PhilAndrew, Yimin Ge, s.tringali
1 Show that if x, y, z are positive integers, then (xy + 1)(yz + 1)(zx + 1) is a perfect square if and
only if xy + 1, yz + 1, zx + 1 are all perfect squares.
2 Find infinitely many triples (a, b, c) of positive integers such that a, b, c are in arithmetic pro-
gression and such that ab + 1, bc + 1, and ca + 1 are perfect squares.
a2 + b2
ab + 1
is the square of an integer.
0 < a2 + b2 − abc ≤ c,
x2 + y 2 + 1
= 3.
xy
6 - Find infinitely many pairs of integers a and b with 1 < a < b, so that ab exactly divides
a2 + b2 − 1. - With a and b as above, what are the possible values of
a2 + b2 − 1
?
ab
√ √
7 Let n be a positive integer such that 2 + 2 28n2 + 1 is an integer. Show that 2 + 2 28n2 + 1 is
the square of an integer.
8 The integers a and b have the property that for every nonnegative integer n the number of
2n a + b is the square of an integer. Show that a = 0.
9 Prove that among any ten consecutive positive integers at least one is relatively prime to the
product of the others.
is divisible by 1989.
is divisible by 12.
12 Let k, m, and n be natural numbers such that m + k + 1 is a prime greater than n + 1. Let
cs = s(s + 1). Prove that the product
is an integer.
Show that n1 = n2 = · · · = nk = 1.
16 Determine if there exists a positive integer n such that n has exactly 2000 prime divisors and
2n + 1 is divisible by n.
18 Let m and n be natural numbers and let mn + 1 be divisible by 24. Show that m + n is divisible
by 24.
19 Let f (x) = x3 + 17. Prove that for each natural number n ≥ 2, there is a natural number x for
which f (x) is divisible by 3n but not 3n+1 .
20 Determine all positive integers n for which there exists an integer m such that 2n − 1 divides
m2 + 9.
21 Let n be a positive integer. Show that the product of n consecutive positive integers is divisible
by n!
is divisible by p2 .
Show that 2n
| lcm(1, 2, · · · , 2n) for all positive integers n.
25 n
(2m)!(2n)!
m!n!(m + n)!
is an integer.
27 Show that the coefficients of a binomial expansion (a + b)n where n is a positive integer, are
all odd, if and only if n is of the form 2k − 1 for some positive integer k.
29 For which positive integers k, is it true that there are infinitely many pairs of positive integers
(m, n) such that
(m + n − k)!
m! n!
is an integer?
31 Show that there exist infinitely many positive integers n such that n2 + 1 divides n!.
33 Let a, b, x ∈ N with b > 1 and such that bn − 1 divides a. Show that in base b, the number a has
at least n non-zero digits.
35 Let p ≥ 5 be a prime number. Prove that there exists an integer a with 1 ≤ a ≤ p − 2 such that
neither ap−1 − 1 nor (a + 1)p−1 − 1 is divisible by p2 .
j k
(n−1)!
36 Let n and q be integers with n ≥ 5, 2 ≤ q ≤ n. Prove that q − 1 divides q .
37 If n is a natural number, prove that the number (n + 1)(n + 2) · · · (n + 10) is not a perfect square.
38 Let p be a prime with p > 5, and let S = {p − n2 |n ∈ N, n2 < p}. Prove that S contains two
elements a and b such that a|b and 1 < a < b.
39 Let n be a positive integer. Prove that the following two statements are equivalent. - n is not
divisible by 4 - There exist a, b ∈ Z such that a2 + b2 + 1 is divisible by n.
{n13 − n | n ∈ Z}.
41 Show that there are infinitely many composite numbers n such that 3n−1 − 2n−1 is divisible by
n.
42 Suppose that 2n + 1 is an odd prime for some positive integer n. Show that n must be a power
of 2.
43 Suppose that p is a prime number and is greater than 3. Prove that 7p − 6p − 1 is divisible by
43.
44 Suppose that 4n + 2n + 1 is prime for some positive integer n. Show that n must be a power
of 3.
45 Let b, m, n ∈ N with b > 1 and m 6= n. Suppose that bm − 1 and bn − 1 have the same set of
prime divisors. Show that b + 1 must be a power of 2.
46 Let a and b be integers. Show that a and b have the same parity if and only if there exist integers
c and d such that a2 + b2 + c2 + 1 = d2 .
49 Prove that there is no positive integer n such that, for k = 1, 2, · · · , 9, the leftmost digit of
(n + k)! equals k.
50 Show that every integer k > 1 has a multiple less than k 4 whose decimal expansion has at
most four distinct digits.
51 Let a, b, c and d be odd integers such that 0 < a < b < c < d and ad = bc. Prove that if a+d = 2k
and b + c = 2m for some integers k and m, then a = 1.
52 Let d be any positive integer not equal to 2, 5, or 13. Show that one can find distinct a and b in
the set {2, 5, 13, d} such that ab − 1 is not a perfect square.
53 Suppose that x, y, and z are positive integers with xy = z 2 + 1. Prove that there exist integers
a, b, c, and d such that x = a2 + b2 , y = c2 + d2 , and z = ac + bd.
54 A natural number n is said to have the property P , if whenever n divides an −1 for some integer
a, n2 also necessarily divides an − 1. - Show that every prime number n has the property P . -
Show that there are infinitely many composite numbers n that possess the property P .
56 Let a, b, and c be integers such that a + b + c divides a2 + b2 + c2 . Prove that there are infinitely
many positive integers n such that a + b + c divides an + bn + cn .
57 Prove that for every n ∈ N the following proposition holds: 7|3n + n3 if and only if 7|3n n3 + 1.
58 Let k ≥ 14 be an integer, and let pk be the largest prime number which is strictly less than k.
You may assume that pk ≥ 3k 4 . Let n be a composite integer. Prove that - if n = 2pk , then n
does not divide (n − k)!, - if n > 2pk , then n divides (n − k)!.
59 Suppose that n has (at least) two essentially distinct representations as a sum of two squares.
Specifically, let n = s2 + t2 = u2 + v 2 , where s ≥ t ≥ 0, u ≥ v ≥ 0, and s > u. Show that
gcd(su − tv, n) is a proper divisor of n.
60 Prove that there exist an infinite number of ordered pairs (a, b) of integers such that for every
positive integer t, the number at+b is a triangular number if and only if t is a triangular number.
61 For any positive integer n > 1, let p(n) be the greatest prime divisor of n. Prove that there are
infinitely many positive integers n with
p(n) < p(n + 1) < p(n + 2).
63 There is a large pile of cards. On each card one of the numbers 1, 2, · · · , n is written. It is known
that the sum of all numbers of all the cards is equal to k · n! for some integer k. Prove that it
is possible to arrange cards into k stacks so that the sum of numbers written on the cards in
each stack is equal to n!.
64 The last digit of the number x2 + xy + y 2 is zero (where x and y are positive integers). Prove
that two last digits of this numbers are zeros.
65 Clara computed the product of the first n positive integers and Valerid computed the product
of the first m even positive integers, where m ≥ 2. They got the same answer. Prove that one
of them had made a mistake.
66 (Four Number Theorem) Let a, b, c, and d be positive integers such that ab = cd. Show that
there exists positive integers p, q, r, s such that
a = pq, b = rs, c = ps, d = qr.
Prove that 2n
is divisible by n + 1.
67 n
68 Suppose that S = {a1 , · · · , ar } is a set of positive integers, and let Sk denote the set of subsets
of S with k elements. Show that
r Y
i
gcd(s)((−1) ) .
Y
lcm(a1 , · · · , ar ) =
i=1 s∈Si
69 Prove that if the odd prime p divides ab − 1, where a and b are positive integers, then p appears
to the same power in the prime factorization of b(ad − 1), where d = gcd(b, p − 1).
70 Suppose that m = nq, where n and q are positive integers. Prove that the sum of binomial
coefficients
n−1
X gcd(n, k)q
gcd(n, k)
k=0
is divisible by m.
72 Determine all pairs (n, p) of nonnegative integers such that - p is a prime, - n < 2p, - (p − 1)n + 1
is divisible by np−1 .
73 Determine all pairs (n, p) of positive integers such that - p is a prime, n > 1, - (p − 1)n + 1 is
divisible by np−1 .
80 Find all pairs of positive integers m, n ≥ 3 for which there exist infinitely many positive integers
a such that
am + a − 1
an + a2 − 1
is itself an integer.
81 Determine all triples of positive integers (a, m, n) such that am + 1 divides (a + 1)n .
86 Find all positive integers (x, n) such that xn + 2n + 1 divides xn+1 + 2n+1 + 1.
91 Determine all pairs (a, b) of positive integers such that ab2 + b + 7 divides a2 b + a + b.
92 Let a and b be positive integers. When a2 + b2 is divided by a + b, the quotient is q and the
remainder is r. Find all pairs (a, b) such that q 2 + r = 1977.
93 Find the largest positive integer n such that n is divisible by all the positive integers less than
√
3
n.
96 Find all positive integers n that have exactly 16 positive integral divisors d1 , d2 · · · , d16 such
that 1 = d1 < d2 < · · · < d16 = n, d6 = 18, and d9 − d8 = 17.
be the four smallest positive integer divisors of n. Find all integers n such that
n = d1 2 + d2 2 + d3 2 + d4 2 .
98 Let n be a positive integer with k ≥ 22 divisors 1 = d1 < d2 < · · · < dk = n, all different.
Determine all n such that
n 2
2 2
d7 + d10 = .
d22
Prove that
d1 d2 + d2 d3 + · · · + dk−1 dk
is always less than n2 , and determine when it divides n2 .
100 Find all positive integers n such that n has exactly 6 positive divisors 1 < d1 < d2 < d3 < d4 <
n and 1 + n = 5(d1 + d2 + d3 + d4 ).
101 Find all composite numbers n having the property that each proper divisor d of n has n − 20 ≤
d ≤ n − 12.
102 Determine all three-digit numbers N having the property that N is divisible by 11, and N
11 is
equal to the sum of the squares of the digits of N.
103 When 44444444 is written in decimal notation, the sum of its digits is A. Let B be the sum of the
digits of A. Find the sum of the digits of B. (A and B are written in decimal notation.)
104 A wobbly number is a positive integer whose digits in base 10 are alternatively non-zero and
zero the units digit being non-zero. Determine all positive integers which do not divide any
wobbly number.
105 Find the smallest positive integer n such that - n has exactly 144 distinct positive divisors, -
there are ten consecutive integers among the positive divisors of n.
106 Determine the least possible value of the natural number n such that n! ends in exactly 1987
zeros.
107 Find four positive integers, each not exceeding 70000 and each having more than 100 divisors.
108 For each integer n > 1, let p(n) denote the largest prime factor of n. Determine all triples
(x, y, z) of distinct positive integers satisfying - x, y, z are in arithmetic progression, - p(xyz) ≤
3.
a2 + b b2 + a
and
b2 − a a2 − b
are both integers.
For each positive integer n, write the sum nm=1 1/m in the form pn /qn , where pn and qn are
P
110
relatively prime positive integers. Determine all n such that 5 does not divide qn .
111 Find all natural numbers n such that the number n(n + 1)(n + 2)(n + 3) has exactly three
different prime divisors.
112 Prove that there exist infinitely many pairs (a, b) of relatively prime positive integers such that
a2 − 5 b2 − 5
and
b a
are both positive integers.
{16n + 10n − 1 | n = 1, 2, · · · }?
115 Does there exist a 4-digit integer (in decimal form) such that no replacement of three of its
digits by any other three gives a multiple of 1992?
116 What is the smallest positive integer that consists base 10 of each of the ten digits, each used
exactly once, and is divisible by each of the digits 2 through 9?
21989 | mn − 1
(1980n)!
.
(n!)1980