Let $S$ be a set of $100$ positive integers less than $200$. Prove that there exists a nonempty subset $T$ of $S$ the product of whose elements is a perfect square.

Find the number of integers $n$ with $1 \le n \le 2017$ so that $(n-2)(n-0)(n-1)(n-7)$ is an integer multiple of $1001$.

A jar contains $2$ yellow candies, $4$ red candies, and $6$ blue candies. Candies are randomly drawn out of the jar one-by-one and eaten. The probability that the $2$ yellow candies will be eaten before any of the red candies are eaten is given by the fraction $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Prove that for any positive integers $n$ and $k$ there exist positive integers $a>b>c>d>e>k$ such that \[n=\binom{a}{3}\pm\binom{b}{3}\pm\binom{c}{3}\pm\binom{d}{3}\pm\binom{e}{3}\] [i]Radu Ignat[/i]

Do there exist prime numbers $p$ and $q$ such that $p^2(p^3-1)=q(q+1)$ ?

Find the number of positive integer solutions $(a,b,c,d)$ to the equation \[(a^2+b^2)(c^2-d^2)=2020.\] Note: The solutions $(10,1,6,4)$ and $(1,10,6,4)$ are considered different.

Determine all integers $n \geq 2$ for which the number $11111$ in base $n$ is a perfect square.

In a mathematical competition $n=10\,000$ contestants participate. During the final party, in sequence, the first one takes $1/n$ of the cake, the second one takes $2/n$ of the remaining cake, the third one takes $3/n$ of the cake that remains after the first and the second contestant, and so on until the last one, who takes all of the remaining cake. Determine which competitor takes the largest piece of cake.

Let $\mathbb{N}$ be the set of positive integers. For every $n \in \mathbb{N}$, define $d(n)$ as the number of positive divisors of $n$. Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that: a) $d(f(x)) = x$ for all $x \in \mathbb{N}$ b) $f(xy)$ divides $(x-1)y^{xy-1}f(x)$ for all $x,y \in \mathbb{N}$

[b]a) [/b]Is the number $ 1111\cdots11$ (with $ 2010$ ones) a prime number? [b]b)[/b] Prove that every prime factor of $ 1111\cdots11$ (with $ 2011$ ones) is of the form $ 4022j\plus{}1$ where $ j$ is a natural number.

Tarik and Sultan are playing the following game. Tarik thinks of a number that is greater than $100$. Then Sultan is telling a number greater than $1$. If Tarik’s number is divisible by Sultan’s number, Sultan wins, otherwise Tarik subtracts Sultan’s number from his number and Sultan tells his next number. Sultan is forbidden to repeat his numbers. If Tarik’s number becomes negative, Sultan loses. Does Sultan have a winning strategy?

Show that it is possible to color the points of $\mathbb Q\times\mathbb Q$ in two colors in such a way that any two points having distance $1$ have distinct colors.

An integer $x$ has the property that the sums of the digits of $x$ and of $3x$ are the same. Prove that $x$ is divisible by $9$.

In the sequence of digits $2,0,2,9,3,...$ any digit it equal to the last digit in the decimal representation of the sum of four previous digits. Do the four numbers $2,0,1,5$ in that order occur in the sequence? Folklore

Let $n$ be a natural number $n>3$. Show that in the multiples of $9$ less than $10^n$, exist more numbers with the sum of your digits equal to $9(n - 2)$ than numbers with the sum of your digits equal to $9(n - 1)$.

In an infinite arithmetic progression of positive integers there are two integers with the same sum of digits. Will there necessarily be one more integer in the progression with the same sum of digits? [i]Proposed by A. Shapovalov[/i]

Show that there is no integer $ a$ such that $ a^2 \minus{} 3a \minus{} 19$ is divisible by $ 289$.

Let $n$ be a given positive integer. We say that a positive integer $m$ is [i]$n$-good[/i] if and only if there are at most $2n$ distinct primes $p$ satisfying $p^2\mid m$. (a) Show that if two positive integers $a,b$ are coprime, then there exist positive integers $x,y$ so that $ax^n+by^n$ is $n$-good. (b) Show that for any $k$ positive integers $a_1,\ldots,a_k$ satisfying $\gcd(a_1,\ldots,a_k)=1$, there exist positive integers $x_1,\ldots,x_k$ so that $a_1x_1^n+a_2x_2^n+\cdots+a_kx_k^n$ is $n$-good. (Remark: $a_1,\ldots,a_k$ are not necessarily pairwise distinct) [i]Proposed by usjl.[/i]

1- Find a pair $(m,n)$ of positive integers such that $K = |2^m-3^n|$ in all of this cases : $a) K=5$ $b) K=11$ $c) K=19$ 2-Is there a pair $(m,n)$ of positive integers such that : $$|2^m-3^n| = 2017$$ 3-Every prime number less than $41$ can be represented in the form $|2^m-3^n|$ by taking an Appropriate pair $(m,n)$ of positive integers. Prove that the number $41$ cannot be represented in the form $|2^m-3^n|$ where $m$ and $n$ are positive integers 4-Note that $2^5+3^2=41$ . The number $53$ is the least prime number that cannot be represented as a sum or an difference of a power of $2$ and a power of $3$ . Prove that the number $53$ cannot be represented in any of the forms $2^m-3^n$ , $3^n-2^m$ , $2^m-3^n$ where $m$ and $n$ are positive integers

* Assume that the number of a tree’s leaves is a multiple of $15$. Neglecting the shade of the trunk and branches prove that one can rip off the tree $7/15$ of its leaves so that not less than $8/15$ of its shade remains.

Let a positive integer $n$ be given. Determine, in terms of $n$, the least positive integer $k$ such that among any $k$ positive integers, it is always possible to select a positive even number of them having sum divisible by $n$.

We call a positive integer $n$ [i]delightful[/i] if there exists an integer $k$, $1 < k < n$, such that \[1+2+\cdots+(k-1)=(k+1)+(k+2)+\cdots+n\] Does there exist a delightful number $N$ satisfying the inequalities \[2013^{2013}<\dfrac{N}{2013^{2013}}<2013^{2013}+4 ?\]

Find all integer numbers $a, b, m$ and $n$, such that the following two equalities are verified: $a^2+b^2=5mn$ and $m^2+n^2=5ab$

For the triple $(a,b,c)$ of positive integers we say it is interesting if $c^2+1\mid (a^2+1)(b^2+1)$ but none of the $a^2+1, b^2+1$ are divisible by $c^2+1$. Let $(a,b,c)$ be an interesting triple, prove that there are positive integers $u,v$ such that $(u,v,c)$ is interesting and $uv<c^3$.

Let $k > 2$ be an integer. A positive integer $l$ is said to be $k-pable$ if the numbers $1, 3, 5, . . . , 2k - 1$ can be partitioned into two subsets $A$ and $B$ in such a way that the sum of the elements of $A$ is exactly $l$ times as large as the sum of the elements of $B$. Show that the smallest $k-pable$ integer is coprime to $k$.