Find the smallest positive integer $n$ such that the $73$ fractions $\frac{19}{n+21}, \frac{20}{n+22},\frac{21}{n+23},...,\frac{91}{n+93}$ are all irreducible.

For any integer $n+1,\ldots, 2n$ ($n$ is a natural number) consider its greatest odd divisor. Prove that the sum of all these divisors equals $n^2.$

[b]p1.[/b] Insert "$+$" signs between some of the digits in the following sequence to obtain correct equality: $$1\,\,\,\, 2\,\,\,\, 3\,\,\,\, 4\,\,\,\,5\,\,\,\, 6\,\,\,\, 7 = 100$$ [b]p2.[/b] A square is tiled by smaller squares as shown in the figure. Find the area of the black square in the middle if the perimeter of the big square $ABCD$ is $40$ cm. [img]https://cdn.artofproblemsolving.com/attachments/8/c/d54925cba07f63ec8578048f46e1e730cb8df3.png[/img] [b]p3.[/b] Jack made $3$ quarts of fruit drink from orange and apple juice. $\frac25$ of his drink is orange juice and the rest is apple juice. Nick prefers more orange juice in the drink. How much orange juice should he add to the drink to obtain a drink composed of $\frac35$ of orange juice? [b]p4.[/b] A train moving at $55$ miles per hour meets and is passed by a train moving moving in the opposite direction at $35$ miles per hour. A passenger in the first train sees that the second train takes $8$ seconds to pass him. How long is the second train? [b]p5.[/b] It is easy to arrange $16$ checkers in $10$ rows of $4$ checkers each, but harder to arrange $9$ checkers in $10$ rows of $3$ checkers each. Do both. [b]p6.[/b] Every human that lived on Earth exchanged some number of handshakes with other humans. Show that the number of people that made an odd number of handshakes is even. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find all positive integers $a$ such that for any positive integer $n\ge 5$ we have $2^n-n^2\mid a^n-n^a$.

An integer $n$ is said to be [i]good[/i] if $|n|$ is not the square of an integer. Determine all integers $m$ with the following property: $m$ can be represented, in infinitely many ways, as a sum of three distinct good integers whose product is the square of an odd integer. [i]Proposed by Hojoo Lee, Korea[/i]

Show that $n!=a^{n-1}+b^{n-1}+c^{n-1}$ has only finitely many solutions in positive integers. [i]Proposed by Dorlir Ahmeti, Albania[/i]

Prove that for any fixed integer $a$ equation $$(m!+a)^2=n!+a^2$$ has finitely many solutions in positive integers $m,n$

Let $n>3$ be a positive integer. Prove that $n$ is prime if and only if there exists a positive integer $\alpha$ such that $n!=n(n-1)(\alpha n+1)$.

Let $M_n$ be the $n\times n$ matrix with entries as follows: for $1\leq i \leq n$, $m_{i,i}=10$; for $1\leq i \leq n-1, m_{i+1,i}=m_{i,i+1}=3$; all other entries in $M_n$ are zero. Let $D_n$ be the determinant of matrix $M_n$. Then $\displaystyle \sum_{n=1}^{\infty} \dfrac{1}{8D_n+1}$ can be represented as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$. Note: The determinant of the $1\times 1$ matrix $[a]$ is $a$, and the determinant of the $2\times 2$ matrix $\left[ \begin{array}{cc} a & b \\ c & d \end{array} \right]=ad-bc$; for $n\geq 2$, the determinant of an $n\times n$ matrix with first row or first column $a_1\ a_2\ a_3 \dots\ a_n$ is equal to $a_1C_1 - a_2C_2 + a_3C_3 - \dots + (-1)^{n+1} a_nC_n$, where $C_i$ is the determinant of the $(n-1)\times (n-1)$ matrix found by eliminating the row and column containing $a_i$.

[b]p1.[/b] What is $6\times 7 + 4 \times 7 + 6\times 3 + 4\times 3$? [b]p2.[/b] How many integers $n$ have exactly $\sqrt{n}$ factors? [b]p3.[/b] A triangle has distinct angles $3x+10$, $2x+20$, and $x+30$. What is the value of $x$? [b]p4.[/b] If $4$ people of the Math Club are randomly chosen to be captains, and Henry is one of the $30$ people eligible to be chosen, what is the probability that he is not chosen to be captain? [b]p5.[/b] $a, b, c, d$ is an arithmetic sequence with difference $x$ such that $a, c, d$ is a geometric sequence. If $b$ is $12$, what is $x$? (Note: the difference of an aritmetic sequence can be positive or negative, but not $0$) [b]p6.[/b] What is the smallest positive integer that contains only $0$s and $5$s that is a multiple of $24$. [b]p7.[/b] If $ABC$ is a triangle with side lengths $13$, $14$, and $15$, what is the area of the triangle made by connecting the points at the midpoints of its sides? [b]p8.[/b] How many ways are there to order the numbers $1,2,3,4,5,6,7,8$ such that $1$ and $8$ are not adjacent? [b]p9.[/b] Find all ordered triples of nonnegative integers $(x, y, z)$ such that $x + y + z = xyz$. [b]p10.[/b] Noah inscribes equilateral triangle $ABC$ with area $\sqrt3$ in a cricle. If $BR$ is a diameter of the circle, then what is the arc length of Noah's $ARC$? [b]p11.[/b] Today, $4/12/14$, is a palindromic date, because the number without slashes $41214$ is a palindrome. What is the last palindromic date before the year $3000$? [b]p12.[/b] Every other vertex of a regular hexagon is connected to form an equilateral triangle. What is the ratio of the area of the triangle to that of the hexagon? [b]p13.[/b] How many ways are there to pick four cards from a deck, none of which are the same suit or number as another, if order is not important? [b]p14.[/b] Find all functions $f$ from $R \to R$ such that $f(x + y) + f(x - y) = x^2 + y^2$. [b]p15.[/b] What are the last four digits of $1(1!) + 2(2!) + 3(3!) + ... + 2013(2013!)$/ [b]p16.[/b] In how many distinct ways can a regular octagon be divided up into $6$ non-overlapping triangles? [b]p17.[/b] Find the sum of the solutions to the equation $\frac{1}{x-3} + \frac{1}{x-5} + \frac{1}{x-7} + \frac{1}{x-9} = 2014$ . [b]p18.[/b] How many integers $n$ have the property that $(n+1)(n+2)(n+3)(n+4)$ is a perfect square of an integer? [b]p19.[/b] A quadrilateral is inscribed in a unit circle, and another one is circumscribed. What is the minimum possible area in between the two quadrilaterals? [b]p20.[/b] In blindfolded solitary tic-tac-toe, a player starts with a blank $3$-by-$3$ tic-tac-toe board. On each turn, he randomly places an "$X$" in one of the open spaces on the board. The game ends when the player gets $3$ $X$s in a row, in a column, or in a diagonal as per normal tic-tac-toe rules. (Note that only $X$s are used, not $O$s). What fraction of games will run the maximum $7$ amount of moves? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $a,b,c,d$ be positive integers such that $ad \neq bc$ and $gcd(a,b,c,d)=1$. Let $S$ be the set of values attained by $\gcd(an+b,cn+d)$ as $n$ runs through the positive integers. Show that $S$ is the set of all positive divisors of some positive integer.

Prove that for every positive integer $n$ coprime to $10$ there exists a multiple of $n$ that does not contain the digit $1$ in its decimal representation.

If $p$ is a prime greater than $3$, show that at least one of the numbers \[\frac{3}{p^2} , \frac{4}{p^2} , \cdots, \frac{p-2}{p^2}\] is expressible in the form $\frac{1}{x} + \frac{1}{y}$, where $x$ and $y$ are positive integers.

Find the largest integer $n$ for which there exist $n$ different integers such that none of them are divisible by either of $7,11$ or $13$, but the sum of any two of them is divisible by at least one of $7,11$ and $13$.

Bob is practicing addition in base $2.$ Each time he adds two numbers in base $2,$ he counts the number of carries. For example, when summing the numbers $1001$ and $1011$ in base $2,$ \[\begin{array}{ccccc} \overset{1}{}&& \overset {1}{}&\overset {1}{} \\ 0&1&0&0&1\\0&1&0&1&1 \\ \hline 1&0&1&0&0 \end{array}\] there are three carries (shown on the top row). Suppose that Bob starts with the number $0,$ and adds $111~($i.e. $7$ in base $2)$ to it one hundred times to obtain the number $1010111100~($i.e. $700$ in base $2).$ How many carries occur (in total) in these one hundred calculations? \[\mathrm a. ~ 280\qquad \mathrm b.~289\qquad \mathrm c. ~291 \qquad \mathrm d. ~294 \qquad \mathrm e. ~297\]

How many rational solutions are there to $5x^2+2y^2=1$?

Prove that for all $n \in N$, $x^2 + y^2 = z^n$ has solutions with $x,y,z \in N$.

Find all functions $f:\mathbb{N} \to \mathbb{N}$ so that for any distinct positive integers $x,y,z$ the value of $x+y+z$ is a perfect square if and only if $f(x)+f(y)+f(z)$ is a perfect square.

Find all integers $k\ge 2$ such that for all integers $n\ge 2$, $n$ does not divide the greatest odd divisor of $k^n+1$.

One pupil has $7$ cards of paper. He takes a few of them and tears each in $7$ pieces. Then, he choses a few of the pieces of paper that he has and tears it again in $7$ pieces. He continues the same procedure many times with the pieces he has every time. Will he be able to have sometime $2009$ pieces of paper?

Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.

Let $m,n$ are positive integers. a)Prove that $(m,n)=2\sum_{k=0}^{m-1}[\frac{kn}{m}]+m+n-mn$. b)If $m,n\geq 2$, prove that $\sum_{k=0}^{m-1}[\frac{kn}{m}]=\sum_{k=0}^{n-1}[\frac{km}{n}]$.

Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that $$\gcd(f(x),y)f(xy)=f(x)f(y)$$ for all positive integers $x, y$.

Let $a_{0},a_{1},a_{2},\ldots $ be an increasing sequence of nonnegative integers such that every nonnegative integer can be expressed uniquely in the form $a_{i}+2a_{j}+4a_{k}$, where $i,j$ and $k$ are not necessarily distinct. Determine $a_{1998}$.

Find all integer solutions of the equation $p (x + y) = xy$, where $p$ is a prime number.