For prime number $p$, prove that there are integers $a$, $b$, $c$, $d$ such that for every integer $n$, the expression $n^4+1-\left( n^2+an+b \right) \left(n^2+cn+d \right)$ is a multiple of $p$.

One of Euler's conjectures was disproved in then 1960s by three American mathematicians when they showed there was a positive integer $ n$ such that \[133^5 \plus{} 110^5 \plus{} 84^5 \plus{} 27^5 \equal{} n^5.\] Find the value of $ n$.

Prove that $(0,1)$, $(0, -1)$,$( -1,1)$ and $(-1,-1)$ are the only integer solutions of $$x^2 + x +1 = y^2.$$

Prove that for any odd prime number $ p,$ the number of positive integer $ n$ satisfying $ p|n! \plus{} 1$ is less than or equal to $ cp^\frac{2}{3}.$ where $ c$ is a constant independent of $ p.$

Find the number of rational numbers $r$, $0<r<1$, such that when $r$ is written as a fraction in lowest terms, the numerator and denominator have a sum of $1000$.

Prove that you can represent an arbitrary number not exceeding $n!$ as a sum of $k$ different numbers ($k\le n$) that are divisors of $n!$.

Find all polynomials with integer coefficients $P$ such that for all positive integers $n$, the sequence $$0, P(0), P(P(0)), \cdots$$ is eventually constant modulo $n$. [i]Proposed by Ivan Chan Kai Chin[/i]

Solve in non-negative integers the equation $ 2^{a}3^{b} \plus{} 9 \equal{} c^{2}$

How many positive integers less than $2019$ are divisible by either $18$ or $21$, but not both?

Prove that for every positive integer $d > 1$ and $m$ the sequence $a_n=2^{2^n}+d$ contains two terms $a_k$ and $a_l$ ($k \neq l$) such that their greatest common divisor is greater than $m$. [i]Proposed by T. Hakobyan[/i]

The prime factorization of $12 = 2 \cdot 2 \cdot 3$ has three prime factors. Find the number of prime factors in the factorization of $12! = 12 \cdot 11 \cdot 10 \cdot 9 \cdot 8 \cdot 7 \cdot 6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 \cdot 1.$

Let $P$ be the set of all primes. Given any positive integer $n$, define $$\displaystyle f(n) = \max_{p \in P}v_p(n)$$ Prove that for any positive integer $k\ge 2$, there exists infinitely many positive integers $m$ such that \[ f(m+1) = f(m+2) = \cdots = f(m+k) \] [i]Proposed by Ivan Chan Guan Yu[/i]

Let $p$ be a prime, $A$ is an infinite set of integers. Prove that there is a subset $B$ of $A$ with $2p-2$ elements, such that the arithmetic mean of any pairwise distinct $p$ elements in $B$ does not belong to $A$.

I think we are allowed to discuss since its after 24 hours How do you do this Prove that $d(1)+d(3)+..+d(2n-1)\leq d(2)+d(4)+...d(2n)$ which $d(x)$ is the divisor function

An $\textit{Euclidean step}$ transforms a pair $(a, b)$ of positive integers, $a > b$, to the pair $(b, r)$, where $r$ is the remainder when a is divided by $b$. Let us call the $\textit{complexity}$ of a pair $(a, b)$ the number of Euclidean steps needed to transform it to a pair of the form $(s, 0)$. Prove that if $ad - bc = 1$, then the complexities of $(a, b)$ and $(c, d)$ differ at most by $2$.

If you roll six fair dice, let $\mathsf{ p}$ be the probability that exactly five different numbers appear on the upper faces of the six dice. If $\mathsf{p} = \frac{m}{n}$ where $ m $ and $n$ are relatively prime positive integers, find $m+n.$

Let $n=p_1^{a_1}p_2^{a_2}\cdots p_t^{a_t}$ be the prime factorisation of $n$. Define $\omega(n)=t$ and $\Omega(n)=a_1+a_2+\ldots+a_t$. Prove or disprove: For any fixed positive integer $k$ and positive reals $\alpha,\beta$, there exists a positive integer $n>1$ such that i) $\frac{\omega(n+k)}{\omega(n)}>\alpha$ ii) $\frac{\Omega(n+k)}{\Omega(n)}<\beta$.

Consider a recursively defined sequence $a_n$ with $a_1=1$ such that, for $n \ge 2,$ $a_n$ is formed by appending the last digit of $n$ to the end of $a_{n-1}.$ For a positive integer $m,$ let $\nu_3(m)$ be the largest integer $t$ such that $3^t \mid m.$ Compute $$\sum_{n=1}^{810} \nu_3(a_n).$$

Let $n$ be an odd positive integer. Show that the equation $$ \frac{4}{n} =\frac{1}{x} + \frac{1}{y}$$ has a solution in the positive integers if and only if $n$ has a divisor of the form $4k+3$.

[b]7.1[/b] Given a convex $n$-gon all of whose angles are obtuse. Prove that the sum of the lengths of the diagonals in it is greater than the sum of the lengths of the sides. [b]7.2[/b] Find all integer values for $x$ and $y$ such that $x^4 + 4y^4$ is a prime number[b]. (typo corrected)[/b] [b]7.3.[/b] Given a triangle $ABC$. Parallelograms $ABKL$, $BCMN$ and $ACFG$ are constructed on the sides, Prove that the segments $KN$, $MF$ and $GL$ can form a triangle. [img]https://cdn.artofproblemsolving.com/attachments/a/f/7a0264b62754fafe4d559dea85c67c842011fc.png[/img] [b]7.4 / 6.2[/b] Prove that a $10 \times 10$ chessboard cannot be covered with $ 25$ figures like [img]https://cdn.artofproblemsolving.com/attachments/0/4/89aafe1194628332ec13ad1c713bb35cbefff7.png[/img]. [b]7.5[/b] Find the greatest number of different natural numbers, each of which is less than $50$, and every two of which are coprime. [b]7.6.[/b] Given a triangle $ABC$.$ D$ and $E$ are the midpoints of the sides $AB$ and $BC$. Point$ M$ lies on $AC$ , $ME > EC$. Prove that $MD < AD$. [img]https://cdn.artofproblemsolving.com/attachments/e/c/1dd901e0121e5c75a4039d21b954beb43dc547.png[/img] PS. You should use hide for answers.Collected [url=https://artofproblemsolving.com/community/c3983461_1964_leningrad_math_olympiad]here[/url].

Is there an infinite sequence of prime numbers $p_1$, $p_2$, $\ldots$, $p_n$, $p_{n+1}$, $\ldots$ such that $|p_{n+1}-2p_n|=1$ for each $n \in \mathbb{N}$?

Study if it there exist an strictly increasing sequence of integers $0=a_0<a_1<a_2<...$ satisfying the following conditions $i)$ Any natural number can be written as the sum of two terms of the sequence (not necessarily distinct). $ii)$For any positive integer $n$ we have $a_n > \frac{n^2}{16}$

Compute the remainder when $29^{30 }+ 31^{28} + 28! \cdot 30!$ is divided by $29 \cdot 31$.

[b]p1.[/b] Fleming has a list of 8 mutually distinct integers between $90$ to $99$, inclusive. Suppose that the list has median $94$, and that it contains an even number of odd integers. If Fleming reads the numbers in the list from smallest to largest, then determine the sixth number he reads. [b]p2.[/b] Find the number of ordered pairs $(x,y)$ of three digit base-$10$ positive integers such that $x-y$ is a positive integer, and there are no borrows in the subtraction $x-y$. For example, the subtraction on the left has a borrow at the tens digit but not at the units digit, whereas the subtraction on the right has no borrows. $$\begin{tabular}{ccccc} & 4 & 7 & 2 \\ - & 1 & 9 & 1\\ \hline & 2 & 8 & 1 \\ \end{tabular}\,\,\, \,\,\, \begin{tabular}{ccccc} & 3 & 7 & 9 \\ - & 2 & 6 & 3\\ \hline & 1 & 1 & 6 \\ \end{tabular}$$ [b]p3.[/b] Evaluate $$1 \cdot 2 \cdot 3-2 \cdot 3 \cdot 4+3 \cdot 4 \cdot 5- 4 \cdot 5 \cdot 6+ ... +2017 \cdot 2018 \cdot 2019 -2018 \cdot 2019 \cdot 2020+1010 \cdot 2019 \cdot 2021$$ [b]p4.[/b] Find the number of ordered pairs of integers $(a,b)$ such that $$\frac{ab+a+b}{a^2+b^2+1}$$ is an integer. [b]p5.[/b] Lin Lin has a $4\times 4$ chessboard in which every square is initially empty. Every minute, she chooses a random square $C$ on the chessboard, and places a pawn in $C$ if it is empty. Then, regardless of whether $C$ was previously empty or not, she then immediately places pawns in all empty squares a king’s move away from $C$. The expected number of minutes before the entire chessboard is occupied with pawns equals $\frac{m}{n}$ for relatively prime positive integers $m$,$n$. Find $m+n$. A king’s move, in chess, is one square in any direction on the chessboard: horizontally, vertically, or diagonally. [b]p6.[/b] Let $P(x) = x^5-3x^4+2x^3-6x^2+7x+3$ and $a_1,...,a_5$ be the roots of$ P(x)$. Compute $$\sum^5_{k=1}(a^3_k -4a^2_k +a_k +6).$$ [b]p7.[/b] Rectangle $AXCY$ with a longer length of $11$ and square $ABCD$ share the same diagonal $\overline{AC}$. Assume $B$,$X$ lie on the same side of $\overline{AC}$ such that triangle$ BXC$ and square $ABCD$ are non-overlapping. The maximum area of $BXC$ across all such configurations equals $\frac{m}{n}$ for relatively prime positive integers $m$,$n$. Compute $m+n$. [b]p8.[/b] Earl the electron is currently at $(0,0)$ on the Cartesian plane and trying to reach his house at point $(4,4)$. Each second, he can do one of three actions: move one unit to the right, move one unit up, or teleport to the point that is the reflection of its current position across the line $y=x$. Earl cannot teleport in two consecutive seconds, and he stops taking actions once he reaches his house. Earl visits a chronologically ordered sequence of distinct points $(0,0)$, $...$, $(4,4)$ due to his choice of actions. This is called an [i]Earl-path[/i]. How many possible such [i]Earl-paths[/i] are there? [b]p9.[/b] Let $P(x)$ be a degree-$2022$ polynomial with leading coefficient $1$ and roots $\cos \left( \frac{2\pi k}{2023} \right)$ for $k = 1$ , $...$,$2022$ (note $P(x)$ may have repeated roots). If $P(1) =\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers, then find the remainder when $m+n$ is divided by $100$. [b]p10.[/b] A randomly shuffled standard deck of cards has $52$ cards, $13$ of each of the four suits. There are $4$ Aces and $4$ Kings, one of each of the four suits. One repeatedly draws cards from the deck until one draws an Ace. Given that the first King appears before the first Ace, the expected number of cards one draws after the first King and before the first Ace is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [b]p11.[/b] The following picture shows a beam of light (dashed line) reflecting off a mirror (solid line). The [i]angle of incidence[/i] is marked by the shaded angle; the[i] angle of reflection[/i] is marked by the unshaded angle. [img]https://cdn.artofproblemsolving.com/attachments/9/d/d58086e5cdef12fbc27d0053532bea76cc50fd.png[/img] The sides of a unit square $ABCD$ are magically distorted mirrors such that whenever a light beam hits any of the mirrors, the measure of the angle of incidence between the light beam and the mirror is a positive real constant $q$ degrees greater than the measure of the angle of reflection between the light beam and the mirror. A light beam emanating from $A$ strikes $\overline{CD}$ at $W_1$ such that $2DW_1 =CW_1$, reflects off of $\overline{CD}$ and then strikes $\overline{BC}$ at $W_2$ such that $2CW_2 = BW_2$, reflects off of $\overline{BC}$, etc. To this end, denote $W_i$ the $i$-th point at which the light beam strikes $ABCD$. As $i$ grows large, the area of $W_iW_{i+1}W_{i+2}W_{i+3}$ approaches $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m+n$. [b]p12.[/b] For any positive integer $m$, define $\phi (m)$ the number of positive integers $k \le m$ such that $k$ and $m$ are relatively prime. Find the smallest positive integer $N$ such that $\sqrt{ \phi (n) }\ge 22$ for any integer $n \ge N$. [b]p13.[/b] Let $n$ be a fixed positive integer, and let $\{a_k\}$ and $\{b_k\}$ be sequences defined recursively by $$a_1 = b_1 = n^{-1}$$ $$a_j = j(n- j+1)a_{j-1}\,\,\, , \,\,\, j > 1$$ $$b_j = nj^2b_{j-1}+a_j\,\,\, , \,\,\, j > 1$$ When $n = 2021$, then $a_{2021} +b_{2021} = m \cdot 2017^2$ for some positive integer $m$. Find the remainder when $m$ is divided by $2017$. [b]p14.[/b] Consider the quadratic polynomial $g(x) = x^2 +x+1020100$. A positive odd integer $n$ is called $g$-[i]friendly[/i] if and only if there exists an integer $m$ such that $n$ divides $2 \cdot g(m)+2021$. Find the number of $g$-[i]friendly[/i] positive odd integers less than $100$. [b]p15.[/b] Let $ABC$ be a triangle with $AB < AC$, inscribed in a circle with radius $1$ and center $O$. Let $H$ be the intersection of the altitudes of $ABC$. Let lines $\overline{OH}$, $\overline{BC}$ intersect at $T$. Suppose there is a circle passing through $B$, $H$, $O$, $C$. Given $\cos (\angle ABC-\angle BCA) = \frac{11}{32}$ , then $TO = \frac{m\sqrt{p}}{n}$ for relatively prime positive integers $m$,$n$ and squarefree positive integer $p$. Find $m+n+ p$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$p$ is a 4k+3 prime. Prove that there are infinite $p$ which satisfies $p|2^ny+1$. $y$ is an random integer.