Let $ p$ be the product of two consecutive integers greater than 2. Show that there are no integers $ x_1, x_2, \ldots, x_p$ satisfying the equation \[ \sum^p_{i \equal{} 1} x^2_i \minus{} \frac {4}{4 \cdot p \plus{} 1} \left( \sum^p_{i \equal{} 1} x_i \right)^2 \equal{} 1 \] [b]OR[/b] Show that there are only two values of $ p$ for which there are integers $ x_1, x_2, \ldots, x_p$ satisfying \[ \sum^p_{i \equal{} 1} x^2_i \minus{} \frac {4}{4 \cdot p \plus{} 1} \left( \sum^p_{i \equal{} 1} x_i \right)^2 \equal{} 1 \]

Prove that for each prime number $p$ and positive integer $n$, $p^n$ divides \[\binom{p^n}{p}-p^{n-1}. \]

Find all primes $p,q, r$ such that $\frac{p^{2q}+q^{2p}}{p^3-pq+q^3} = r$. Titu Andreescu, Mathematics Department, College of Texas, USA

Let $k > 1$ be a positive integer and $n \ge 2019$ be an odd positive integer. The non-zero rational numbers $x_1, x_2,..., x_n$ are not all equal, and satisfy the following chain of equalities: $$x_1 +\frac{k}{x_2}= x_2 +\frac{k}{x_3}= x_3 +\frac{k}{x_4}= ... = x_{n-1} +\frac{k}{x_n}= x_n +\frac{k}{x_1}.$$ What is the smallest possible value of $k$?

Let $n\geq2$ be an integer. An $n$-tuple $(a_1,a_2,\dots,a_n)$ of not necessarily different positive integers is [i]expensive[/i] if there exists a positive integer $k$ such that $$(a_1+a_2)(a_2+a_3)\dots(a_{n-1}+a_n)(a_n+a_1)=2^{2k-1}.$$ a) Find all integers $n\geq2$ for which there exists an expensive $n$-tuple. b) Prove that for every odd positive integer $m$ there exists an integer $n\geq2$ such that $m$ belongs to an expensive $n$-tuple. [i]There are exactly $n$ factors in the product on the left hand side.[/i]

For a positive integer $a$, $a'$ is the integer obtained by the following method: the decimal writing of $a'$ is the inverse of the decimal writing of $a$ (the decimal writing of $a'$ can begin by zeros, but not the one of $a$); for instance if $a=2370$, $a'=0732$, that is $732$. Let $a_{1}$ be a positive integer, and $(a_{n})_{n \geq 1}$ the sequence defined by $a_{1}$ and the following formula for $n \geq 1$: \[a_{n+1}=a_{n}+a'_{n}. \] Can $a_{7}$ be prime?

Let $m$ and $n$ be positive integers such that $$(m^3 -27)(n^3- 27) = 27(m^2n^2 + 27):$$ Find the maximum possible value of $m^3 + n^3$.

Find all integer solutions to the equation \[(x^2-x)(x^2-2x+2)=y^2-1\]

Find the last two digits of $11^{1998}$

Find all positive intgers $a,b$ and $c$ such that $\frac{a+b}{a+c}=\frac{b+c}{b+a}$ and $ab+bc+ca$ is a prime number

Determine all functions $f: \mathbb{Z}_{\geq 2025} \to \mathbb{Z}_{>0}$ such that $mn+1$ divides $f(m)f(n) + 1$ for any integers $m,n \geq 2025$ and there exists a polynomial $P$ with integer coefficients, such that $f(n) \leq P(n)$ for all $n\geq 2025$.

Find all nonnegative integer solutions to $2^a + 3^b + 5^c = n!$. [i]Proposed by Mark Sellke[/i]

Let $n$ be a positive integer. We say that a natural number $k$ has the property $C_n$ if there exist $2k$ distinct positive integers $a_1,b_1,\ldots,a_k,b_k$ such that the sums $a_1+b_1,\ldots,a_k+b_k$ are distinct and strictly smaller than $n$. (a) Prove that if $k$ has the property $C_n$ then $k\le \frac{2n-3}{5}$. (b) Prove that $5$ has the property $C_{14}$. (c) If $(2n-3)/5$ is an integer, prove that it has the property $C_n$.

We call a composite positive integer $n$ nice if it is possible to arrange its factors that are larger than $1$ on a circle such that two neighboring numbers are not coprime. How many of the elements of the set $\{1, 2, 3, ..., 100\}$ are nice?

Let $\, p \,$ be an odd prime. The sequence $(a_n)_{n \geq 0}$ is defined as follows: $\, a_0 = 0,$ $a_1 = 1, \, \ldots, \, a_{p-2} = p-2 \,$ and, for all $\, n \geq p-1, \,$ $\, a_n \,$ is the least positive integer that does not form an arithmetic sequence of length $\, p \,$ with any of the preceding terms. Prove that, for all $\, n, \,$ $\, a_n \,$ is the number obtained by writing $\, n \,$ in base $\, p-1 \,$ and reading the result in base $\, p$.

Arnold is studying the prevalence of three health risk factors, denoted by A, B, and C. within a population of men. For each of the three factors, the probability that a randomly selected man in the population as only this risk factor (and none of the others) is 0.1. For any two of the three factors, the probability that a randomly selected man has exactly two of these two risk factors (but not the third) is 0.14. The probability that a randomly selected man has all three risk factors, given that he has A and B is $\tfrac{1}{3}$. The probability that a man has none of the three risk factors given that he does not have risk factor A is $\tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Let $G$ be a hyper elementary abelian $p-$group and let $f : G \rightarrow G$ be a homomorphism. Then prove that $\ker f$ is isomorphic to $\mathrm{coker} f$.

$a)$ Let $p$ and $q$ be distinct prime numbers such that $p+q^2$ divides $p^2+q$. Prove that $p+q^2$ divides $pq-1$. $b)$ Find all prime numbers $p$ such that $p+121$ divides $p^2+11$.

Let $p$ be a prime number. Find all integers $k$ for which $\sqrt{k^2 -pk}$ is a positive integer.

[u]Part 6 [/u] [b]p16.[/b] Le[b][/b]t $p(x)$ and $q(x)$ be polynomials with integer coefficients satisfying $p(1) = q(1)$. Find the greatest integer $n$ such that $\frac{p(2023)-q(2023)}{n}$ is an integer no matter what $p(x)$ and $q(x)$ are. [b]p17.[/b] Find all ordered pairs of integers $(m,n)$ that satisfy $n^3 +m^3 +231 = n^2m^2 +nm.$ [b]p18.[/b] Ben rolls the frustum-shaped piece of candy (shown below) in such a way that the lateral area is always in contact with the table. He rolls the candy until it returns to its original position and orientation. Given that $AB = 4$ and $BD =CD = 3$, find the length of the path traced by $A$. [u]Part 7 [/u] [b]p19.[/b] In their science class, Adam, Chris, Eddie and Sam are independently and randomly assigned an integer grade between $70$ and $79$ inclusive. Given that they each have a distinct grade, what is the expected value of the maximum grade among their four grades? [b]p20.[/b] Let $ABCD$ be a regular tetrahedron with side length $2$. Let point $E$ be the foot of the perpendicular from $D$ to the plane containing $\vartriangle ABC$. There exist two distinct spheres $\omega_1$ and $\omega_2$, centered at points $O_1$ and $O_2$ respectively, such that both $O_1$ and $O_2$ lie on $\overrightarrow{DE}$ and both spheres are tangent to all four of the planes $ABC$, $BCD$, $CDA$, and $DAB$. Find the sum of the volumes of $\omega_1$ and $\omega_2$. [b]p21.[/b] Evaluate $$\sum^{\infty}_{i=0}\sum^{\infty}_{j=0}\sum^{\infty}_{k=0} \frac{1}{(i + j +k +1)2^{i+j+k+1}}.$$ [u]Part 8 [/u] [b]p22.[/b] In $\vartriangle ABC$, let $I_A$, $I_B$ , and $I_C$ denote the $A$, $B$, and $C$-excenters, respectively. Given that $AB = 15$, $BC = 14$ and $C A = 13$, find $\frac{[I_A I_B I_C ]}{[ABC]}$ . [b]p23.[/b] The polynomial $x +2x^2 +3x^3 +4x^4 +5x^5 +6x^6 +5x^7 +4x^8 +3x^9 +2x^{10} +x^{11}$ has distinct complex roots $z_1, z_2, ..., z_n$. Find $$\sum^n_{k=1} |R(z^2n))|+|I(z^2n)|,$$ where $R(z)$ and $I(z)$ indicate the real and imaginary parts of $z$, respectively. Express your answer in simplest radical form. [b]p24.[/b] Given that $\sin 33^o +2\sin 161^o \cdot \sin 38^o = \sin n^o$ , compute the least positive integer value of $n$. [u]Part 9[/u] [b]p25.[/b] Submit a prime between $2$ and $2023$, inclusive. If you don’t, or if you submit the same number as another team’s submission, you will receive $0$ points. Otherwise, your score will be $\min \left(30, \lfloor 4 \cdot ln(x) \rfloor \right)$, where $x$ is the positive difference between your submission and the closest valid submission made by another team. [b]p26.[/b] Sam, Derek, Jacob, andMuztaba are eating a very large pizza with $2023$ slices. Due to dietary preferences, Sam will only eat an even number of slices, Derek will only eat a multiple of $3$ slices, Jacob will only eat a multiple of $5$ slices, andMuztaba will only eat a multiple of $7$ slices. How many ways are there for Sam, Derek, Jacob, andMuztaba to eat the pizza, given that all slices are identical and order of slices eaten is irrelevant? If your answer is $A$ and the correct answer is $C$, the number of points you receive will be: irrelevant? If your answer is $A$ and the correct answer is $C$, the number of points you receive will be: $$\max \left( 0, \left\lfloor 30 \left( 1-2\sqrt{\frac{|A-C|}{C}}\right)\right\rfloor \right)$$ [b]p27.[/b] Let $ \Omega_(k)$ denote the number of perfect square divisors of $k$. Compute $$\sum^{10000}_{k=1} \Omega_(k).$$ If your answer is $A$ and the correct answer is $C$, the number of points you recieve will be $$\max \left( 0, \left\lfloor 30 \left( 1-4\sqrt{\frac{|A-C|}{C}}\right)\right\rfloor \right)$$ PS. You should use hide for answers. Rounds 1-5 have been posted [url=https://artofproblemsolving.com/community/c3h3267911p30056982]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all positive integers $n$ such that $n!+2$ divides $(2n)!$.

$ S\subset\mathbb N$ is called a square set, iff for each $ x,y\in S$, $ xy\plus{}1$ is square of an integer. a) Is $ S$ finite? b) Find maximum number of elements of $ S$.

Find all pairs of positive integers $(x, y)$ such that $\frac{xy^3}{x+y}$ is the cube of a prime.

We call [i]Pythagorean triple[/i] a triple $(x,y,z)$ of positive integers such that $x<y<z$ and $x^2+y^2=z^2$. Prove that for all $n \in \mathbb{N}$ number $2^{n+1}$ is in exactly $n$ [i]Pythagorean triples[/i]

In my calculator, one of the keys from $1$ to $9$ does not work properly: when you press it, a digit between $1$ and $9$ appears on the screen that is not the correct one. When I tried to write the number $987654321$, a number divisible by $11$ appeared on the screen and leaves a remainder of $3$ when divided by $9$. What is the broken key? What is the number that appeared on the screen?