Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2013 Indonesia MO Problems"

(2013 Indonesia MO Problems are up!)
 
m
 
Line 54: Line 54:
 
===Problem 4===
 
===Problem 4===
  
−
Suppose <math>p > 3</math> is a prime number and
+
Suppose <math>p > 3</math> is a prime number and
 
<cmath>S = \sum_{2 \le i < j < k \le p-1} ijk</cmath>
 
<cmath>S = \sum_{2 \le i < j < k \le p-1} ijk</cmath>
 
Prove that <math>S+1</math> is divisible by <math>p</math>.
 
Prove that <math>S+1</math> is divisible by <math>p</math>.
Line 76: Line 76:
  
 
a. Prove that <math>2013</math> is strong.
 
a. Prove that <math>2013</math> is strong.
 +
 
b. If <math>m</math> is strong, determine the smallest <math>y</math> (in terms of <math>m</math>) such that <math>y^{my} + 1</math> is divisible by <math>2^m</math>.
 
b. If <math>m</math> is strong, determine the smallest <math>y</math> (in terms of <math>m</math>) such that <math>y^{my} + 1</math> is divisible by <math>2^m</math>.
  
Line 91: Line 92:
  
 
a. Find a 9-element balanced set.
 
a. Find a 9-element balanced set.
 +
 
b. Prove that no set of <math>2013</math> elements can be balanced.
 
b. Prove that no set of <math>2013</math> elements can be balanced.
  

Latest revision as of 23:29, 12 August 2018

Day 1

Problem 1

In a $4 \times 6$ grid, all edges and diagonals are drawn (see attachment). Determine the number of parallelograms in the grid that uses only the line segments drawn and none of its four angles are right.

[asy] draw((0,0)--(6,0)--(6,4)--(0,4)--(0,0)); for (int i=1; i<6; ++i) { draw((i,0)--(i,4)); } for (int i=1; i<4; ++i) { draw((0,i)--(6,i)); } draw((0,1)--(1,0)); draw((0,2)--(2,0)); draw((0,3)--(3,0)); draw((0,4)--(4,0)); draw((1,4)--(5,0)); draw((2,4)--(6,0)); draw((3,4)--(6,1)); draw((4,4)--(6,2)); draw((5,4)--(6,3)); draw((0,3)--(1,4)); draw((0,2)--(2,4)); draw((0,1)--(3,4)); draw((0,0)--(4,4)); draw((1,0)--(5,4)); draw((2,0)--(6,4)); draw((3,0)--(6,3)); draw((4,0)--(6,2)); draw((5,0)--(6,1)); [/asy]

Solution

Problem 2

Let $ABC$ be an acute triangle and $\omega$ be its circumcircle. The bisector of $\angle BAC$ intersects $\omega$ at [another point] $M$. Let $P$ be a point on $AM$ and inside $\triangle ABC$. Lines passing $P$ that are parallel to $AB$ and $AC$ intersects $BC$ on $E, F$ respectively. Lines $ME, MF$ intersects $\omega$ at points $K, L$ respectively. Prove that $AM, BL, CK$ are concurrent.

Solution

Problem 3

Determine all positive real $M$ such that for any positive reals $a,b,c$, at least one of $a + \dfrac{M}{ab}, b + \dfrac{M}{bc}, c + \dfrac{M}{ca}$ is greater than or equal to $1+M$.

Solution

Problem 4

Suppose $p > 3$ is a prime number and \[S = \sum_{2 \le i < j < k \le p-1} ijk\] Prove that $S+1$ is divisible by $p$.

Solution

Day 2

Problem 5

Let $P$ be a quadratic (polynomial of degree two) with a positive leading coefficient and negative discriminant. Prove that there exists three quadratics $P_1, P_2, P_3$ such that:

  • $P(x) = P_1(x) + P_2(x) + P_3(x)$
  • $P_1, P_2, P_3$ have positive leading coefficients and zero discriminants (and hence each has a double root)
  • The roots of $P_1, P_2, P_3$ are different

Solution

Problem 6

A positive integer $n$ is called "strong" if there exists a positive integer $x$ such that $x^{nx} + 1$ is divisible by $2^n$.

a. Prove that $2013$ is strong.

b. If $m$ is strong, determine the smallest $y$ (in terms of $m$) such that $y^{my} + 1$ is divisible by $2^m$.

Solution

Problem 7

Let $ABCD$ be a parallelogram. Construct squares $ABC_1D_1, BCD_2A_2, CDA_3B_3, DAB_4C_4$ on the outer side of the parallelogram. Construct a square having $B_4D_1$ as one of its sides and it is on the outer side of $AB_4D_1$ and call its center $O_A$. Similarly do it for $C_1A_2, D_2B_3, A_3C_4$ to obtain $O_B, O_C, O_D$. Prove that $AO_A = BO_B = CO_C = DO_D$.

Solution

Problem 8

Let $A$ be a set of positive integers. $A$ is called "balanced" if [and only if] the number of 3-element subsets of $A$ whose elements add up to a multiple of $3$ is equal to the number of 3-element subsets of $A$ whose elements add up to not a multiple of $3$.

a. Find a 9-element balanced set.

b. Prove that no set of $2013$ elements can be balanced.

Solution

See Also

2013 Indonesia MO (Problems)
Preceded by
2012 Indonesia MO 		1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 Followed by
2014 Indonesia MO
All Indonesia MO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2013_Indonesia_MO_Problems&oldid=97213"