Академический Документы
Профессиональный Документы
Культура Документы
Masum Billal
University Of Dhaka
Department of Computer Science and Engineering
Dhaka
Bangladesh
Email: billalmasum93@gmail.com
November 10, 2015
Abstract
Its been on my planning list for a long time, to make this document. Finally I was able to compile all the number theory problems
that appeared at the IMO so far. However, this time I am only compiling the problems. On a later version, I may write the solutions
as well. Each problem has the year and chronological number of its
appearance with the problem number, though some may be missing.
Finally, I have put the problems which I think belongs to the class of
number theory. Some may not agree with me about some problems.
Problems
21n + 4
is irreducible
14n + 3
Proposed by-Poland
Problem 2 (1960, Problem 1). Find all the three-digit numbers for which
one obtains, when dividing the number by 11, the sum of the squares of the
digits of the initial number.
1
Proposed by-Bulgaria
Problem 3 (1962, Problem 1). Find the smallest natural number n with the
following properties:
(1) In decimal representation it ends with 6.
(2) If we move this digit to the front of the number, we get a number 4 times
larger.
Proposed by-Poland
Problem 4 (1964, Problem 1). (a).Find all natural numbers n such that 7
divides 2n 1.
(b). Prove that for all natural numbers n the number 2n + 1 is not divisible
by 7.
Proposed by-Czechoslovakia
Problem 5 (1967, Problem 3). Let k, m, and n be positive integers such
that m + k + 1 is a prime number greater than n + 1. Write cs = s(s + 1).
Prove that the product
(cm+1 ck )(cm+2 ck ) (cm+n ck )
is divisible by c1 c2 cn .
Proposed by-United Kingdom
Problem 6 (1968, Problem 2). Find all positive integers x for which
p(x) = x2 10x 22
where p(x) denotes the product of the digits of x.
Proposed by-Czechoslovakia
Problem 7 (1968, Problem 6). Let [x] denote the integer part of x, i.e.,
the greatest integer not exceeding x for positive x. If n is a positive integer,
express as a simple function of n the sum
n+2
n + 2i
n+1
+
+ ... +
2
4
2i+1
2
An+1 = x0 x1 x2 . . . xn(a)
Bn = x1 x2 . . . xn(b) ,
Bn+1 = x0 x1 x2 . . . xn(b)
k2
n
X
1
k=1
k
Proposed by-France
1 1 1
1
1
p
+ + ...
+
=
2 3 4
1318 1319
q
Proposed by-Germany, FR
Problem 33 (1983, Problem 5). Prove or disprove the following statement:
In the set {1, 2, 3, ..., 105 } a subset of 1983 elements can be found that does
not contain any three consecutive terms of an arithmetic progression.
Proposed by-Poland
Problem 34 (1984, Problem 2). Find two positive integers a, b such that
none of the numbers a, b, a + b is divisible by 7 but (a + b)7 a7 b7 is.
Proposed by-Netherlands
Problem 35 (1984, Problem 6). Let a, b, c, d be odd positive integers such
that a < b < c < d, ad = bc, and
a + d = 2k , b + c = 2m
for some positive integer k, m. Prove that, a = 1.
Proposed by-Poland
Problem 36 (1985, Problem 3). The weight w(p) of a polynomial p,
p(x) =
n
X
ai x i
i=0
with integer coefficients ai defined as the number of its odd coefficients. For
i = 0, 1, 2, ... let
qi (x) = (1 + x)i
Prove that for any finite sequence 0 i1 , i2 , ..., in ,
w(qi1 + qi2 + . . . + qin ) w(qi1 )
Proposed by-Netherlands
Problem 37 (1985, Problem 4). Given a set M of 1985 positive integers,
none of which has a prime divisor larger than 26, prove that M has four
distinct elements whose geometric mean is an integer.
8
Proposed by-Mongolia
Problem 38 (1986, Problem 1). The set S = {2, 5, 13} has the property
that for every a, b S, a 6= b, the number ab 1 is a perfect square. Show
that for every positive integer d not in S, the set S {d} does not have the
above property.
Proposed by-Germany, FR
Problem 39 (1987, Problem 1). Let S be a set of n elements. We denote the
number of all permutations of S that have exactly k fixed points by pn (k).
Prove that
X
pn (k) = n!
k
Proposed by-Germany, FR
Problem 40 (1987, Problem 4). Does there exist a function f : N N ,
such that
f (f (n)) = n + 1987
for every natural number n?
Proposed by-Soviet Union
Problem 41 (1987, Problem 5). Let n be an integer greater than or equal
to 3. Prove that there is a set of n points in the plane such that the distance
between any two points is irrational and each set of three points determines
a non-degenerate triangle with rational area.
Problem 42 (1987, Problem 6). Let n be an integer greater than or equal
p to
2. Prove that if k 2 + k + n is prime for all integers k such that 0 k n3 ,
then k 2 + k + n is prime for all integers k such that 0 k n 2.
Proposed by-Soviet Union
Problem 43 (1988, Problem 3). A function f defined on the positive integers
(and taking positive integer values) is given by
f (1) = 1,
f (3) = 3
f (2n) = f (n)
f (4n + 1) = 2f (2n + 1) f (n)
f (4n + 3) = 3f (2n + 1) 2f (n)
9
for all positive integers n. Determine with proof the number of positive
integers n less than or equal to 1988 for which f (n) = n.
Proposed by-United Kingdom
Problem 44 (1988, Problem 6). Let a and b be two positive integers so that
k=
a2 + b 2
N
ab + 1
Proposed by-Germany, FR
Problem 48 (1991, Problem 2). Let n > 6 and let a1 < a2 < ... < ak be all
natural numbers that are less than n and relatively prime to n. Show that
if a1 , a2 , ..., ak is an arithmetic progression, then n is a prime number or a
natural power of two.
Proposed by-Romania
Problem 49 (1992, Problem 1). Find all integer triples (p, q, r) such that
1 < p < q < r and (p 1)(q 1)(r 1) is a divisor of (pqr 1).
Proposed by-New Zealand
Problem 50 (1992, Problem 6). For each positive integer n, denote by s(n)
the greatest integer such that for all positive integers k s(n), n2 can be
expressed as a sum of squares of k positive integers.
(i) Prove that s(n) n2 14 for all n.
(ii) Find a number n s.t. s(n) = n2 14.
(iii) Prove that there are infinitely many n s.t. s(n) = n2 14.
Proposed by-United Kingdom
Problem 51 (1993, Problem 1). Let n > 1 be an integer and f (x) = xn +
5xn1 + 3. Prove that there do not exist polynomials g(x), h(x), each having
integer coefficients and degree at least one, such that
f (x) = g(x)h(x)
Proposed by-Ireland
Problem 52 (1993, Problem 5). Determine whether there exists a strictly
increasing function f : N N with the following properties:
f (1) = 2
f (f (n)) = f (n) + n
11
Proposed by-Germany
Problem 53 (1994, Problem 1). Let m and n be positive integers. The set
A = {a1 , a2 , ..., am } is a subset of 1, 2, ..., n. Whenever ai + aj n, 1 i
j m, ai + aj also belongs to A. Prove that
a1 + a2 + . . . + am
n+1
m
2
Proposed by-France
Problem 54 (1994, Problem 3). For any positive integer k, Ak is the subset
of
{k + 1, k + 2, ..., 2k}
consisting of elements whose digit in base 2 contain exactly three 1s. Let
f (k) denote the number of elements of Ak .
(a) Prove that for any positive integer m, f (k) = m has at least one solution.
(b) Determine all positive integers m for which f (k) = m has a unique solution.
Proposed by-Romania
Problem 55 (1994, Problem 4). Determine all pairs (m, n) of positive integers such that
n3 + 1
N
mn + 1
Proposed by-Australia
Problem 56 (1994, Problem 6). Find a set A of positive integers such that
for any infinite set P of prime numbers, there exist positive integers m A
and n 6 A, both the product of the same number (at least two) of distinct
elements of P .
Proposed by-Finland
Problem 57 (1995, Problem 6). Let p be an odd prime. Find the number
of p-element subsets A of 1, 2, ..., 2p such that the sum of all elements of A
is divisible by p.
12
Proposed by-Poland
Problem 58 (1996, Problem 3). Let N0 denote the set of non-negative integers. Find all f : N0 N0 s.t.
for all n, m N0
Proposed by-Romania
Problem 59 (1996, Problem 4). The positive integers a and b are such that
the numbers 15a + 16b and 16a 15b are both squares of positive integers.
What is the least possible value that can be taken on by the smaller of these
two squares?
Proposed by-Russia
Problem 60 (1996, Problem 6). Let p, q, n be three positive integers s.t.
p + q < n. Let (x0 , x1 , ..., xn ) be a n + 1-tuple of integers satisfying
(a) x0 = xn = 0
(b) For each i with 1 i n, xi xi1 = p or xi xi1 = q. Show
that there exists a pair (i, j) of distinct indices with (i, j) 6= (0, n) such that
xi = xj .
Proposed by-France
Problem 61 (1997, Problem 5). Find all pairs of integers x, y s.t.
2
xy = y x
Proposed by-Czechoslovakia
Problem 62 (1997, Problem 6). For a positive integer n, let f (n) denote
the number of ways to represent n as a sum of non-negative integer powers
of 2. Representations that differ only in the ordering in their summation are
not considered to be distinct(For example, f (4) = 4). Prove the inequality
2
n2
4
f (n) 2
13
n2
2
Proposed by-Lithuania
Problem 63 (1998, Problem 3). For any n N, (n) denotes the number
of positive divisors of n. Determine all positive integers m s.t.
m=
(k 2 )
(k)
has a solution.
Proposed by-Belarus
Problem 64 (1998, Problem 4). Determine all pairs (x, y) of positive integers such that
xy 2 + y + 7|x2 y + x + y
Proposed by-United Kingdom
Problem 65 (1998, Problem 6). Determine the least possible value of f (1998),
where f is a function from the set N of positive integers into itself such that
for all m, n, N,
f (n2 f (m)) = m f (n)2
Proposed by-Bulgaria
Problem 66 (1999, Problem 4). Find all pairs of positive integers (x, p) such
that x 2p, p P, and
xp1 |(p 1)x + 1
Proposed by-Taiwan
Problem 67 (2000, Problem 5). Does there exist a positive integer n such
that n has exactly 2000 prime divisors and n|2n + 1.
Proposed by-Russia
Problem 68 (2001, Problem 4). Let n be an odd positive integer greater
than 1 and c1 , c2 , ..., cn be integers. For each permutation a = (a1 , a2 , ..., an )
of (1, 2, ..., n) define
n
X
S(a) =
c i ai
i=1
Proposed by-Canada
Problem 69 (2001, Problem 6). Let a > b > c > d be positive integers and
suppose
ac + bd = (b + d + a c)b + d a + c
Prove that, ad + bc isnt a prime.
Proposed by-Bulgaria
Problem 70 (2002, Problem 3). Find all pairs of positive integers m, n 3
for which there exist infinitely many positive integers a such that
an + a2 1|am + a 1
Proposed by-Romania
Problem 71 (2002, Problem 4). Let n 2 be a positive integer, with
divisors 1 = d1 < d2 < ... < dk = n. Prove that
d1 d2 + d2 d3 + + dk1 dk
is always less than n2 , and determine when it is a divisor of n2 .
Proposed by-Romania
Problem 72 (2003, Problem 2). Determine all pairs (a, b) of positive integers
such that
a2
N
2ab2 b3 + 1
Proposed by-Bulgaria
Problem 73 (2003, Problem 6). Let p be a prime number. Prove that there
exists a prime number q such that for every integer n, the number np p is not
divisible by q.
Proposed by-France
Problem 74 (2004, Problem 6). We call a positive integer alternate if its
decimal digits are alternately odd and even. Find all positive integers n such
that n has an alternate multiple.
15
Proposed by-Iran
Problem 75 (2005, Problem 2). Let a1 , a2 , ... be a sequence of integers with
infinitely many positive terms and infinitely many negative terms. Suppose
that for each positive integer n , the numbers a1 , a2 , ..., an gives different
remainder upon division by n. Prove that each integer occurs exactly once
in the sequence.
Proposed by-Holland
Problem 76 (2006, Problem 4). Consider the sequence a1 , a2 , ... defined by
an = 2n + 3n + 6n 1
Determine all positive integers that are relatively prime to every term of the
sequence.
Proposed by-Poland
Problem 77 (2006, Problem 4). Determine all pairs (x, y) of integers such
that
1 + 2x + 22x+1 = y 2
Problem 78 (2006, Problem 5). Let P (x) be a polynomial in x with deg(P ) =
n > 1 and k N.
Q(x) = P (P (...(P (x))...))
where P occurs k times. Prove that there are at most n integers t such that
Q(t) = t
Proposed by-Dan Schwarz, Romania
Problem 79 (2007, Problem 5). Let a and b be positive integers s.t.
4ab 1|(4a2 1)2
Prove that, a = b.
Proposed by-Kevin Buzzard and Edward Crane, United Kingdom
16
2
Problem 80 (2008, Problem 3). Prove
that there are infinite n s.t. n + 1
has a prime factor greater than 2n + 2n.
Problem 81 (2009, Problem 1). Let n be a positive integer and let a1 , ..., ak (k
2) be distinct integers in the set {1, 2, ..., n} s.t.
n|ai (ai+1 1)
for i = 1, 2, ..., k 1. Prove that n|ak (a1 1).
Proposed by - Ross Atkins, Australia
Problem 82 (2009, Problem 3). Let s1 , s2 , ... be a strictly increasing sequence of positive integers. If
ss1 , ss2 , ..., ssn
are both arithmetic sequences, then show that, s1 , s2 , ... it-self is an arithmetic
sequence.
Proposed by - Gabriel Carroll, United States of America
Problem 83 (2009, Problem 5). Determine all functions f from the set
of positive integers to the set of positive integers such that, for all positive
integers a and b, there exists a non-degenerate triangle with sides of lengths
a, f (b) and f (b + f (a) 1)
A triangle is non-degenerate if its vertices are not collinear.
Proposed by - France
Problem 84 (2010, Problem 1). Find all function f : R R such that for
all x, y R the following equality holds
f (bxc y) = f (x) bf (y)c
where bac is greatest integer not greater than a.
Proposed by - Pierre Bornsztein, France
17
18
Problem 90 (2013, Problem 1). Prove that for any pair of positive integers k
and n, there exist k positive integers m1 , m2 , ..., mk (not necessarily different)
such that
1
1
1
2k 1
= (1 +
)(1 +
)...(1 +
)
1+
n
m1
m2
mk
Proposed by - Japan
Problem 91 (2014, Problem 1). Let a0 < a1 < a2 < be an infinite
sequence of positive integers, Prove that there exists a unique integer n 1
such that
a0 + a1 + + an
an <
an+1 .
n
Proposed by - Austria
Problem 92 (2014, Problem 5). For each positive integer n, the Bank of
Cape Town issues coins of denomination n1 . Given a finite collection of such
coins (of not necessarily different denominations) with total value at most
99+ 12 , prove that it is possible to split this collection into 100 or fewer groups,
such that each group has total value at most 1.
Proposed by - Luxembourg
Problem 93 (2015, Problem 2). Find all postive integers (a, b, c) such that
ab c,
bc a,
ca b
19