Find the number of ordered pairs of positive integers $(m,n)$, where $m,n\leq 10$, such that $m!+n!$ is a multiple of $10$.

Determine all positive integers $n$ for which there exists an integer $m$ such that ${2^{n}-1}$ is a divisor of ${m^{2}+9}$.

Two mathematicians discuss two positive integers. One of them states that the square of the ratio between their product and their sum is exactly one more than this ratio. What is the smaller of these two numbers?

Determine the smallest possible number $n> 1$ such that there exist positive integers $a_{1}, a_{2}, \ldots, a_{n}$ for which ${a_{1}}^{2}+\cdots +{a_{n}}^{2}\mid (a_{1}+\cdots +a_{n})^{2}-1$.

Let $p$ be an odd prime. Show that for every integer $c$, there exists an integer $a$ such that $$a^{\frac{p+1}{2}} + (a+c)^{\frac{p+1}{2}} \equiv c\pmod p.$$

Find all solutions in integers of the equation $$x^2 + 2^2 = y^3 + 3^3.$$

It is said that a positive integer is not GOOD, if there exists a permutation of the integers from 1 to n, $(a_1,a_2,...,a_n)$ such that $k + a_k$ is a perfect square for all $k$. For example $5$ is a GOOD number, since the permutation $(3,2,1,5,4)$ checks the condition: $1 + 3 = 2^2$, $2 + 2 = 2^2$, $3 + 1 = 2^2$; $4 + 5 = 3^2$ and $5 +4 = 3^2$. Find all GOOD numbers up to $12$.

Determine all positive integers $n \ge 2$ which have a positive divisor $m | n$ satisfying $$n = d^3 + m^3.$$ where $d$ is the smallest divisor of $n$ which is greater than $1$.

Determine whether the equation $$x^4+y^3=z!+7$$ has an infinite number of solutions in positive integers.

Suppose that $k$ is a natural number. Prove that there exists a prime number in $\mathbb Z_{[i]}$ such that every other prime number in $\mathbb Z_{[i]}$ has a distance at least $k$ with it.

Initially, two distinct positive integers $a$ and $b$ are written on a blackboard. At each step, Andrea picks two distinct numbers $x$ and $y$ on the blackboard and writes the number $gcd(x, y) + lcm(x, y)$ on the blackboard as well. Let $n$ be a positive integer. Prove that, regardless of the values of $a$ and $b$, Andrea can perform a finite number of steps such that a multiple of $n$ appears on the blackboard.

[b]a)[/b] Does there exist an infinite subset $S$ of the natural numbers, such that $S\neq \mathbb{N}$, and such that for each natural number $n\not \in S$, exactly $n$ members of $S$ are coprime with $n$? [b]b)[/b] Does there exist an infinite subset $S$ of the natural numbers, such that for each natural number $n\in S$, exactly $n$ members of $S$ are coprime with $n$? [i]Proposed by Morteza Saghafian[/i]

For $n$ a positive integer, let $R(n)$ be the sum of the remainders when $n$ is divided by $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$, and $10$. For example, $R(15) = 1+0+3+0+3+1+7+6+5=26$. How many two-digit positive integers $n$ satisfy $R(n) = R(n+1)\,?$ $\textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }4$

Find all polynomials with integer coefficients such that for all positive integers $n$ satisfies $P(n!)=|P(n)|!$

Let $t(n)$ be the sum of the digits in the binary representation of a positive integer $n,$ and let $k \geq 2$ be an integer. [b]a.[/b] Show that there exists a sequence $(a_i)_{i=1}^{\infty}$ of integers such that $a_m \geq 3$ is an odd integer and $t(a_1a_2 \cdots a_m)=k$ for all $m \geq 1.$ [b]b.[/b] Show that there is an integer $N$ such that $t(3 \cdot 5 \cdots (2m+1))>k$ for all integers $m \geq N.$

p1. A regular $6$-face dice is thrown three times. Calculate the probability that the number of dice points on all three throws is $ 12$? p2. Given two positive real numbers $x$ and $y$ with $xy = 1$. Determine the minimum value of $\frac{1}{x^4}+\frac{1}{4y^4}.$ p3. Known a square network which is continuous and arranged in forming corners as in the following picture. Determine the value of the angle marked with the letter $x$. [img]https://cdn.artofproblemsolving.com/attachments/6/3/aee36501b00c4aaeacd398f184574bd66ac899.png[/img] p4. Find the smallest natural number $n$ such that the sum of the measures of the angles of the $n$-gon, with $n > 6$ is less than $n^2$ degrees. p5. There are a few magic cards. By stating on which card a number is there, without looking at the card at all, someone can precisely guess the number. If the number is on Card $A$ and $B$, then the number in question is $1 + 2$ (sum of corner number top left) cards $A$ and $B$. If the numbers are in $A$, $B$, and $C$, the number what is meant is $1 + 2 + 4$ or equal to $7$ (which is obtained by adding the numbers in the upper left corner of each card $A$,$B$, and $C$). [img]https://cdn.artofproblemsolving.com/attachments/e/5/9e80d4f3bba36a999c819c28c417792fbeff18.png[/img] a. How can this be explained? b. Suppose we are going to make cards containing numbers from $1$ to with $15$ based on the rules above. Try making the cards. [hide=original wording for p5, as the wording isn't that clear]Ada suatu kartu ajaib. Dengan menyebutkan di kartu yang mana suatu bilan gan berada, tanpa melihat kartu sama sekali, seseorang dengan tepat bisa menebak bilangan yang dimaksud. Kalau bilangan tersebut ada pada Kartu A dan B, maka bilangan yang dimaksud adalah 1 + 2 (jumlah bilangan pojok kiri atas) kartu A dan B. Kalau bilangan tersebut ada di A, B, dan C, bilangan yang dimaksud adalah 1 + 2 + 4 atau sama dengan 7 (yang diperoleh dengan menambahkan bilangan-bilangan di pojok kiri atas masing-masing kartu A, B, dan C) a. Bagaimana hal ini bisa dijelaskan? b. Andai kita akan membuat kartu-kartu yang memuat bilangan dari 1 sampai dengan 15 berdasarkan aturan di atas. Coba buatkan kartu-kartunya[/hide]

Given an integer $n\ge 2$, a function $f:\mathbb{Z}\rightarrow \{1,2,\ldots,n\}$ is called [i]good[/i], if for any integer $k,1\le k\le n-1$ there exists an integer $j(k)$ such that for every integer $m$ we have \[f(m+j(k))\equiv f(m+k)-f(m) \pmod{n+1}. \] Find the number of [i]good[/i] functions.

Determine whether exist a prime number $p$ and natural number $n$ such that $n^2 + n + p = 1996$.

Numbers $1$ through $2014$ are written on a board. A valid operation is to erase two numbers $a$ and $b$ on the board and replace them with the greatest common divisor and the least common multiple of $a$ and $b$. Prove that, no matter how many operations are made, the sum of all the numbers that remain on the board is always larger than $2014$ $\times$ $\sqrt[2014]{2014!}$

For every positive integer $N\geq 2$ with prime factorisation $N=p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}$ we define \[f(N):=1+p_1a_1+p_2a_2+\cdots+p_ka_k.\] Let $x_0\geq 2$ be a positive integer. We define the sequence $x_{n+1}=f(x_n)$ for all $n\geq 0.$ Prove that this sequence is eventually periodic and determine its fundamental period.

p1. If $x + y + z = 2$, show that $\frac{1}{xy+z-1}+\frac{1}{yz+x-1}+\frac{1}{xz+y-1}=\frac{-1}{(x-1)(y-1)(z-1)}$. p2. Determine the simplest form of $\frac{3}{1!+2!+3!}+\frac{4}{2!+3!+4!}+\frac{5}{3!+4!+5!}+...+\frac{100}{98!+99!+100!}$ p3. It is known that $ABCD$ and $DEFG$ are two parallelograms. Point $E$ lies on $AB$ and point $C$ lie on $FG$. The area of $​​ABCD$ is $20$ units. $H$ is the point on $DG$ so that $EH$ is perpendicular to $DG$. If the length of $DG$ is $5$ units, determine the length of $EH$. [img]https://cdn.artofproblemsolving.com/attachments/b/e/42453bf6768129ed84fbdc81ab7235e780b0e1.png[/img] p4. Each room in the following picture will be painted so that every two rooms which is directly connected to the door is given a different color. If $10$ different colors are provided and $4$ of them can not be used close together for two rooms that are directly connected with a door, determine how many different ways to color the $4$ rooms. [img]https://cdn.artofproblemsolving.com/attachments/4/a/e80a464a282b3fe3cdadde832b2fd38b51a41a.png[/img] 5. The floor of a hall is rectangular $ABCD$ with $AB = 30$ meters and $BC = 15$ meters. A cat is in position $A$. Seeing the cat, the mouse in the midpoint of $AB$ ran and tried to escape from cat. The mouse runs from its place to point $C$ at a speed of $3$ meters/second. The trajectory is a straight line. Watching the mice run away, at the same time from point $A$ the cat is chasing with a speed of $5$ meters/second. If the cat's path is also a straight line and the mouse caught before in $C$, determine an equation that can be used for determine the position and time the mouse was caught by the cat.

Compute the remainder when $98!$ is divided by $101$.

Let $n$ be a natural composite number. Prove that there are integers $a_1, a_2,. . . , a_k$ all greater than $ 1$, such that $$a_1 + a_2 +... + a_k = n \left(\frac{1}{a_1}+\frac{1}{a_2}+...+\frac{1}{a_k}\right)$$

Let $k>2$ be a positive integer. Elise and Xavier play a game that has four steps, in this order. [list=1] [*]Elise picks $2$ nonzero digits $(1-9)$, called $e$ and $f$. [*]Xavier then picks $k$ nonzero digits $(1-9)$, called $x_1,\cdots,x_k$. [*]Elise picks any positive integer $d$. [*]Xaiver picks an integer $b>10$.[/list] Each player's choices are known to the other player when the choices are made. The winner is determined as follows. Elise writes down the two-digit base $b$ number $ef_b$. Next, Xavier writes the $k$-digit base $b$ number that is constructed by concatenating his digits, \[(x_1\cdots x_k)_b.\] They then compute the greatest common divisor (gcd) of these two numbers. If this gcd is greater than or equal to the integer $d$ then Xavier wins. Otherwise Elise wins. (As an example game for $k=3$, Elise chooses the digits $(e, f) = (2, 4)$, Xavier chooses $(4, 4, 8)$, and then Elise picks $d = 100$. Xavier picks base $b = 25$. The base-25 numbers $2425$ and $44825$ are, respectively, equal to $54$ and $2608$. The greatest common divisor of these two is $2$, which is much less than $100$, so Elise wins handily.) Find all $k$ for which Xavier can force a win, no matter how Elise plays.

[b]p1.[/b] What is the units digit of $1 + 9 + 9^2 +... + 9^{2015}$ ? [b]p2.[/b] In Fourtown, every person must have a car and therefore a license plate. Every license plate must be a $4$-digit number where each digit is a value between $0$ and $9$ inclusive. However $0000$ is not a valid license plate. What is the minimum population of Fourtown to guarantee that at least two people who have the same license plate? [b]p3.[/b] Two sides of an isosceles triangle $\vartriangle ABC$ have lengths $9$ and $4$. What is the area of $\vartriangle ABC$? [b]p4.[/b] Let $x$ be a real number such that $10^{\frac{1}{x}} = x$. Find $(x^3)^{2x}$. [b]p5.[/b] A Berkeley student and a Stanford student are going to visit each others campus and go back to their own campuses immediately after they arrive by riding bikes. Each of them rides at a constant speed. They first meet at a place $17.5$ miles away from Berkeley, and secondly $10$ miles away from Stanford. How far is Berkeley away from Stanford in miles? [b]p6.[/b] Let $ABCDEF$ be a regular hexagon. Find the number of subsets $S$ of $\{A,B,C,D,E, F\}$ such that every edge of the hexagon has at least one of its endpoints in $S$. [b]p7.[/b] A three digit number is a multiple of $35$ and the sum of its digits is $15$. Find this number. [b]p8.[/b] Thomas, Olga, Ken, and Edward are playing the card game SAND. Each draws a card from a $52$ card deck. What is the probability that each player gets a dierent rank and a different suit from the others? [b]p9.[/b] An isosceles triangle has two vertices at $(1, 4)$ and $(3, 6)$. Find the $x$-coordinate of the third vertex assuming it lies on the $x$-axis. [b]p10.[/b] Find the number of functions from the set $\{1, 2,..., 8\}$ to itself such that $f(f(x)) = x$ for all $1 \le x \le 8$. [b]p11.[/b] The circle has the property that, no matter how it's rotated, the distance between the highest and the lowest point is constant. However, surprisingly, the circle is not the only shape with that property. A Reuleaux Triangle, which also has this constant diameter property, is constructed as follows. First, start with an equilateral triangle. Then, between every pair of vertices of the triangle, draw a circular arc whose center is the $3$rd vertex of the triangle. Find the ratio between the areas of a Reuleaux Triangle and of a circle whose diameters are equal. [b]p12.[/b] Let $a$, $b$, $c$ be positive integers such that gcd $(a, b) = 2$, gcd $(b, c) = 3$, lcm $(a, c) = 42$, and lcm $(a, b) = 30$. Find $abc$. [b]p13.[/b] A point $P$ is inside the square $ABCD$. If $PA = 5$, $PB = 1$, $PD = 7$, then what is $PC$? [b]p14.[/b] Find all positive integers $n$ such that, for every positive integer $x$ relatively prime to $n$, we have that $n$ divides $x^2 - 1$. You may assume that if $n = 2^km$, where $m$ is odd, then $n$ has this property if and only if both $2^k$ and $m$ do. [b]p15.[/b] Given integers $a, b, c$ satisfying $$abc + a + c = 12$$ $$bc + ac = 8$$ $$b - ac = -2,$$ what is the value of $a$? [b]p16.[/b] Two sides of a triangle have lengths $20$ and $30$. The length of the altitude to the third side is the average of the lengths of the altitudes to the two given sides. How long is the third side? [b]p17.[/b] Find the number of non-negative integer solutions $(x, y, z)$ of the equation $$xyz + xy + yz + zx + x + y + z = 2014.$$ [b]p18.[/b] Assume that $A$, $B$, $C$, $D$, $E$, $F$ are equally spaced on a circle of radius $1$, as in the figure below. Find the area of the kite bounded by the lines $EA$, $AC$, $FC$, $BE$. [img]https://cdn.artofproblemsolving.com/attachments/7/7/57e6e1c4ef17f84a7a66a65e2aa2ab9c7fd05d.png[/img] [b]p19.[/b] A positive integer is called cyclic if it is not divisible by the square of any prime, and whenever $p < q$ are primes that divide it, $q$ does not leave a remainder of $1$ when divided by $p$. Compute the number of cyclic numbers less than or equal to $100$. [b]p20.[/b] On an $8\times 8$ chess board, a queen can move horizontally, vertically, and diagonally in any direction for as many squares as she wishes. Find the average (over all $64$ possible positions of the queen) of the number of squares the queen can reach from a particular square (do not count the square she stands on). PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].