Vukasin, Dimitrije, Dusan, Stefan and Filip asked their teacher to guess three consecutive positive integers, after these true statements: Vukasin: " The sum of the digits of one number is prime number. The sum of the digits of another of the other two is, an even perfect number.($n$ is perfect if $\sigma\left(n\right)=2n$). The sum of the digits of the third number equals to the number of it's positive divisors". Dimitrije:"Everyone of those three numbers has at most two digits equal to $1$ in their decimal representation". Dusan:"If we add $11$ to exactly one of them, then we have a perfect square of an integer" Stefan:"Everyone of them has exactly one prime divisor less than $10$". Filip:"The three numbers are square free". Professor found the right answer. Which numbers did he mention?

Find non-negative integers $a, b, c, d$ such that $5^a + 6^b + 7^c + 11^d = 1999$.

We consider positive integers $n$ having at least six positive divisors. Let the positive divisors of $n$ be arranged in a sequence $(d_i)_{1\le i\le k}$ with $$1=d_1<d_2<\dots <d_k=n\quad (k\ge 6).$$ Find all positive integers $n$ such that $$n=d_5^2+d_6^2.$$

A positive integer is [i]bold[/i] iff it has $8$ positive divisors that sum up to $3240$. For example, $2006$ is bold because its $8$ positive divisors, $1$, $2$, $17$, $34$, $59$, $118$, $1003$ and $2006$, sum up to $3240$. Find the smallest positive bold number.

Let $n$, $m$ and $k$ be positive integers satisfying $(n-1)n(n+1)=m^k.$ Prove that $k=1.$

Find all natural numbers $x,y>1$and primes $p$ that satisfy $$\frac{x^2-1}{y^2-1}=(p+1)^2. $$

Prove that for any integer $a > 1$ there is a prime $p$ for which $1+a+a^2+...+ a^{p-1}$ is composite.

Let $n>1$ be a given positive integer. Petro and Vasyl play the following game. They take turns making moves and Petro goes first. In one turn, a player chooses one of the numbers from $1$ to $n$ that wasn't selected before and writes it on the board. The first player after whose turn the product of the numbers on the board will be divisible by $n$ loses. Who wins if every player wants to win? Find answer for each $n>1$. [i]Proposed by Mykhailo Shtandenko, Anton Trygub[/i]

Let $N=\overline{abcd}$ be a positive integer with four digits. We name [i]plátano power[/i] to the smallest positive integer $p(N)=\overline{\alpha_1\alpha_2\ldots\alpha_k}$ that can be inserted between the numbers $\overline{ab}$ and $\overline{cd}$ in such a way the new number $\overline{ab\alpha_1\alpha_2\ldots\alpha_kcd}$ is divisible by $N$. Determine the value of $p(2025)$.

The sequence $(a_n)$ is defined with the recursion $a_{n + 1} = 5a^6_n + 3a^3_{n-1} + a^2_{n-2}$ for $n\ge 2$ and the set of initial values $\{a_0, a_1, a_2\} = \{2013, 2014, 2015\}$. (That is, the initial values are these three numbers in any order.) Show that the sequence contains no sixth power of a natural number.

On the $2004$ iTest, we defined an [i]optimus [/i] prime to be any prime number whose digits sum to a prime number. (For example, $83$ is an optimus prime, because it is a prime number and its digits sum to $11$, which is also a prime number.) Given that you select a prime number under $100$, find the probability that is it not an optimus prime.

Let $a_1<a_2<a_3<\dots$ be positive integers such that $a_{k+1}$ divides $2(a_1+a_2+\dots+a_k)$ for every $k\geqslant 1$. Suppose that for infinitely many primes $p$, there exists $k$ such that $p$ divides $a_k$. Prove that for every positive integer $n$, there exists $k$ such that $n$ divides $a_k$.

Colin has $900$ Choco Pies. He realizes that for some integer values of $n \le 900$, if he eats n pies a day, he will be able to eat the same number of pies every day until he runs out. How many possible values of $n$ are there?

Find the set $S$ of primes such that $p \in S$ if and only if there exists an integer $x$ such that $x^{2010} + x^{2009} + \cdots + 1 \equiv p^{2010} \pmod{p^{2011}}$. [i]Brian Hamrick.[/i]

Let $a_1,a_2$ - two naturals, and $1<b_1<a_1,1<b_2<a_2$ and $b_1|a_1,b_2|a_2$. Prove that $a_1b_1+a_2b_2-1$ is not divided by $a_1a_2$

Find the least positive integer $n$ with the property: Among arbitrarily $n$ selected consecutive positive integers, all smaller than $2018$, there is at least one that is divisible by its sum of digits .

Prove that for $\forall$ $k\geq 2$, $k\in \mathbb{N}$ there exist a natural number that could be presented as a sum of two, three … $k$ cubes of natural numbers.

Find all pairs $(p,q)$ of prime numbers which $p>q$ and $$\frac{(p+q)^{p+q}(p-q)^{p-q}-1}{(p+q)^{p-q}(p-q)^{p+q}-1}$$ is an integer.

Positive odd integers $a, b$ are such that $a^bb^a$ is a perfect square. Show that $ab$ is a perfect square.

Let $n,k$ be positive integers such that $n$ is not divisible by $3$ and $k\ge n$. Prove that there is an integer $m$ divisible by $n$ whose sum of digits in base $10$ equals $k$.

Given a polynomial with integer coefficients, which has at least one integer root. The greatest common divisor of all its integer roots equals $1$. Prove that if the leading coefficient of the polynomial equals $1$ then the greatest common divisor of the other coefficients also equals $1$.

Let $p$ and $q$ be distinct odd primes. Show that $$\bigg\lceil \dfrac{p^q+q^p-pq+1}{pq} \bigg\rceil$$ is even.

[b]p13.[/b] Emma has the five letters: $A, B, C, D, E$. How many ways can she rearrange the letters into words? Note that the order of words matter, ie $ABC DE$ and $DE ABC$ are different. [b]p14.[/b] Seven students are doing a holiday gift exchange. Each student writes their name on a slip of paper and places it into a hat. Then, each student draws a name from the hat to determine who they will buy a gift for. What is the probability that no student draws himself/herself? [b]p15.[/b] We model a fidget spinner as shown below (include diagram) with a series of arcs on circles of radii $1$. What is the area swept out by the fidget spinner as it’s turned $60^o$ ? [img]https://cdn.artofproblemsolving.com/attachments/9/8/db27ffce2af68d27eee5903c9f09a36c2a6edf.png[/img] [b]p16.[/b] Let $a,b,c$ be the sides of a triangle such that $gcd(a, b) = 3528$, $gcd(b, c) = 1008$, $gcd(a, c) = 504$. Find the value of $a * b * c$. Write your answer as a prime factorization. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.

Find all positive integer solutions $(a, b)$ to the equation $$\frac{1}{a}+\frac{1}{b}+ \frac{n}{lcm(a,b)}=\frac{1}{gcd(a, b)}$$ for (i) $n = 2007$; (ii) $n = 2010$.