Find all prime numbers $ p$ and $ q$ such that $ p$ divides $ q\plus{}6$ and $ q$ divides $ p\plus{}6$.

Let $L_1$ and $L_2$ be distinct lines in the plane. Prove that $L_1$ and $L_2$ intersect if and only if, for every real number $\lambda\ne 0$ and every point $P$ not on $L_1$ or $L_2,$ there exist points $A_1$ on $L_1$ and $A_2$ on $L_2$ such that $\overrightarrow{PA_2}=\lambda\overrightarrow{PA_1}.$

Prove that existence of a constant $c$ with the following property: for every composite integer $n$, there exists a group whose order is divisible by $n$ and is less than $n^c$, and that contains no element of order $n$. [P. P. Palfy]

Find with proof all positive $3$ digit integers $\overline{abc}$ satisfying \[ b\cdot \overline{ac}=c \cdot \overline{ab} +10 \]

Berk tries to guess the two-digit number that Ayca picks. After each guess, Ayca gives a hint indicating the number of digits which match the number picked. If Berk can guarantee to guess Ayca's number in $n$ guesses, what is the smallest possible value of $n$? $ \textbf{(A)}\ 9 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 15 \qquad\textbf{(E)}\ 20 $

Let $p$ be a prime, $n$ be a positive integer, and let $\mathbb{Z}_{p^n}$ denote the set of congruence classes modulo $p^n.$ Determine the number of functions $f: \mathbb{Z}_{p^n} \to \mathbb{Z}_{p^n}$ satisfying the condition \[ f(a)+f(b) \equiv f(a+b+pab) \pmod{p^n} \] for all $a,b \in \mathbb{Z}_{p^n}.$

A square's area is equal to the perimeter of a $15$ by $17$ rectangle. What is this square's perimeter? $\textbf{(A) }20\qquad\textbf{(B) }32\qquad\textbf{(C) }36\qquad\textbf{(D) }40\qquad\textbf{(E) }56$

Let $ n$ be a positive integer and let $ a_1,a_2,\ldots,a_n$ be positive real numbers such that: \[ \sum^n_{i \equal{} 1} a_i \equal{} \sum^n_{i \equal{} 1} \frac {1}{a_i^2}. \] Prove that for every $ i \equal{} 1,2,\ldots,n$ we can find $ i$ numbers with sum at least $ i$.

Prove that if $x, y, z$ are real numbers such that $x^2+y^2+z^2 = 2$, then \[x + y + z \leq xyz + 2.\]

Let $a,b,a_2,\ldots,a_{n-2}$ be real numbers with $ab\ne0$ such that all the roots of the equation $$ax^n-ax^{n-1}+a_2x^{n-2}+\ldots+a_{n-2}x^2-n^2bx+b=0$$are positive and real. Prove that these roots are all equal.

In the television program “Field of Miracles,” the presenter played the prize as follows. The player was shown three boxes, one of which contained a prize. The player pointed to one of the boxes, after which the leader opened one of the other two remaining boxes, which turned out to be empty. After this, the player could either insist on the original choice, or change it and choose the third box. In what case does his chance of winning increase? (There are three possible answers: both boxes are equal, it is better to keep the original choice, it is better to change it. Try to justify your answer.)

Let $ a$ be a real number. Prove that if the equation $ x^2\minus{}ax\plus{}a\equal{}0$ has two real roots $ x_1$ and $ x_2$, then: $ x_1^2\plus{}x_2^2 \ge 2(x_1\plus{}x_2).$

Let $ a, b, c$ be positive integers for which $ abc \equal{} 1$. Prove that $ \sum \frac{1}{b(a\plus{}b)} \ge \frac{3}{2}$.

A trader owns horses of $3$ races, and exacly $b_j$ of each race (for $j=1,2,3$). He want to leave these horses heritage to his $3$ sons. He knowns that the boy $i$ for horse $j$ (for $i,j=1,2,3$) would pay $a_{ij}$ golds, such that for distinct $i,j$ holds holds $a_{ii}> a_{ij}$ and $a_{jj} >a_{ij}$. Prove that there exists a natural number $n$ such that whenever it holds $\min\{b_1,b_2,b_3\}>n$, trader can give the horses to their sons such that after getting the horses each son values his horses more than the other brother is getting, individually.

Let $\vartriangle ABC$ be an equilateral triangle with side $1$. $1011$ points $P_1$, $P_2$, $P_3$, $...$, $P_{1011}$ on the side $AC$ and $1011$ points $Q_1$, $Q_2$, $Q_3$, $...$ ,$ Q_{1011}$ on side AB (see figure) in such a way as to generate $2023$ triangles of equal area. Find the length of the segment $AP_{1011}$. [img]https://cdn.artofproblemsolving.com/attachments/f/6/fea495c16a0b626e0c3882df66d66011a1a3af.png[/img] PS. Harder version of [url=https://artofproblemsolving.com/community/c4h3323135p30741470]2023 Chile NMO L1 P3[/url]

Let $a_0, a_1,...$ be a sequence of non-negative integers and $b_0, b_1,... $ be a sequence of non-negative integers defined by the following rule: $b_i=gcd(a_i, a_{i+1})$ for every $i=>0$ Is it possible every positive integer to occur exactly once in the sequence $b_0, b_1,... $

Let $ABCD$ be a convex quadrilateral and let $P$ be the intersection of the diagonals $AC$ and $BD$. The radii of the circles inscribed in the triangles $\vartriangle ABP$, $\vartriangle BCP$, $\vartriangle CDP$ and $\vartriangle DAP$ are the same. Prove that $ABCD$ is a rhombus,

The circumference of the circle with center $O$ is divided into 12 equal arcs, marked the letters $A$ through $L$ as seen below. What is the number of degrees in the sum of the angles $x$ and $y$? [asy] size(230); defaultpen(linewidth(0.65)); pair O=origin; pair[] circum = new pair[12]; string[] let = {"$A$","$B$","$C$","$D$","$E$","$F$","$G$","$H$","$I$","$J$","$K$","$L$"}; draw(unitcircle); for(int i=0;i<=11;i=i+1) { circum[i]=dir(120-30*i); dot(circum[i],linewidth(2.5)); label(let[i],circum[i],2*dir(circum[i])); } draw(O--circum[4]--circum[0]--circum[6]--circum[8]--cycle); label("$x$",circum[0],2.75*(dir(circum[0]--circum[4])+dir(circum[0]--circum[6]))); label("$y$",circum[6],1.75*(dir(circum[6]--circum[0])+dir(circum[6]--circum[8]))); label("$O$",O,dir(60)); [/asy] $\textbf{(A) }75\qquad\textbf{(B) }80\qquad\textbf{(C) }90\qquad\textbf{(D) }120\qquad \textbf{(E) }150$

A rising number, such as $ 34689$, is a positive integer each digit of which is larger than each of the digits to its left. There are $ \dbinom{9}{5} \equal{} 126$ five-digit rising numbers. When these numbers are arranged from smallest to largest, the $ 97$th number in the list does not contain the digit $ \textbf{(A)}\ 4\qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 6\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 8$

Let $P(x)$ be a polynomial with real coefficients. Prove that not all roots of $x^3P(x)+1$ are real.

Let $f: \mathbb{R}\to \mathbb{R}$ be a real function. Prove or disprove each of the following statements. (a) If f is continuous and range(f)=$\mathbb{R}$ then f is monotonic (b) If f is monotonic and range(f)=$\mathbb{R}$ then f is continuous (c) If f is monotonic and f is continuous then range(f)=$\mathbb{R}$

Jane has $4$ pears, $5$ bananas, $3$ lemons, $1$ orange, and $6$ apples. If she uses one of each fruit to make a fruit smoothie, what is the total number of fruits that she has left?

Given two points $P,Q$ of the plane, denote $P+Q$ the midpoint of (possibly degenerate) segment $PQ$ and $P\cdot Q$ the image of $P$ in rotation around the origin $Q$ under $+90^\circ.$ a) Are these operations commutative? b) Given two distinct points $A,B$ the equation \[Y\cdot X=(A\cdot X)+B\] defines a map $X\mapsto Y.$ Determine what the mapping is. c) Construct all fixed points of the map from b).

Prove that $\frac{5^{125}-1}{5^{25}-1}$ is a composite number.

Prove that for any $ n$, there is a subset $ \{a_1,\dots,a_n\}$ of $ \mathbb N$ such that for each subset $ S$ of $ \{1,\dots,n\}$, $ \sum_{i\in S}a_i$ has the same set of prime divisors.