MathDB
Problems
Contests
National and Regional Contests
Saudi Arabia Contests
Saudi Arabia IMO TST
2013 Saudi Arabia IMO TST
2013 Saudi Arabia IMO TST
Part of
Saudi Arabia IMO TST
Subcontests
(4)
4
3
Hide problems
numbers 1, 2,...,2012 in a circle
Determine whether it is possible to place the integers
1
,
2
,
.
.
.
,
2012
1, 2,...,2012
1
,
2
,
...
,
2012
in a circle in such a way that the
2012
2012
2012
products of adjacent pairs of numbers leave pairwise distinct remainders when divided by
2013
2013
2013
.
each pos. integer exactly once in |a_1- a_2|,|a_2 - a_3|, ...,|a_k- a_{k+1}|,...
Determine if there exists an infinite sequence of positive integers
a
1
,
a
2
,
a
3
,
.
.
.
a_1,a_2, a_3, ...
a
1
,
a
2
,
a
3
,
...
such that (i) each positive integer occurs exactly once in the sequence, and (ii) each positive integer occurs exactly once in the sequence
∣
a
1
−
a
2
∣
,
∣
a
2
−
a
3
∣
,
.
.
.
,
∣
a
+
k
−
a
k
+
1
∣
,
.
.
.
|a_1 - a_2|, |a_2 - a_3|, ..., |a+k - a_{k+1}|, ...
∣
a
1
−
a
2
∣
,
∣
a
2
−
a
3
∣
,
...
,
∣
a
+
k
−
a
k
+
1
∣
,
...
2^n - 1 is divisible by p(n)
Find all polynomials
p
(
x
)
p(x)
p
(
x
)
with integer coefficients such that for each positive integer
n
n
n
, the number
2
n
−
1
2^n - 1
2
n
−
1
is divisible by
p
(
n
)
p(n)
p
(
n
)
.
3
3
Hide problems
a Saudi company has 2 offices, no of correspondents from each office
A Saudi company has two offices. One office is located in Riyadh and the other in Jeddah. To insure the connection between the two offices, the company has designated from each office a number of correspondents so that : (a) each pair of correspondents from the same office share exactly one common correspondent from the other office. (b) there are at least
10
10
10
correspondents from Riyadh. (c) Zayd, one of the correspondents from Jeddah, is in contact with exactly
8
8
8
correspondents from Riyadh. What is the minimum number of correspondents from Jeddah who are in contact with the correspondent Amr from Riyadh?
max of p% of all divisors of n with their unit digit equal to 3
For a positive integer
n
n
n
, we consider all its divisors (including
1
1
1
and itself). Suppose that
p
%
p\%
p
%
of these divisors have their unit digit equal to
3
3
3
. (For example
n
=
117
n = 117
n
=
117
, has six divisors, namely
1
,
3
,
9
,
13
,
39
,
117
1,3,9,13,39,117
1
,
3
,
9
,
13
,
39
,
117
. Two of these divisors namely
3
3
3
and
13
13
13
, have unit digits equal to
3
3
3
. Hence for
n
=
117
n = 117
n
=
117
,
p
=
33.33...
p =33.33...
p
=
33.33...
). Find, when
n
n
n
is any positive integer, the maximum possible value of
p
p
p
.
2 circumcircles and a line concurrent
Let
A
B
C
ABC
A
BC
be an acute triangle,
M
M
M
be the midpoint of
B
C
BC
BC
and
P
P
P
be a point on line segment
A
M
AM
A
M
. Lines
B
P
BP
BP
and
C
P
CP
CP
meet the circumcircle of
A
B
C
ABC
A
BC
again at
X
X
X
and
Y
Y
Y
, respectively, and sides
A
C
AC
A
C
at
D
D
D
and
A
B
AB
A
B
at
E
E
E
, respectively. Prove that the circumcircles of
A
X
D
AXD
A
X
D
and
A
Y
E
AYE
A
Y
E
have a common point
T
≠
A
T \ne A
T
=
A
on line
A
M
AM
A
M
.
2
3
Hide problems
n + f(f(n)) <= 2f(n) , strictly increasing
Let
S
=
f
{
0.1.2.3
,
.
.
.
}
S = f\{0.1. 2.3,...\}
S
=
f
{
0.1.2.3
,
...
}
be the set of the non-negative integers. Find all strictly increasing functions
f
:
S
→
S
f : S \to S
f
:
S
→
S
such that
n
+
f
(
f
(
n
)
)
≤
2
f
(
n
)
n + f(f(n)) \le 2f(n)
n
+
f
(
f
(
n
))
≤
2
f
(
n
)
for every
n
n
n
in
S
S
S
concyclic wanted, altitudes related
Let
A
B
C
ABC
A
BC
be an acute triangle, and let
A
A
1
,
B
B
1
AA_1, BB_1
A
A
1
,
B
B
1
, and
C
C
1
CC_1
C
C
1
be its altitudes. Segments
A
A
1
AA_1
A
A
1
and
B
1
C
1
B_1C_1
B
1
C
1
meet at point
K
K
K
. The perpendicular bisector of segment
A
1
K
A_1K
A
1
K
intersects sides
A
B
AB
A
B
and
A
C
AC
A
C
at
L
L
L
and
M
M
M
, respectively. Prove that points
A
,
A
1
,
L
A,A_1, L
A
,
A
1
,
L
, and
M
M
M
lie on a circle.
a_1 + a_2 + .. + a_n >= n^2 and a_1^2 + a_2^2 + ... + a_n^2 <= n^3 + 1
Given an integer
n
≥
2
n \ge 2
n
≥
2
, determine the number of ordered
n
n
n
-tuples of integers
(
a
1
,
a
2
,
.
.
.
,
a
n
)
(a_1, a_2,...,a_n)
(
a
1
,
a
2
,
...
,
a
n
)
such that (a)
a
1
+
a
2
+
.
.
+
a
n
≥
n
2
a_1 + a_2 + .. + a_n \ge n^2
a
1
+
a
2
+
..
+
a
n
≥
n
2
and (b)
a
1
2
+
a
2
2
+
.
.
.
+
a
n
2
≤
n
3
+
1
a_1^2 + a_2^2 + ... + a_n^2 \le n^3 + 1
a
1
2
+
a
2
2
+
...
+
a
n
2
≤
n
3
+
1
1
3
Hide problems
Concurrent Lines
Triangle
A
B
C
ABC
A
BC
is inscribed in circle
ω
\omega
ω
. Point
P
P
P
lies inside triangle
A
B
C
ABC
A
BC
.Lines
A
P
,
B
P
AP,BP
A
P
,
BP
and
C
P
CP
CP
intersect
ω
\omega
ω
again at points
A
1
A_1
A
1
,
B
1
B_1
B
1
and
C
1
C_1
C
1
(other than
A
,
B
,
C
A, B, C
A
,
B
,
C
), respectively. The tangent lines to
ω
\omega
ω
at
A
1
A_1
A
1
and
B
1
B_1
B
1
intersect at
C
2
C_2
C
2
.The tangent lines to
ω
\omega
ω
at
B
1
B_1
B
1
and
C
1
C_1
C
1
intersect at
A
2
A_2
A
2
. The tangent lines to
ω
\omega
ω
at
C
1
C_1
C
1
and
A
1
A_1
A
1
intersect at
B
2
B_2
B
2
. Prove that the lines
A
A
2
,
B
B
2
AA_2,BB_2
A
A
2
,
B
B
2
and
C
C
2
CC_2
C
C
2
are concurrent.
min, max of (1-x_1)(1-y_1)+(1-x_2)(1-y_2) when x_1^2+x_2^2=y_1^2+y_2^2=2013
Find the maximum and the minimum values of
S
=
(
1
−
x
1
)
(
1
−
y
1
)
+
(
1
−
x
2
)
(
1
−
y
2
)
S = (1 - x_1)(1 -y_1) + (1 - x_2)(1 - y_2)
S
=
(
1
−
x
1
)
(
1
−
y
1
)
+
(
1
−
x
2
)
(
1
−
y
2
)
for real numbers
x
1
,
x
2
,
y
1
,
y
2
x_1, x_2, y_1,y_2
x
1
,
x
2
,
y
1
,
y
2
with
x
1
2
+
x
2
2
=
y
1
2
+
y
2
2
=
2013
x_1^2 + x_2^2 = y_1^2 + y_2^2 = 2013
x
1
2
+
x
2
2
=
y
1
2
+
y
2
2
=
2013
.
colsed path along lattice points on a m x n grid of points
Adel draws an
m
×
n
m \times n
m
×
n
grid of dots on the coordinate plane, at the points of integer coordinates
(
a
,
b
)
(a,b)
(
a
,
b
)
where
1
≤
a
≤
m
1 \le a \le m
1
≤
a
≤
m
and
1
≤
b
≤
n
1 \le b \le n
1
≤
b
≤
n
. He proceeds to draw a closed path along
k
k
k
of these dots,
(
a
1
,
b
1
)
(a_1, b_1)
(
a
1
,
b
1
)
,
(
a
2
,
b
2
)
(a_2,b_2)
(
a
2
,
b
2
)
,...,
(
a
k
,
b
k
)
(a_k,b_k)
(
a
k
,
b
k
)
, such that
(
a
i
,
b
i
)
(a_i,b_i)
(
a
i
,
b
i
)
and
(
a
i
+
1
,
b
i
+
1
)
(a_{i+1}, b_{i+1})
(
a
i
+
1
,
b
i
+
1
)
(where
(
a
k
+
1
,
b
k
+
1
)
=
(
a
1
,
b
1
)
(a_{k+1}, b_{k+1}) = (a_1, b_1)
(
a
k
+
1
,
b
k
+
1
)
=
(
a
1
,
b
1
)
) are
1
1
1
unit apart for each
1
≤
i
≤
k
1 \le i \le k
1
≤
i
≤
k
. Adel makes sure his path does not cross itself, that is, the
k
k
k
dots are distinct. Find, with proof, the maximum possible value of
k
k
k
in terms of
m
m
m
and
n
n
n
.