Benedek scripted a program which calculated the following sum: $1^1+2^2+3^3+. . .+2021^{2021}$. What is the remainder when the sum is divided by $35$?

Is it possible to arrange 1400 positive integer ( not necessarily distinct ) ,at least one of them being 2021 , around a circle such that any number on this circle equals to the sum of gcd of the two previous numbers and two next numbers? for example , if $a,b,c,d,e$ are five consecutive numbers on this circle , $c=\gcd(a,b)+\gcd(d,e)$

Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.

Some positive integer $n$ is written on the board. Andrey and Petya is playing the following game. Andrey finds all the different representations of the number n as a product of powers of prime numbers (values degrees greater than 1), in which each factor is greater than all previous or equal to the previous one. Petya finds all different representations of the number $n$ as a product of integers greater than $1$, in which each factor is divisible by all the previous factors. The one who finds more performances wins, if everyone finds the same number of representations, the game ends in a draw. Find all positive integers $n$ for which the game will end in a draw. Note. The representation of the number $n$ as a product is also considered a representation consisting of a single factor $n$.

Let $a_1,a_2 ,\ldots, a_n$ be an arithmetic progression of integers such that $i|a_i$ for $i=1, 2,\ldots ,n-1$ and $n\nmid a_n$. Prove that $n$ is a prime power.

Let $A$ be a point outside of a circumference $\omega$. Through $A$, two lines are drawn that intersect $\omega$, the first one cuts $\omega$ at $B$ and $C$, while the other one cuts $\omega$ at $D$ and $E$ ($D$ is between $A$ and $E$). The line that passes through $D$ and is parallel to $BC$ intersects $\omega$ at point $F \neq D$, and the line $AF$ intersects $\omega$ at $T \neq F$. Let $M$ be the intersection point of lines $BC$ and $ET$, $N$ the point symmetrical to $A$ with respect to $M$, and $K$ be the midpoint of $BC$. Prove that the quadrilateral $DEKN$ is cyclic.

For a prime $p$, let $\mathbb{F}_p$ denote the integers modulo $p$, and let $\mathbb{F}_p[x]$ be the set of polynomials with coefficients in $\mathbb{F}_p$. Find all $p$ for which there exists a quartic polynomial $P(x) \in \mathbb{F}_p[x]$ such that for all integers $k$, there exists some integer $\ell$ such that $P(\ell) \equiv k \pmod p$. (Note that there are $p^4(p-1)$ quartic polynomials in $\mathbb{F}_p[x]$ in total.) [i]Aprameya Tripathy[/i]

A triangle $ABC$ is given in which $\angle BAC = 40^o$. and $\angle ABC = 20^o$. Find the length of the angle bisector drawn from the vertex $C$, if it is known that the sides $AB$ and $BC$ differ by $4$ centimeters.

Find the minimum positive integer $n$ such that for any set $A$ with $n$ positive intergers has $15$ elements which sum is divisible by $15$.

Let $a_n$ be the $n$th positive integer such that when $n$ is written in base $3$, the sum of the digits of $n$ is divisible by $3$. For example, $a_1 = 5$ because $5 = 12_3$. Compute $a_{2016}$.

Consider the sequence $\{1,3,13,31,...\}$ that is obtained by following diagonally the following array of numbers in a spiral. Find the number in the $100$th position of that sequence. [img]https://cdn.artofproblemsolving.com/attachments/b/d/3531353472a748e3e0b1497a088472691f67fd.png[/img]

Given that the value of \[\sum_{k=1}^{2021} \frac{1}{1^2+2^2+3^2+\cdots+k^2}+\sum_{k=1}^{1010} \frac{6}{2k^2-k}+\sum_{k=1011}^{2021} \frac{24}{2k+1}\] can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$. [i]Proposed by Aidan Duncan[/i]

For a finite set $E$ of cardinality $n \geq 3$, let $f(n)$ denote the maximum number of $3$-element subsets of $E$, any two of them having exactly one common element. Calculate $f(n)$.

Suppose that \[\sum_{i=1}^{982} 7^{i^2}\] can be expressed in the form $983q + r$, where $q$ and $r$ are integers and $0 \leq r \leq 492$. Find $r$. [i]Author: Alex Zhu[/i]

Let $a \diamond b = ab-4(a+b)+20$. Evaluate \[1\diamond(2\diamond(3\diamond(\cdots(99\diamond100)\cdots))).\]

A town-planner has built an isolated city whose road network consists of $2N$ roundabouts, each connecting exactly three roads. A series of tunnels and bridges ensure that all roads in the town meet only at roundabouts. All roads are two-way, and each roundabout is oriented clockwise. Vlad has recently passed his driving test, and is nervous about roundabouts. He starts driving from his house, and always takes the first edit at each roundabout he encounters. It turns out his journey incluldes every road in the town in both directions before he arrives back at the starting point in the starting direction. For what values of $N$ is this possible?

Solve for prime numbers $p, q, r$ : $$\frac{p}{q} - \frac{4}{r + 1}= 1$$

Kevin colors a ninja star on a piece of graph paper where each small square has area $1$ square inch. Find the area of the region colored, in square inches. [img]https://cdn.artofproblemsolving.com/attachments/3/3/86f0ae7465e99d3e4bd3a816201383b98dc429.png[/img]

Calculate $$\lim_{n\rightarrow\infty}n\int_0^{\infty} e^{-x}\sqrt[n]{e^x - 1 -\frac{x}{1!} - \frac{x^2}{2!} - \dots -\frac{x^n}{n!}}\,dx.$$

Prove that there exists a constant $C>0$ such that $$H(a_1)+H(a_2)+\cdots+H(a_m)\leq C\sqrt{\sum_{i=1}^{m}i a_i}$$ holds for arbitrary positive integer $m$ and any $m$ positive integer $a_1,a_2,\cdots,a_m$, where $$H(n)=\sum_{k=1}^{n}\frac{1}{k}.$$

A [i]festive [/i] number is a four-digit integer containing one of each of the digits $0, 1, 2$, and $4$ in its decimal representation. How many festive numbers are there?

A permutation $ \{x_1, x_2, \ldots, x_{2n}\}$ of the set $ \{1,2, \ldots, 2n\}$ where $ n$ is a positive integer, is said to have property $ T$ if $ |x_i \minus{} x_{i \plus{} 1}| \equal{} n$ for at least one $ i$ in $ \{1,2, \ldots, 2n \minus{} 1\}.$ Show that, for each $ n$, there are more permutations with property $ T$ than without.

Let $ABC$ be a triangle with $CA \neq CB$. Let $D$, $F$, and $G$ be the midpoints of the sides $AB$, $AC$, and $BC$ respectively. A circle $\Gamma$ passing through $C$ and tangent to $AB$ at $D$ meets the segments $AF$ and $BG$ at $H$ and $I$, respectively. The points $H'$ and $I'$ are symmetric to $H$ and $I$ about $F$ and $G$, respectively. The line $H'I'$ meets $CD$ and $FG$ at $Q$ and $M$, respectively. The line $CM$ meets $\Gamma$ again at $P$. Prove that $CQ = QP$. [i]Proposed by El Salvador[/i]

Let $ ABCD $ be a tetahedron and $ M,N $ the middlepoints of $ AB, $ respectively, $ CD. $ Show that any plane that contains $ M $ and $ N $ cuts the tetrahedron in two polihedra that have same volume.

One member of an infinite arithmetic sequence in the set of natural numbers is a perfect square. Show that there are infinitely many members of this sequence having this property.