Find all triples of non-negative integer numbers $(E, C, U)$ such that $EC \ge 1$ and: $$2^{3^E}+3^{2^C}=593 \cdot 5^U$$

Find all triangles with integer sidelenghts such that their perimeter and area are equal.

Prove that a positive integer $n$ is composite if and only if there exist positive integers $a,b,x,y$ such that $a+b = n$ and $\frac{x}{a}+\frac{y}{b}= 1$.

For any two coprime positive integers $p, q$, define $f(i)$ to be the remainder of $p\cdot i$ divided by $q$ for $i = 1, 2,\ldots,q -1$. The number $i$ is called a[b] large [/b]number (resp. [b]small[/b] number) when $f(i)$ is the maximum (resp. the minimum) among the numbers $f(1), f(2),\ldots,f(i)$. Note that $1$ is both large and small. Let $a, b$ be two fixed positive integers. Given that there are exactly $a$ large numbers and $b$ small numbers among $1, 2,\ldots , q - 1$, find the least possible number for $q$. [i] Proposed by usjl[/i]

[b]p1.[/b] Twelve people, three of whom are in the Mafia and one of whom is a police inspector, randomly sit around a circular table. What is the probability that the inspector ends up sitting next to at least one of the Mafia? [b]p2.[/b] Of the positive integers between $1$ and $1000$, inclusive, how many of them contain neither the digit “$4$” nor the digit “$7$”? [b]p3.[/b] You are really bored one day and decide to invent a variation of chess. In your variation, you create a new piece called the “krook,” which, on any given turn, can move either one square up or down, or one square left or right. If you have a krook at the bottom-left corner of the chessboard, how many different ways can the krook reach the top-right corner of the chessboard in exactly $17$ moves? [b]p4.[/b] Let $p$ be a prime number. What is the smallest positive integer that has exactly $p$ different positive integer divisors? Write your answer as a formula in terms of $p$. [b]p5.[/b] You make the square $\{(x, y)| - 5 \le x \le 5, -5 \le y \le 5\}$ into a dartboard as follows: (i) If a player throws a dart and its distance from the origin is less than one unit, then the player gets $10$ points. (ii) If a player throws a dart and its distance from the origin is between one and three units, inclusive, then the player gets awarded a number of points equal to the number of the quadrant that the dart landed on. (The player receives no points for a dart that lands on the coordinate axes in this case.) (iii) If a player throws a dart and its distance from the origin is greater than three units, then the player gets $0$ points. If a person throws three darts and each hits the board randomly (i.e with uniform distribution), what is the expected value of the score that they will receive? [b]p6.[/b] Teddy works at Please Forget Meat, a contemporary vegetarian pizza chain in the city of Gridtown, as a deliveryman. Please Forget Meat (PFM) has two convenient locations, marked with “$X$” and “$Y$ ” on the street map of Gridtown shown below. Teddy, who is currently at $X$, needs to deliver an eggplant pizza to $\nabla$ en route to $Y$ , where he is urgently needed. There is currently construction taking place at $A$, $B$, and $C$, so those three intersections will be completely impassable. How many ways can Teddy get from $X$ to $Y$ while staying on the roads (Traffic tickets are expensive!), not taking paths that are longer than necessary (Gas is expensive!), and that let him pass through $\nabla$ (Losing a job is expensive!)? [img]https://cdn.artofproblemsolving.com/attachments/e/0/d4952e923dc97596ad354ed770e80f979740bc.png[/img] [b]p7.[/b] $x, y$, and $z$ are positive real numbers that satisfy the following three equations: $$x +\frac{1}{y}= 4 \,\,\,\,\, y +\frac{1}{z}= 1\,\,\,\,\, z +\frac{1}{x}=\frac73.$$ Compute $xyz$. [b]p8.[/b] Alan, Ben, and Catherine will all start working at the Duke University Math Department on January $1$st, $2009$. Alan’s work schedule is on a four-day cycle; he starts by working for three days and then takes one day off. Ben’s work schedule is on a seven-day cycle; he starts by working for five days and then takes two days off. Catherine’s work schedule is on a ten-day cycle; she starts by working for seven days and then takes three days off. On how many days in $2009$ will none of the three be working? [b]p9.[/b] $x$ and $y$ are complex numbers such that $x^3 + y^3 = -16$ and $(x + y)^2 = xy$. What is the value of $|x + y|$? [b]p10.[/b] Call a four-digit number “well-meaning” if (1) its second digit is the mean of its first and its third digits and (2) its third digit is the mean of its second and fourth digits. How many well-meaning four-digit numbers are there? (For a four-digit number, its first digit is its thousands [leftmost] digit and its fourth digit is its units [rightmost] digit. Also, four-digit numbers cannot have “$0$” as their first digit.) [b]p11.[/b] Suppose that $\theta$ is a real number such that $\sum^{\infty}{k=2} \sin \left(2^k\theta \right)$ is well-defined and equal to the real number $a$. Compute: $$\sum^{\infty}{k=0} \left(\cot^3 \left(2^k\theta \right)-\cot \left(2^k\theta \right) \right) \sin^4 \left(2^k\theta \right).$$ Write your answer as a formula in terms of $a$. [b]p12.[/b] You have $13$ loaded coins; the probability that they come up as heads are $\cos\left( \frac{0\pi}{24 }\right)$,$ \cos\left( \frac{1\pi}{24 }\right)$, $\cos\left( \frac{2\pi}{24 }\right)$, $...$, $\cos\left( \frac{11\pi}{24 }\right)$ and $\cos\left( \frac{12\pi}{24 }\right)$, respectively. You throw all $13$ of these coins in the air at once. What is the probability that an even number of them come up as heads? [b]p13.[/b] Three married couples sit down on a long bench together in random order. What is the probability that none of the husbands sit next to their respective wives? [b]p14.[/b] What is the smallest positive integer that has at least $25$ different positive divisors? [b]p15.[/b] Let $A_1$ be any three-element set, $A_2 = \{\emptyset\}$, and $A_3 = \emptyset$. For each $i \in \{1, 2, 3\}$, let: (i) $B_i = \{\emptyset,A_i\}$, (ii) $C_i$ be the set of all subsets of $B_i$, (iii) $D_i = B_i \cup C_i$, and (iv) $k_i$ be the number of different elements in $D_i$. Compute $k_1k_2k_3$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that the numbers from $1$ to $ 15$ cannot be divided into two groups: $A$ of $2$ numbers and $B$ of $13$ numbers such that the sum of the numbers in group $B$ is equal to product of numbers in group $A$.

Prove that: (a) if $y<\frac12$ and $n\ge3$ is a natural number then $(y+1)^n\ge y^n+(1+2y)^\frac n2$; (b) if $x,y,z$ and $n\ge3$ are natural numbers for which $x^2-1\le2y$ then $x^n+y^n\ne z^n$.

Find all natural numbers $x,y,z$ such that $a+2^x3^y=z^2$.

For a positive integer n, let $w(n)$ denote the number of distinct prime divisors of n. Determine the least positive integer k such that $2^{w(n)} \leq k \sqrt[4]{n}$ for all positive integers n.

Let $f : \mathbb N \to \mathbb N$ be an injective function such that there exists a positive integer $k$ for which $f(n) \leq n^k$. Prove that there exist infinitely many primes $q$ such that the equation $f(x) \equiv 0 \pmod q$ has a solution in prime numbers.

Determine the least positive integer $n$ with the following property – for every 3-coloring of numbers $1,2,\ldots,n$ there are two (different) numbers $a,b$ of the same color such that $|a-b|$ is a perfect square.

Let positive integers $K$ and $d$ be given. Prove that there exists a positive integer $n$ and a sequence of $K$ positive integers $b_1,b_2,..., b_K$ such that the number $n$ is a $d$-digit palindrome in all number bases $b_1,b_2,..., b_K$.

Let $(x_{n}) \ n\geq 1$ be a sequence of real numbers with $x_{1}=1$ satisfying $2x_{n+1}=3x_{n}+\sqrt{5x_{n}^{2}-4}$ a) Prove that the sequence consists only of natural numbers. b) Check if there are terms of the sequence divisible by $2011$.

For each positive integer $n$ let $s(n)$ denote the sum of the decimal digits of $n$. Find all pairs of positive integers $(a, b)$ with $a > b$ which simultaneously satisfy the following two conditions $$a \mid b + s(a)$$ $$b \mid a + s(b)$$ [i]Proposed by Victor Domínguez[/i]

(a) For which positive numbers $n$ does there exist a sequence $x_1, x_2, ..., x_n$, which contains each of the numbers $1, 2, ..., n$ exactly once and for which $x_1 + x_2 +... + x_k$ is divisible by $k$ for each $k = 1, 2,...., n$? (b) Does there exist an infinite sequence $x_1, x_2, x_3, ..., $ which contains every positive integer exactly once and such that $x_1 + x_2 +... + x_k$ is divisible by $k$ for every positive integer $k$?

Find all functions $f : \mathbb{N} \rightarrow \mathbb{R}$ such that for all triples $a,b,c$ of positive integers the following holds : $$f(ac)+f(bc)-f(c)f(ab) \ge 1$$ Proposed by [i]Mojtaba Zare[/i]

Any natural number $n, n\ge 3$ can be presented in different ways as a sum several summands (not necessarily different). Find the greatest possible value of these summands. Folklore

Find all the $4$-digit natural numbers, written in base $10$, that are equal to the cube of the sum of its digits.

Given a prime $p \geq 5$ , show that there exist at least two distinct primes $q$ and $r$ in the range $2, 3, \ldots p-2$ such that $q^{p-1} \not\equiv 1 \pmod{p^2}$ and $r^{p-1} \not\equiv 1 \pmod{p^2}$.

Let $f(n)$ be the sum of the factors of $2^n \cdot 31.$ Find $\sum_{n=0}^{4} f(n).$

A positive integer $n$ is good if $n$ can be written as the sum of $2004$ positive integers $a_1$, $a_2$, ..., $a_{2004}$ such that $1 \le a_1 < a_2<...<a_{2004}$ and $a_i$ divides $a_{i+1}$ for $i=1$, $2$, ..., $2003$. Show that there are only finitely many positive integers that are not good.

Natural $p$ and $q$ are relatively prime. The $[0,1]$ is divided onto $(p+q)$ equal segments. Prove that every segment except two marginal contain exactly one from the $(p+q-2)$ numbers $$\{1/p, 2/p, ... , (p-1)/p, 1/q, 2/q, ... , (q-1)/q\}$$

Let $ f$ be a polynomial with integer coefficients. Assume that there exists integers $ a$ and $ b$ such that $ f(a)\equal{}41$ and $ f(b)\equal{}49$. Prove that there exists an integer $ c$ such that $ 2009$ divides $ f(c)$. [i]Nanang Susyanto, Jogjakarta[/i]

Determine the largest natural number whose all decimal digits are different and which is divisible by each of its digits.

Find all pairs $(m, n)$ of natural numbers for which the numbers $m^2 - 4n$ and $n^2 - 4m$ are both perfect squares.