How many integers $ x $ satisfy $ x^2 - 9x + 18 < 0 $?

Let $d_i$ be the first decimal digit of $2^i$ for every non-negative integer $i$. Prove that for each positive integer $n$ there exists a decimal digit other than $0$ which can be found in the sequence $d_0, d_1, \dots, d_{n-1}$ strictly less than $\frac{n}{17}$ times.

The sequence ($a_n$) is defined by $a_1 = a_2 = 1$ and $a_{n+2 }= a_{n+1} +a_n +k$, where $k$ is a positive integer. Find the least $k$ for which $a_{1991}$ and $1991$ are not coprime.

The sequence $(a_n)$ is such that $a_{n+1} = (a_n)^n + n + 1$ for all positive integers $n$, where $a_1$ is some positive integer. Let $k$ be the greatest power of $3$ by which $a_{101}$ is divisible. Find all possible values of $k$. [i]Proposed by Kyrylo Holodnov[/i]

Find the remainder when $2^{1990}$ is divided by $1990.$

p1. A quadratic equation has the natural roots $a$ and $ b$. Another quadratic equation has roots $ b$ and $c$ with $a\ne c$. If $a$, $ b$, and $c$ are prime numbers less than $15$, how many triplets $(a,b,c)$ that might meet these conditions are there (provided that the coefficient of the quadratic term is equal to $ 1$)? p2. In Indonesia, was formerly known the "Archipelago Fraction''. The [i]Archipelago Fraction[/i] is a fraction $\frac{a}{b}$ such that $a$ and $ b$ are natural numbers with $a < b$. Find the sum of all Archipelago Fractions starting from a fraction with $b = 2$ to $b = 1000$. p3. Look at the following picture. The letters $a, b, c, d$, and $e$ in the box will replaced with numbers from $1, 2, 3, 4, 5, 6, 7, 8$, or $9$, provided that $a,b, c, d$, and $e$ must be different. If it is known that $ae = bd$, how many arrangements are there? [img]https://cdn.artofproblemsolving.com/attachments/f/2/d676a57553c1097a15a0774c3413b0b7abc45f.png[/img] p4. Given a triangle $ABC$ with $A$ as the vertex and $BC$ as the base. Point $P$ lies on the side $CA$. From point $A$ a line parallel to $PB$ is drawn and intersects extension of the base at point $D$. Point $E$ lies on the base so that $CE : ED = 2 :3$. If $F$ is the midpoint between $E$ and $C$, and the area of ​​triangle ABC is equal with $35$ cm$^2$, what is the area of ​​triangle $PEF$? p5. Each side of a cube is written as a natural number. At the vertex of each angle is given a value that is the product of three numbers on three sides that intersect at the vertex. If the sum of all the numbers at the points of the angle is equal to $1001$, find the sum of all the numbers written on the sides of the cube.

You have 2020 piles of coins in front Of you. The first pile contains 1 coin, the second pile contains 2 coins, the third pile contains 3 coins and so on. So, the 2020th pile contains 2020 coins. Guess a positive integer[b] k[/b], in which piles contain at least[b] k [/b]coins, take away exact[b] k[/b] coins from these piles. Find the [b]minimum number of turns[/b] you need to take way all of these coins?

Find, with proof, all triples of positive integers $(x,y,z)$ satisfying the equation $3^x - 5^y = 4z^2$.

Let $ S$ be the set of all positive integers whose all digits are $ 1$ or $ 2$. Denote $ T_{n}$ as the set of all integers which is divisible by $ n$, then find all positive integers $ n$ such that $ S\cap T_{n}$ is an infinite set.

For all positive integers $n$, show that there exists a positive integer $m$ such that $n$ divides $2^{m} + m$. [i]Proposed by Juhan Aru, Estonia[/i]

The set of three-digit natural numbers formed from digits $1,2, 3, 4, 5, 6$ is called [i]nice [/i] if it satisfies the following condition: for any two different digits from $1, 2, 3, 4, 5, 6$ there exists a number from the set which contains both of them. For any nice set we calculate the sum of all its elements. Determine the smallest possible value of these sums. (E. Barabanov)

The number $a_n$ is formed by writing in succession, without spaces, the numbers $1, 2, ..., n$ (for example, $a_{11} = 1234567891011$). Find the smallest number t such that $11 | a_t$.

Let $f : \mathbb N \to \mathbb N$ be a function satisfying \[f(f(m)+f(n))=m+n, \quad \forall m,n \in \mathbb N.\] Prove that $f(x)=x$ for all $x \in \mathbb N$.

Find all pairs $(x,y)$ of positive integers such that $x^{x+y} =y^{y-x}$.

Mongolia TST 2011 Test 1 #2 Let $p$ be a prime number. Prove that: $\sum_{k=0}^p (-1)^k \dbinom{p}{k} \dbinom{p+k}{k} \equiv -1 (\mod p^3)$ (proposed by B. Batbayasgalan, inspired by Putnam olympiad problem) Note: I believe they meant to say $p>2$ as well.

Find six distinct positive integers such that the product of any two of them is divisible by their sum. (D. Fomin, Leningrad)

Let $A = \overline{abcd}$ be a $4$-digit positive integer, such that $a\ge 7$ and $a > b >c > d > 0$. Let us consider a positive integer $B = \overline{dcba}$. If all digits of $A+B$ are odd, determine all possible values of $A$.

Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Let $\mathbb N$ be the set of positive integers. Find all functions $f\colon\mathbb N\to\mathbb N$ such that $$\frac{f(x)-f(y)+x+y}{x-y+1}$$ is an integer, for all positive integers $x,y$ with $x>y$.

A Haiku is a Japanese poem of seventeen syllables, in three lines of five, seven, and five. A group of haikus Some have one syllable less Sixteen in total. The group of haikus Some have one syllable more Eighteen in total. What is the largest Total count of syllables That the group can’t have? (For instance, a group Sixteen, seventeen, eighteen Fifty-one total.) (Also, you can have No sixteen, no eighteen Syllable haikus) [i]Proposed by Jeff Lin[/i]

[b]a)[/b] Show that $ n^2+2n+2007 $ is squarefree for any natural number $ n. $ [b]b)[/b] Prove that for any natural number $ k\ge 2 $ there is a nonnegative integer $ m $ such that $ m^2+2m+2k $ is a perfect square.

Let $m$ and $n$ be two positive integers, $m, n \ge 2$. Solve in the set of the positive integers the equation $x^n + y^n = 3^m$.

Given a positive integer $n \ge 2$, we define $f(n)$ to be the sum of all remainders obtained by dividing $n$ by all positive integers less than $n$. For example dividing $5$ with $1, 2, 3$ and $4$ we have remainders equal to $0, 1, 2$ and $1$ respectively. Therefore $f(5) = 0 + 1 + 2 + 1 = 4$. Find all positive integers $n \ge 3$ such that $f(n) = f(n - 1) + (n - 2)$.

Let $k$ be a positive integer and let $S$ be a finite set of odd prime numbers. Prove that there is at most one way (up to rotation and reflection) to place the elements of $S$ around the circle such that the product of any two neighbors is of the form $x^2+x+k$ for some positive integer $x$.

Let $X=\{1,2,\ldots,2001\}$. Find the least positive integer $m$ such that for each subset $W\subset X$ with $m$ elements, there exist $u,v\in W$ (not necessarily distinct) such that $u+v$ is of the form $2^{k}$, where $k$ is a positive integer.