For a real number $x$, let $\lfloor x\rfloor$ stand for the largest integer that is less than or equal to $x$. Prove that \[ \left\lfloor{(n-1)!\over n(n+1)}\right\rfloor \] is even for every positive integer $n$.

The set of $2000$-digit integers are divided into two sets: the set $M$ consisting all integers each of which can be represented as the product of two $1000$-digit integers, and the set $N$ which contains the other integers. Which of the sets $M$ and $N$ contains more elements?

For any subset $S \subseteq \mathbb{Z}^+$, a function $f : S \to S$ is called [i]interesting[/i] if the following two conditions hold: [b]1.[/b] There is no element $a \in S$ such that $f(a) = a$. [b]2.[/b] For every $a \in S$, we have $f^{f(a) + 1}(a) = a$ (where $f^{k}$ denotes the $k$-th iteration of $f$). Prove that: [b]a) [/b]There exist infinitely many interesting functions $f : \mathbb{Z}^+ \to \mathbb{Z}^+$. [b]b) [/b]There exist infinitely many positive integers $n$ for which there is no interesting function $$ f : \{1, 2, \ldots, n\} \to \{1, 2, \ldots, n\}. $$ [i]Proposed by Giorgi Kekenadze, Georgia[/i]

Given a positive integer whose base-$10$ representation is $\overline{d_k\ldots d_0}$ for some integer $k \geq 0$, where $d_k \neq 0$, a move consists of selecting some integers $0 \leq i \leq j \leq k$, such that the digits $d_j,\ldots,d_i$ are not all $0$, erasing them from $n$, and replacing them with a divisor of $\overline{d_j\ldots d_i}$ (this divisor need not have the same number of digits as $\overline{d_j\ldots d_i}$). Prove that for all sufficiently large even integers $n$, we may apply some sequence of moves to $n$ to transform it into $2024$. [i]Allen Wang[/i]

Define a sequence $\left( a_{n}\right) _{n\in\mathbb{N}}$ by $a_{1}=a_{2}=a_{3}=1$ and $a_{n+1}=\dfrac{a_{n}^{2}+a_{n-1}^{2}}{a_{n-2}}$ for every integer $n\geq3$. Show that all elements $a_{i}$ of this sequence are integers. (L. J. Mordell and apparently Dana Scott, see also http://oeis.org/A064098)

Let $p$ be a prime number. Prove that it is possible to choose a permutation $a_1, a_2,...,a_p$ of $1,2,...,p$ such that the numbers $a_1, a_1a_2, a_1a_2a_3,..., a_1a_2a_3...a_p$ all have different remainder upon division by $p$.

Let $n$ be a natural number and $p_1, ..., p_n$ distinct prime numbers. Show that $$p_1^2 + p_2^2 + ... + p_n^2 > n^3$$

Ten identical crates each of dimensions $ 3$ ft $ \times$ $ 4$ ft $ \times$ $ 6$ ft. The first crate is placed flat on the floor. Each of the remaining nine crates is placed, in turn, flat on top of the previous crate, and the orientation of each crate is chosen at random. Let $ \frac{m}{n}$ be the probability that the stack of crates is exactly $ 41$ ft tall, where $ m$ and $ n$ are relatively prime positive integers. Find $ m$.

Let $n$ be a positive integer. For each of the numbers $1, 2,.., n$ we compute the difference between the number of its odd positive divisors and its even positive divisors. Prove that the sum of these differences is at least $0$ and at most $n$.

Find all pairs $(m,n)$ of positive integers such that $m+n$ and $mn+1$ are both powers of $2$.

Let $n$ be a given number greater than 2. We consider the set $V_n$ of all the integers of the form $1 + kn$ with $k = 1, 2, \ldots$ A number $m$ from $V_n$ is called indecomposable in $V_n$ if there are not two numbers $p$ and $q$ from $V_n$ so that $m = pq.$ Prove that there exist a number $r \in V_n$ that can be expressed as the product of elements indecomposable in $V_n$ in more than one way. (Expressions which differ only in order of the elements of $V_n$ will be considered the same.)

Given two integers $m\geq 2$ and $n\geq 2$ we consider two types of sequences of length $m\cdot n$ formed exclusively by $0$ and $1$ TYPE 1 sequences are all those that verify the following two conditions: $\bullet$ $a_ka_{k+m} = 0$ for all $k = 1, 2, 3, ...$ $\bullet$ If $a_ka_{k+1} = 1$, then $k$ is a multiple of $m$. TYPE 2 sequences are all those that verify the following two conditions: $\bullet$ $a_ka_{k+n} = 0$ for all $k = 1, 2, 3, ...$ $\bullet$ If $a_ka_{k+1} = 1$, then $k$ is a multiple of $n$. Prove that the number of sequences of type 1 is equal to the number of sequences of type 2.

Find all polynomials $P(x)$ with integer coefficients such that $P(P(n) + n)$ is a prime number for infinitely many integers $n$.

Find all natural numbers $n$ such that the equation $x^2 + y^2 + z^2 = nxyz$ has solutions in positive integers

Let $n > 1$ be a positive integer. Find all $n$-tuples $(a_1 , a_2 ,\ldots, a_n )$ of positive integers which are pairwise distinct, pairwise coprime, and such that for each $i$ in the range $1 \le i \le n$, \[(a_1 + a_2 + \ldots + a_n )|(a_1^i + a_2^i + \ldots + a_n^i )\].

A right triangle has all its sides rational numbers and the area $S $. Prove that there exists a right triangle, different from the original one, such that all its sides are rational numbers and its area is $S $. Tuymaada 2017 Q4 Juniors

Let $a,b,c,d$ be integers. Prove that $ 12$ divides $ (a-b) (a-c) (a-d) (b- c) (b-d) (c-d)$.

[b]p1.[/b] A shape made by joining four identical regular hexagons side-to-side is called a hexo. Two hexos are considered the same if one can be rotated / reflected to match the other. Find the number of different hexos. [b]p2.[/b] The sequence $1, 2, 3, 3, 3, 4, 5, 5, 5, 5, 5, 6,... $ consists of numbers written in increasing order, where every even number $2n$ is written once, and every odd number $2n + 1$ is written $2n + 1$ times. What is the $2019^{th}$ term of this sequence? [b]p3.[/b] On planet EMCCarth, months can only have lengths of $35$, $36$, or $42$ days, and there is at least one month of each length. Victor knows that an EMCCarth year has $n$ days, but realizes that he cannot figure out how many months there are in an EMCCarth year. What is the least possible value of $n$? [b]p4.[/b] In triangle $ABC$, $AB = 5$ and $AC = 9$. If a circle centered at $A$ passing through $B$ intersects $BC$ again at $D$ and $CD = 7$, what is $BC$? [b]p5.[/b] How many nonempty subsets $S$ of the set $\{1, 2, 3,..., 11, 12\}$ are there such that the greatest common factor of all elements in $S$ is greater than $1$? [b]p6.[/b] Jasmine rolls a fair $6$-sided die, with faces labeled from $1$ to $6$, and a fair $20$-sided die, with faces labeled from $1$ to $20$. What is the probability that the product of these two rolls, added to the sum of these two rolls, is a multiple of $3$? [b]p7.[/b] Let $\{a_n\}$ be a sequence such that $a_n$ is either $2a_{n-1}$ or $a_{n-1} - 1$. Given that $a_1 = 1$ and $a_{12} = 120$, how many possible sequences $a_1$, $a_2$, $...$, $a_{12}$ are there? [b]p8.[/b] A tetrahedron has two opposite edges of length $2$ and the remaining edges have length $10$. What is the volume of this tetrahedron? [b]p9.[/b] In the garden of EMCCden, there is a tree planted at every lattice point $-10 \le x, y \le 10$ except the origin. We say that a tree is visible to an observer if the line between the tree and the observer does not intersect any other tree (assume that all trees have negligible thickness). What fraction of all the trees in the garden of EMCCden are visible to an observer standing at the origin? [b]p10.[/b] Point $P$ lies inside regular pentagon $\zeta$, which lies entirely within regular hexagon $\eta$. A point $Q$ on the boundary of pentagon $\zeta$ is called projective if there exists a point $R$ on the boundary of hexagon $\eta$ such that $P$, $Q$, $R$ are collinear and $2019 \cdot \overline{PQ} = \overline{QR}$. Given that no two sides of $\zeta$ and $\eta$ are parallel, what is the maximum possible number of projective points on $\zeta$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all primes $p,q$ such that \[p^q-q^p=pq^2-19\]

Find all triplets of positive integers $ (a,m,n)$ such that $ a^m \plus{} 1 \mid (a \plus{} 1)^n$.

Find the largest prime divisor of $$\sum^{30}_{n=3} {{n \choose 3} \choose 2}$$

There are $n$ distinct points on a circumference. Choose one of the points. Connect this point and the $m$th point from the chosen point counterclockwise with a segment. Connect this $m$th point and the $m$th point from this $m$th point counterclockwise with a segment. Repeat such steps until no new segment is constructed. From the intersections of the segments, let the number of the intersections - which are in the circle - be $I$. Answer the following questions ($m$ and $n$ are positive integers that are relatively prime and they satisfy $6 \leq 2m < n$). 1) When the $n$ points take different positions, express the maximum value of $I$ in terms of $m$ and $n$. 2) Prove that $I \geq n$. Prove that there is a case, which is $I=n$, when $m=3$ and $n$ is arbitrary even number that satisfies the condition.

Let $n$ be a natural number. We define sequences $\langle a_i\rangle$ and $\langle b_i\rangle$ of integers as follows. We let $a_0=1$ and $b_0=n$. For $i>0$, we let $$\left( a_i,b_i\right)=\begin{cases} \left(2a_{i-1}+1,b_{i-1}-a_{i-1}-1\right) & \text{if } a_{i-1}<b_{i-1},\\ \left( a_{i-1}-b_{i-1}-1,2b_{i-1}+1\right) & \text{if } a_{i-1}>b_{i-1},\\ \left(a_{i-1},b_{i-1}\right) & \text{if } a_{i-1}=b_{i-1}.\end{cases}$$ Given that $a_k=b_k$ for some natural number $k$, prove that $n+3$ is a power of two.

It is known that unequal numbers $a$,$b$ and $c$ are successive members of an arithmetic progression, all of them are greater than $1000$ and all are squares of natural numbers. Find the smallest possible value of $b$.

How many triples $(p,q,n)$ are there such that $1/p+2013/q = n/5$ where $p$, $q$ are prime numbers and $n$ is a positive integer? $ \textbf{(A)}\ 7 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 4 $