Find all integers $n$ such that $\left[\frac{n}{1!}\right] + \left[\frac{n}{2!}\right] + ... + \left[\frac{n}{10!}\right] = 1001$.

Let $p>13$ be a prime of the form $2q+1$, where $q$ is prime. Find the number of ordered pairs of integers $(m,n)$ such that $0\le m<n<p-1$ and \[3^m+(-12)^m\equiv 3^n+(-12)^n\pmod{p}.\] [i]Alex Zhu.[/i] [hide="Note"]The original version asked for the number of solutions to $2^m+3^m\equiv 2^n+3^n\pmod{p}$ (still $0\le m<n<p-1$), where $p$ is a Fermat prime.[/hide]

In a year that has $53$ Saturdays, what day of the week is May $12$? Give all chances.

For an integer $n$, $\sigma(n)$ denotes the sum of postitive divisors of $n$. A sequence of positive integers $(a_i)_{i=0}^{\infty}$ with $a_0 =1$ is defined as follows: For each $n>1$, $a_n$ is the smallest integer greater than $1$ that satisfies $$\sigma{(a_0a_1\dots a_{n-1})} \vert \sigma{(a_0a_1\dots a_{n})}.$$ Determine the number of divisors of $2024^{2024}$ amongst the sequence.

Determine all pairs $(m,n)$ of positive integers such that $m^2+n^2=2018(m-n)$

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?

Determine all natural numbers $n$, such that it's possible to insert one digit at the right side of $n$ to obtain $13n$.

Natalia and Marcela count $1$ by $1$ starting together at $1$, but Marcela's speed is triple that of Natalia (when Natalia says her second number, Marcela says the fourth number). When the difference of the numbers that they say in unison is any of the multiples of $ 29$, between $500$ and $600$, Natalia continues counting normally and Marcela begins to count downwards in such a way that, at one point, the two say in unison the same number. What is said number?

For each natural number $n$, let $f(n)$ denote the number of ordered integer pairs $(x,y)$ satisfying the following equation: \[ x^2 - xy + y^2 = n. \] a) Determine $f(2022)$. b) Determine the largest natural number $m$ such that $m$ divides $f(n)$ for every natural number $n$.

Find all pairs $(p,q)$ of real numbers such that $p+q=1998$ and the solutions of the equation $x^2+px+q=0$ are integers.

For every $n$ positive integers we denote $$\frac{x_n}{y_n}=\sum_{k=1}^{n}{\frac{1}{k {n \choose k}}}$$ where $x_n, y_n$ are coprime positive integers. Prove that $y_n$ is not divisible by $2^n$ for any positive integers $n$. Ha Duy Hung, high school specializing in the Ha University of Education, Hanoi, Xuan Thuy, Cau Giay, Hanoi

Let $a,b,c$ be integers different from zero. It is known that the equation $a \cdot x^2 + b \cdot y^2 + c \cdot z^2 = 0$ has a solution $(x,y,z)$ in integer numbers different from the solutions $x = y = z = 0.$ Prove that the equation \[ a \cdot x^2 + b \cdot y^2 + c \cdot z^2 = 1 \] has a solution in rational numbers.

Let $(F_{n})_{n\geq1}$ the Fibonacci sequence. Find all $n \in \mathbb{N}$ such that for every $k=0,1,...,F_{n}$ \[ {F_{n}\choose k} \equiv (-1)^{k} \ (mod \ F_{n}+1) \]

Let $n$ be a positive integer and let $p$ be a prime number. Prove that if $a$, $b$, $c$ are integers (not necessarily positive) satisfying the equations \[ a^n + pb = b^n + pc = c^n + pa\] then $a = b = c$. [i]Proposed by Angelo Di Pasquale, Australia[/i]

Let $a$ and $b$ be positive integers such that $a! + b!$ divides $a!b!$. Prove that $3a \ge 2b + 2$.

A lattice point in the coordinate plane with origin $O$ is called invisible if the segment $OA$ contains a lattice point other than $O,A$. Let $L$ be a positive integer. Show that there exists a square with side length $L$ and sides parallel to the coordinate axes, such that all points in the square are invisible.

It is known that for every integer $n > 1$ there is a prime number among the numbers $n+1,n+2,...,2n-1.$ Determine all positive integers $n$ with the following property: Every integer $m > 1$ less than $n$ and coprime to $n$ is prime.

Find all fractions which can be written simultaneously in the forms $\frac{7k- 5}{5k - 3}$ and $\frac{6l - 1}{4l - 3}$ , for some integers $k, l$.

Find the maximum number of positive integers such that any two of them $a, b$ (with $a \ne b$) satisfy that$ |a - b| \ge \frac{ab}{100} .$

For each positive integer $ n$, define $ f(n)$ as the exponent of the $ 2$ in the decomposition in prime factors of the number $ n!$. Prove that the equation $ n\minus{}f(n)\equal{}a$ has infinitely many solutions for any positive integer $ a$.

Let $P(x)$ be a polynomial with real coefficients. Prove that there exist positive integers $n$ and $k$ such that $k$ has $n$ digits and more than $P(n)$ positive divisors.

[b]p1.[/b] Suppose that $a \oplus b = ab - a - b$. Find the value of $$((1 \oplus 2) \oplus (3 \oplus 4)) \oplus 5.$$ [b]p2.[/b] Neethin scores a $59$ on his number theory test. He proceeds to score a $17$, $23$, and $34$ on the next three tests. What score must he achieve on his next test to earn an overall average of $60$ across all five tests? [b]p3.[/b] Consider a triangle with side lengths $28$ and $39$. Find the number of possible integer lengths of the third side. [b]p4.[/b] Nithin is thinking of a number. He says that it is an odd two digit number where both of its digits are prime, and that the number is divisible by the sum of its digits. What is the sum of all possible numbers Nithin might be thinking of? [b]p5.[/b] Dora sees a fire burning on the dance floor. She calls her friends to warn them to stay away. During the first pminute Dora calls Poonam and Serena. During the second minute, Poonam and Serena call two more friends each, and so does Dora. This process continues, with each person calling two new friends every minute. How many total people would know of the fire after $6$ minutes? [b]p6.[/b] Charlotte writes all the positive integers $n$ that leave a remainder of $2$ when $2018$ is divided by $n$. What is the sum of the numbers that she writes? [b]p7.[/b] Consider the following grid. Stefan the bug starts from the origin, and can move either to the right, diagonally in the positive direction, or upwards. In how many ways can he reach $(5, 5)$? [img]https://cdn.artofproblemsolving.com/attachments/9/9/b9fdfdf604762ec529a1b90d663e289b36b3f2.png[/img] [b]p8.[/b] Let $a, b, c$ be positive numbers where $a^2 + b^2 + c^2 = 63$ and $2a + 3b + 6c = 21\sqrt7$. Find $\left( \frac{a}{c}\right)^{\frac{a}{b}} $. [b]p9.[/b] What is the sum of the distinct prime factors of $12^5 + 12^4 + 1$? [b]p10.[/b] Allen starts writing all permutations of the numbers $1$, $2$, $3$, $4$, $5$, $6$ $7$, $8$, $9$, $10$ on a blackboard. At one point he writes the permutation $9$, $4$, $3$, $1$, $2$, $5$, $6$, $7$, $8$, $10$. David points at the permutation and observes that for any two consecutive integers $i$ and $i+1$, all integers that appear in between these two integers in the permutation are all less than $i$. For example, $4$ and $5$ have only the numbers $3$, $1$, $2$ in between them. How many of the $10!$ permutations on the board satisfy this property that David observes? [b]p11.[/b] (Estimation) How many positive integers less than $2018$ can be expressed as the sum of $3$ square numbers? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$a)$ Let $m$ and $n$ be positive integers. If $m>1$ prove that $ n \mid \phi(m^n-1)$ where $\phi$ is Euler function $b)$ Prove that number of elements in sequence $1,2,...,n$ $(n \in \mathbb{N})$, which greatest common divisor with $n$ is $d$, is $\phi\left(\frac{n}{d}\right)$

Determine all integer triplets $(x,y,z)$ such that \[x^4+x^2=7^zy^2\mbox{.}\]

Prove or disprove the following statements. a) For every integer $ n \ge 3$, there exist $ n$ pairwise distinct positive integers such that the product of any two of them is divisible by the sum of the remaining $ n \minus{} 2$ numbers. b) For some integer $ n \ge 3$, there exist $ n$ pairwise distinct positive integers, such that the sum of any $ n \minus{} 2$ of them is divisible by the product of the remaining two numbers.