Let's consider all possible quadratic trinomials of the form $x^2 + ax + b$, where $a$ and $b$ are positive integers not exceeding some positive integer $N$. Prove that the number of pairs of such trinomials having a common root does not exceed $N^2$.

An integer $ m > 1$ is given. The infinite sequence $ (x_n)_{n\ge 0}$ is defined by $ x_i\equal{}2^i$ for $ i<m$ and $ x_i\equal{}x_{i\minus{}1}\plus{}x_{i\minus{}2}\plus{}\cdots \plus{}x_{i\minus{}m}$ for $ i\ge m$. Find the greatest natural number $ k$ such that there exist $ k$ successive terms of this sequence which are divisible by $ m$.

Call a rational number [i]short[/i] if it has finitely many digits in its decimal expansion. For a positive integer $m$, we say that a positive integer $t$ is $m-$[i]tastic[/i] if there exists a number $c\in \{1,2,3,\ldots ,2017\}$ such that $\dfrac{10^t-1}{c\cdot m}$ is short, and such that $\dfrac{10^k-1}{c\cdot m}$ is not short for any $1\le k<t$. Let $S(m)$ be the set of $m-$tastic numbers. Consider $S(m)$ for $m=1,2,\ldots{}.$ What is the maximum number of elements in $S(m)$?

Compute the sum of the digits of $1001^{10}$

[b]p1.[/b] Two proper ordinary fractions are given. The first has a numerator that is $5$ less than the denominator, and the second has a numerator that is $1998$ less than the denominator. Can their sum have a numerator greater than its denominator? [b]p2.[/b] On New Year's Eve, geraniums, crocuses and cacti stood in a row (from left to right) on the windowsill. Every morning, Masha, wiping off the dust, swaps the places of the flower on the right and the flower in the center. During the day, Tanya, while watering flowers, swaps places between the one in the center and the one on the left. In what order will the flowers be in $365$ days on the next New Year's Eve? [b]p3.[/b] The number $x$ is such that $15\%$ of it and $33\%$ of it are positive integers. What is the smallest number $x$ (not necessarily an integer!) with this property? [b]p4.[/b] In the quadrilateral $ABCD$, the extensions of opposite sides $AB$ and $CD$ intersect at an angle of $20^o$; the extensions of opposite sides $BC$ and $AD$ also intersect at an angle of $20^o$. Prove that two angles in this quadrilateral are equal and the other two differ by $40^o$. [b]p5.[/b] Given two positive integers $a$ and $b$. Prove that $a^ab^b\ge a^ab^a.$ [b]p6.[/b] The square is divided by straight lines into $25$ rectangles (fig.). The areas of some of They are indicated in the figure (not to scale). Find the area of the rectangle marked with a question mark. [img]https://cdn.artofproblemsolving.com/attachments/0/9/591c93421067123d50382744f9d28357acf83a.png[/img] [b]p7.[/b] A radio-controlled toy leaves a certain point. It moves in a straight line, and on command can turn left exactly $ 17^o$ (relative to the previous direction of movement). What is the smallest number of commands required for the toy to pass through the starting point again? [b]p8.[/b] In expression $$(a-b+c)(d+e+f)(g-h-k)(\ell +m- n)(p + q)$$ opened the brackets. How many members will there be? How many of them will be preceded by a minus sign? [b]p9.[/b] In some countries they decided to hold popular elections of the government. Two-thirds of voters in this country are urban and one-third are rural. The President must propose for approval a draft government of $100$ people. It is known that the same percentage of urban (rural) residents will vote for the project as there are people from the city (rural) in the proposed project. What is the smallest number of city residents that must be included in the draft government so that more than half of the voters vote for it? [b]p10.[/b] Vasya and Petya play such a game on a $10 \times 10 board$. Vasya has many squares the size of one cell, Petya has many corners of three cells (fig.). They are walking one by one - first Vasya puts his square on the board, then Petya puts his corner, then Vasya puts another square, etc. (You cannot place pieces on top of others.) The one who cannot make the next move loses. Vasya claims that he can always win, no matter how hard Petya tries. Is Vasya right? [img]https://cdn.artofproblemsolving.com/attachments/f/1/3ddec7826ff6eb92471855322e3b9f01357116.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

Let $A$ be an even number but not divisible by $10$. The last two digits of $A^{20}$ are: (A): $46$, (B): $56$, (C): $66$, (D): $76$, (E): None of the above.

Let $S$ be a finite set of positive integers which has the following property:if $x$ is a member of $S$,then so are all positive divisors of $x$. A non-empty subset $T$ of $S$ is [i]good[/i] if whenever $x,y\in T$ and $x<y$, the ratio $y/x$ is a power of a prime number. A non-empty subset $T$ of $S$ is [i]bad[/i] if whenever $x,y\in T$ and $x<y$, the ratio $y/x$ is not a power of a prime number. A set of an element is considered both [i]good[/i] and [i]bad[/i]. Let $k$ be the largest possible size of a [i]good[/i] subset of $S$. Prove that $k$ is also the smallest number of pairwise-disjoint [i]bad[/i] subsets whose union is $S$.

We consider the proposition $ p(n)$: $ n^2\plus{}1$ divides $ n!$, for positive integers $ n$. Prove that there are infinite values of $ n$ for which $ p(n)$ is true, and infinite values of $ n$ for which $ p(n)$ is false.

Do there exist $10$ consecutive positive integers such that the sum of their squares is equal to the sum of squares of the next $9$ integers? (Inspired by a diagram in an old text book)

Let $b$ be a positive integer. Find all $2002$−tuples $(a_1, a_2,\ldots , a_{2002})$, of natural numbers such that \[\sum_{j=1}^{2002} a_j^{a_j}=2002b^b.\]

Consider the number $n=123456789101112\ldots 99100101$. a)Find the first three digits of the number $\sqrt{n}$. b)Compute the sum of the digits of $n$. c)Prove that $\sqrt{n}$ isn't rational. [i]Valer Pop[/i]

A positive six-digit integer begins and ends in $8$, and is also the product of three consecutive even numbers. What is the sum of the three even numbers?

Select a number $X$ from the set of all $3$-digit natural numbers uniformly at random. Let $A \in [0,1]$ be the probability that $X$ is divisible by $11$, given that it is palindromic. Let $B \in [0,1]$ be the probability that X is palindromic, given that it is divisible by $11$. Compute $B-A$. Recall that a $3$-digit number is a palindrome if it reads the same left to right as right to left. For instance, $484$ is a palindrome, but $603$ is not a palindrome.

Find all positive integers $n$ that have precisely $\sqrt{n+1}$ natural divisors.

Given an arbitrary set of $2k+1$ integers $\{a_1,a_2,...,a_{2k+1}\}$. We make a new set $$ \{(a_1+a_2)/2, (a_2+a_3)/2, (a_{2k}+a_{2k+1})/2, (a_{2k+1}+a_1)/2\}$$ and a new one, according to the same rule, and so on... Prove that if we obtain integers only, the initial set consisted of equal integers only.

Find all pairs of positive integers $(a,b)$ such that there exists a finite set $S$ satisfying that any positive integer can be written in the form $$n = x^a + y^b + s$$where $x,y$ are nonnegative integers and $s \in S$ [i]CSJL[/i]

Prove that there don't exist positive integer numbers $k$ and $n$ which satisfy equation $n^n+(n+1)^{n+1}+(n+2)^{n+2} = 2023^k$. [i]Proposed by Mykhailo Shtandenko[/i]

The positive integers $x_1, \cdots , x_n$, $n \geq 3$, satisfy $x_1 < x_2 <\cdots< x_n < 2x_1$. Set $P = x_1x_2 \cdots x_n.$ Prove that if $p$ is a prime number, $k$ a positive integer, and $P$ is divisible by $pk$, then $\frac{P}{p^k} \geq n!.$

Determine the greatest number, who is the product of some positive integers, and the sum of these numbers is $1976.$

Let $p \neq 13$ be a prime number of the form $8k+5$ such that $39$ is a quadratic non-residue modulo $p$. Prove that the equation $$x_1^4+x_2^4+x_3^4+x_4^4 \equiv 0 \pmod p$$ has a solution in integers such that $p\nmid x_1x_2x_3x_4$.

Show that $\sum_{n=0}^{2013}\frac{4026!}{(n!(2013-n)!)^2}$ is a perfect square.

An integer $n > 1$ and a prime $p$ are such that $n$ divides $p-1$, and $p$ divides $n^3 - 1$. Prove that $4p - 3$ is a perfect square.

Given a non-negative integer \( n \), determine the values of \( c \) for which the sequence of numbers \[ a_n = 4^n c + \frac{4^n - (-1)^n}{5} \] contains at least one perfect square.

Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[ 2, \; 2^2, \; 2^{2^2}, \; 2^{2^{2^2}}, \ldots (\mbox{mod} \; n) \] is eventually constant. [The tower of exponents is defined by $a_1 = 2, \; a_{i+1} = 2^{a_i}$. Also $a_i \; (\mbox{mod} \; n)$ means the remainder which results from dividing $a_i$ by $n$.]

Two sequences $(a_k)_{k\ge 0}$ and $(b_k)_{k\ge 0}$ of integers are given by $b_k = a_k + 9$ and $a_{k+1} = 8b_k + 8$ for $k\ge 0$. Suppose that the number $1988$ occurs in one of these sequences. Show that the sequence $(a_k)$ does not contain any nonzero perfect square.