Let $f(x)$ be the distance from $x$ to the nearest perfect square. For example, $f(\pi) = 4 - \pi$. Let $\alpha = \frac{3 + \sqrt{5}}{2}$ and let $m$ be an integer such that the sequence $a_n = f(m \; \alpha^n)$ is bounded. Prove that either $m=k^2$ or $m = 5k^2$ for some integer $k$. [i]Proposed by Rodrigo Sanches Angelo (rsa365), Brazil[/i].

Let be a natural number $ n\ge 2. $ Prove that there exists an unique bipartition $ \left( A,B \right) $ of the set $ \{ 1,2\ldots ,n \} $ such that $ \lfloor \sqrt x \rfloor\neq y , $ for any $ x,y\in A , $ and $ \lfloor \sqrt z \rfloor\neq t , $ for any $ z,t\in B. $ [i]Costin Bădică[/i]

Determine for which $ n$ positive integer the equation: $ a \plus{} b \plus{} c \plus{} d \equal{} n \sqrt {abcd}$ has positive integer solutions.

In this problem, we consider only polynomials with integer coeffients. Call two polynomials $p$ and $q$ [i]really close[/i] if $p(2k + 1) \equiv q(2k + 1)$ (mod $210$) for all $k \in Z^+$. Call a polynomial $p$ [i]partial credit[/i] if no polynomial of lesser degree is [i]really close[/i] to it. What is the maximum possible degree of [i]partial credit[/i]?

a) Prove that the equation $2^x + 21^x = y^3$ has no solution in the set of natural numbers. b) Solve the equation $2^x + 21^y = z^2y$ in the set of non-negative integer numbers.

There are $n$ light bulbs in a circle and one of them is marked. Let operation $A$: Take a positive divisor $d$ of the number $n,$ starting with the light bulb marked and clockwise, we count around the circumference from $1$ to $dn$, changing the state (on or off) to those light bulbs that correspond to the multiples of $d$. Let operation $B$ be: Apply operation$ A$ to all positive divisors of $n$ (to the first divider that is applied is with all the light bulbs off and the remaining divisors is with the state resulting from the previous divisor). Determine all the positive integers $n$, such that when applying the operation on $B$, all the light bulbs are on.

$n$ is natural number and $p$ is prime number. If $1+np$ is square of natural number then prove that $n+1$ is equal to some sum of $p$ square of natural numbers.

International Mathematical Olympiad National Selection Test Malaysia 2021 Round 1 Primary Time: 2.5 hours [hide=Rules] $\bullet$ For each problem you have to submit the answer only. The answer to each problem is a non-negative integer. $\bullet$ No mark is deducted for a wrong answer. $\bullet$ The maximum number of points is (1 + 2 + 3 + 4) x 5 = 50 points.[/hide] [b]Part A[/b] (1 point each) p1. Faris has six cubes on his table. The cubes have a total volume of $2021$ cm$^3$. Five of the cubes have side lengths $5$ cm, $5$ cm, $6$ cm, $6$ cm, and $11$ cm. What is the side length of the sixth cube (in cm)? p2. What is the sum of the first $200$ even positive integers? p3. Anushri writes down five positive integers on a paper. The numbers are all different, and are all smaller than $10$. If we add any two of the numbers on the paper, then the result is never $10$. What is the number that Anushri writes down for certain? p4. If the time now is $10.00$ AM, what is the time $1,000$ hours from now? Note: Enter the answer in a $12$-hour system, without minutes and AM/PM. For example, if the answer is $9.00$ PM, just enter $9$. p5. Aminah owns a car worth $10,000$ RM. She sells it to Neesha at a $10\%$ profit. Neesha sells the car back to Aminah at a $10\%$ loss. How much money did Aminah make from the two transactions, in RM? [b]Part B[/b] (2 points each) p6. Alvin takes 250 small cubes of side length $1$ cm and glues them together to make a cuboid of size $5$ cm  $\times 5$ cm  $\times 10$ cm. He paints all the faces of the large cuboid with the color green. How many of the small cubes are painted by Alvin? p7. Cikgu Emma and Cikgu Tan select one integer each (the integers do not have to be positive). The product of the two integers they selected is $2021$. How many possible integers could have been selected by Cikgu Emma? p8. A three-digit number is called [i]superb[/i] if the first digit is equal to the sum of the other two digits. For example, $431$ and $909$ are superb numbers. How many superb numbers are there? p9. Given positive integers $a, b, c$, and $d$ that satisfy the equation $4a = 5b =6c = 7d$. What is the smallest possible value of $ b$? p10. Find the smallest positive integer n such that the digit sum of n is divisible by $5$, and the digit sum of $n + 1$ is also divisible by $5$. Note: The digit sum of $1440$ is $1 + 4 + 4 + 0 = 9$. [b]Part C[/b] (3 points each) p11. Adam draws $7$ circles on a paper, with radii $ 1$ cm, $2$ cm, $3$ cm, $4$ cm, $5$ cm, $6$ cm, and $7$ cm. The circles do not intersect each other. He colors some circles completely red, and the rest of the circles completely blue. What is the minimum possible difference (in cm$^2$) between the total area of the red circles and the total area of the blue circles? p12. The number $2021$ has a special property that the sum of any two neighboring digits in the number is a prime number ($2 + 0 = 2$, $0 + 2 = 2$, and $2 + 1 = 3$ are all prime numbers). Among numbers from $2021$ to $2041$, how many of them have this property? p13. Clarissa opens a pet shop that sells three types of pets: goldshes, hamsters, and parrots. The pets inside the shop together have a total of $14$ wings, $24$ heads, and $62$ legs. How many goldshes are there inside Clarissa's shop? p14. A positive integer $n$ is called [i]special [/i] if $n$ is divisible by $4$, $n+1$ is divisible by $5$, and $n + 2$ is divisible by $6$. How many special integers smaller than $1000$ are there? p15. Suppose that this decade begins on $ 1$ January $2020$ (which is a Wednesday) and the next decade begins on $ 1$ January $2030$. How many Wednesdays are there in this decade? [b]Part D[/b] (4 points each) p16. Given an isosceles triangle $ABC$ with $AB = AC$. Let D be a point on $AB$ such that $CD$ is the bisector of $\angle ACB$. If $CB = CD$, what is $\angle ADC$, in degrees? p17. Determine the number of isosceles triangles with the following properties: all the sides have integer lengths (in cm), and the longest side has length $21$ cm. p18. Haz marks $k$ points on the circumference of a circle. He connects every point to every other point with straight lines. If there are $210$ lines formed, what is $k$? p19. What is the smallest positive multiple of $24$ that can be written using digits $4$ and $5$ only? p20. In a mathematical competition, there are $2021$ participants. Gold, silver, and bronze medals are awarded to the winners as follows: (i) the number of silver medals is at least twice the number of gold medals, (ii) the number of bronze medals is at least twice the number of silver medals, (iii) the number of all medals is not more than $40\%$ of the number of participants. The competition director wants to maximize the number of gold medals to be awarded based on the given conditions. In this case, what is the maximum number of bronze medals that can be awarded? PS. Problems 11-20 were also used in [url=https://artofproblemsolving.com/community/c4h2676837p23203256]Juniors [/url]as 1-10.

There are $n!$ empty baskets in a row, labelled $1, 2, . . . , n!$. Caesar first puts a stone in every basket. Caesar then puts 2 stones in every second basket. Caesar continues similarly until he has put $n$ stones into every nth basket. In other words, for each $i = 1, 2, . . . , n,$ Caesar puts $i$ stones into the baskets labelled $i, 2i, 3i, . . . , n!.$ Let $x_i$ be the number of stones in basket $i$ after all these steps. Show that $n! \cdot n^2 \leq \sum_{i=1}^{n!} x_i^2 \leq n! \cdot n^2 \cdot \sum_{i=1}^{n} \frac{1}{i} $

For positive integers $n$ and $k \geq 2$, define $E_k(n)$ as the greatest exponent $r$ such that $k^r$ divides $n!$. Prove that there are infinitely many $n$ such that $E_{10}(n) > E_9(n)$ and infinitely many $m$ such that $E_{10}(m) < E_9(m)$.

Given an non-negative integer $k$, show that there are infinitely many positive integers $n$ such that the product of any $n$ consecutive integers is divisible by $(n+k)^2+1$.

Find the number of sequences with $2022$ natural numbers $n_1, n_2, n_3, \ldots, n_{2022}$, such that in every sequence: $\bullet$ $n_{i+1}\geq n_i$ $\bullet$ There is at least one number $i$, such that $n_i=2022$ $\bullet$ For every $(i, j)$ $n_1+n_2+\ldots+n_{2022}-n_i-n_j$ is divisible to both $n_i$ and $n_j$

Let $p_n$ be the $n$-th prime number. Find the remainder when $\Pi_{n=1}^{2549} 2006^{p^2_{n-1}}$ is divided by $13$

$\mathbb{N}_{10}$ is generalization of $\mathbb{N}$ that every hypernumber in $\mathbb{N}_{10}$ is something like: $\overline{...a_2a_1a_0}$ with $a_i \in {0,1..9}$ (Notice that $\overline {...000} \in \mathbb{N}_{10}$) Also we easily have $+,*$ in $\mathbb{N}_{10}$. first $k$ number of $a*b$= first $k$ nubmer of (first $k$ number of a * first $k$ number of b) first $k$ number of $a+b$= first $k$ nubmer of (first $k$ number of a + first $k$ number of b) Fore example $\overline {...999}+ \overline {...0001}= \overline {...000}$ Prove that every monic polynomial in $\mathbb{N}_{10}[x]$ with degree $d$ has at most $d^2$ roots.

Show that for any non-negative integer $n$, the number $2^{2n+1}$ cannot be expressed as a sum of four non-zero square numbers.

Consider the set $D$ of all complex numbers of the form $a+b\sqrt{-13}$ with $a,b \in Z$. The number $14 = 14+0\sqrt{-13}$ can be written as a product of two elements of $D$: $14 = 2 \cdot 7$. Find all possible ways to express $14$ as a product of two elements of $D$.

a) A positive integer is called [i]nice [/i] if it can be represented as an arithmetic mean of some (not necessarily distinct) positive integers each being a nonnegative power of $2$. Prove that all positive integers are nice. b) A positive integer is called [i]ugly [/i] if it can not be represented as an arithmetic mean of some pairwise distinct positive integers each being a nonnegative power of $2$. Prove that there exist infinitely many ugly positive integers. (A. Romanenko, D. Zmeikov)

When we write the number $n > 2$ as the sum of some integers consecutive positives (at least two addends), we say that we have an [i]elegant decomposition[/i] of $n$. Two [i]elegant decompositions[/i] will be different if any of them contains some term that does not contains the other. How many different elegant decompositions does the number $3^{2004}$ have?

Let $a,b$ and $c$ be positive integers such that $ab$ divides $c(c^{2}-c+1)$ and $a+b$ is divisible by $c^{2}+1$. Prove that the sets $\{a,b\}$ and $\{c,c^{2}-c+1\}$ coincide.

Four positive integers $x,y,z$ and $t$ satisfy the relations \[ xy - zt = x + y = z + t. \] Is it possible that both $xy$ and $zt$ are perfect squares?

Consider $5$ distinct positive integers. Can their mean be a)Exactly $3$ times larger than their largest common divisor? b)Exactly $2$ times larger than their largest common divisor?

Find all $(x,y)$ real numbers pairs such that, $$x^7+y^7=x^4+y^4$$

Let $A$ be a $3$-digit positive integer and $B$ be the positive integer that comes from $A$ be replacing with each other the digits of hundreds with the digit of the units. It is also given that $B$ is a $3$-digit number. Find numbers $A$ and $B$ if it is known that $A$ divided by $B$ gives quotient $3$ and remainder equal to seven times the sum of it's digits.

For $m\in \mathbb{N}$ define $m?$ be the product of first $m$ primes. Determine if there exists positive integers $m,n$ with the following property : \[ m?=n(n+1)(n+2)(n+3) \] [i]Proposed by Matko Ljulj[/i]

Find all prime numbers such that the square of the prime number can be written as the sum of cubes of two positive integers.