A positive integer is called $\emph{lucky}$ if it is divisible by $7$, and the sum of its digits is also divisible by $7$. Fix a positive integer $n$. Show that there exists some lucky integer $l$ such that $\left|n - l\right| \leq 70$.

The variables $a,b,c,d,$ traverse, independently from each other, the set of positive real values. What are the values which the expression \[ S= \frac{a}{a+b+d} + \frac{b}{a+b+c} + \frac{c}{b+c+d} + \frac{d}{a+c+d} \] takes?

Prove that there doesn't exist any function $f:\mathbb{N}\rightarrow \mathbb{N}$ such that : $f(f(n-1)=f(n+1)-f(n)$, for every natural $n\geq2$

Three circles of radius $1$ are mutually tangent, as shown. What is the area of the triangle whose vertices are the points of tangency?

Show that: a) There are infinitely many positive integers $n$ such that there exists a square equal to the sum of the squares of $n$ consecutive positive integers (for instance, $2$ is one such number as $5^2=3^2+4^2$). b) If $n$ is a positive integer which is not a perfect square, and if $x$ is an integer number such that $x^2+(x+1)^2+...+(x+n-1)^2$ is a perfect square, then there are infinitely many positive integers $y$ such that $y^2+(y+1)^2+...+(y+n-1)^2$ is a perfect square.

At each step, we are changing the places of exactly two numbers from the sequence $1$, $2$, $3$, $4$, $5$, $6$, $7$. How many different arrangements can be formed after two steps? $ \textbf{(A)}\ 88 \qquad\textbf{(B)}\ 100 \qquad\textbf{(C)}\ 120 \qquad\textbf{(D)}\ 176 \qquad\textbf{(E)}\ 441 $

If $x,y,z \in\mathbb{N}$ and $2x^2+3y^3=4z^4$, Prove that $6|x,y,z$

At a university dinner, there are 2017 mathematicians who each order two distinct entrées, with no two mathematicians ordering the same pair of entrées. The cost of each entrée is equal to the number of mathematicians who ordered it, and the university pays for each mathematician's less expensive entrée (ties broken arbitrarily). Over all possible sets of orders, what is the maximum total amount the university could have paid? [i]Proposed by Evan Chen[/i]

Pyramid $EARLY$ is placed in $(x,y,z)$ coordinates so that $E=(10,10,0),A=(10,-10,0)$, $R=(-10,-10,0)$, $L=(-10,10,0)$, and $Y=(0,0,10)$. Tunnels are drilled through the pyramid in such a way that one can move from $(x,y,z)$ to any of the $9$ points $(x,y,z-1)$, $(x\pm 1,y,z-1)$, $(x,y\pm 1, z-1)$, $(x\pm 1, y\pm 1, z-1)$. Sean starts at $Y$ and moves randomly down to the base of the pyramid, choosing each of the possible paths with probability $\dfrac{1}{9}$. What is the probability that he ends up at the point $(8,9,0)$?

[b]p1.[/b] If the pairwise sums of the three numbers $x$, $y$, and $z$ are $22$, $26$, and $28$, what is $x + y + z$? [b]p2.[/b] Suhas draws a quadrilateral with side lengths $7$, $15$, $20$, and $24$ in some order such that the quadrilateral has two opposite right angles. Find the area of the quadrilateral. [b]p3.[/b] Let $(n)*$ denote the sum of the digits of $n$. Find the value of $((((985^{998})*)*)*)*$. [b]p4.[/b] Everyone wants to know Andy's locker combination because there is a golden ticket inside. His locker combination consists of 4 non-zero digits that sum to an even number. Find the number of possible locker combinations that Andy's locker can have. [b]p5.[/b] In triangle $ABC$, $\angle ABC = 3\angle ACB$. If $AB = 4$ and $AC = 5$, compute the length of $BC$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all primes which are sum of two primes and difference of two primes.

A game is played with two heaps of $p$ and $q$ stones. Two players alternate playing, with $A$ starting. A player in turn takes away one heap and divides the other heap into two smaller ones. A player who cannot perform a legal move loses the game. For which values of $p$ and $q$ can $A$ force a victory?

Let $n>1$ be a positive integer. Each cell of an $n\times n$ table contains an integer. Suppose that the following conditions are satisfied: [list=1] [*] Each number in the table is congruent to $1$ modulo $n$. [*] The sum of numbers in any row, as well as the sum of numbers in any column, is congruent to $n$ modulo $n^2$. [/list] Let $R_i$ be the product of the numbers in the $i^{\text{th}}$ row, and $C_j$ be the product of the number in the $j^{\text{th}}$ column. Prove that the sums $R_1+\hdots R_n$ and $C_1+\hdots C_n$ are congruent modulo $n^4$.

A wizard kidnaps $31$ members from party $A$, $28$ members from party $B$, $23$ members from party $C$, and $19$ members from party $D$, keeping them isolated in individual rooms in his castle, where he forces them to work. Every day, after work, the kidnapped people can walk in the park and talk with each other. However, when three members of three different parties start talking with each other, the wizard reconverts them to the fourth party (there are no conversations with $4$ or more people involved). a) Find out whether it is possible that, after some time, all of the kidnapped people belong to the same party. If the answer is yes, determine to which party they will belong. b) Find all quartets of positive integers that add up to $101$ that if they were to be considered the number of members from the four parties, it is possible that, after some time, all of the kidnapped people belong to the same party, under the same rules imposed by the wizard.

Let $ABC$ be a scalene acute triangle. Let $B_1$ be the point on ray $[AC$ such that $|AB_1|=|BB_1|$. Let $C_1$ be the point on ray $[AB$ such that $|AC_1|=|CC_1|$. Let $B_2$ and $C_2$ be the points on line $BC$ such that $|AB_2|=|CB_2|$ and $|BC_2|=|AC_2|$. Prove that $B_1$, $C_1$, $B_2$, $C_2$ are concyclic.

Find all non-negative integers $x, y$ and $z$ such that $x^3 + 2y^3 + 4z^3 = 9!$