Find the largest prime divisor of $$\sum^{30}_{n=3} {{n \choose 3} \choose 2}$$

The teacher wrote a non-zero natural number on the board. The teacher explained students that they can delete the number written on the board and can write a number instead naturally new, whenever they want, applying one of the following each time rules: 1) Instead of the current number $n$ write $3n + 13$ 2) Instead of the current number $n$ write the number $\sqrt{n}$, if $n$ is a perfect square . a) If the number $256$ was originally written on the board, is it possible that after a finite number of steps to get the number $55$ on the board? b) If the number $55$ was originally written on the board, is it possible that after a number finished the steps to get the number $256$ on the board?

Positive integers $a,b$ are such that $137$ divides $a+139b$ and $139$ divides $a+137b$. Find the minimal posible value of $a+b$.

Prove that there do not exist distinct prime numbers $p$ and $q$ and a positive integer $n$ satisfying the equation $p^{q-1}- q^{p-1}=4n^3$

Define sequence $ (a_n)$ by $ \sum_{d|n} a_d \equal{} 2^n.$ Show that $ n|a_n.$

Let $n$ be a positive integer and let $p$ be a prime number. Prove that if $a$, $b$, $c$ are integers (not necessarily positive) satisfying the equations \[ a^n + pb = b^n + pc = c^n + pa\] then $a = b = c$. [i]Proposed by Angelo Di Pasquale, Australia[/i]

Let $\tau(n)$ denote the number of positive divisors of the positive integer $n$. Prove that there exist infinitely many positive integers $a$ such that the equation $ \tau(an)=n $ does not have a positive integer solution $n$.

[i]The Game.[/i] Eric and Greg are watching their new favorite TV show, [i]The Price is Right[/i]. Bob Barker recently raised the intellectual level of his program, and he begins the latest installment with bidding on following question: How many Carmichael numbers are there less than $100,000$? Each team is to list one nonnegative integer not greater than $100,000$. Let $X$ denote the answer to Bob’s question. The teams listing $N$, a maximal bid (of those submitted) not greater than $X$, will receive $N$ points, and all other teams will neither receive nor lose points. (A Carmichael number is an odd composite integer $n$ such that $n$ divides $a^{n-1}-1$ for all integers $a$ relatively prime to $n$ with $1<a<n$.)

Find all prime numbers $p$ such that $16p + 1$ is a perfect cube.

Let $ p$ be a prime number and $ k,n$ positive integers so that $ \gcd(p,n)\equal{}1$. Prove that $ \binom{n\cdot p^k}{p^k}$ and $ p$ are coprime.

The numbers $1, 3, 7$ and $9$ occur in the decimal representation of an integer. Show that permuting the order of digits one can obtain an integer divisible by $7.$

Determine all triples $(a,b,c)$, where $a, b$, and $c$ are positive integers that satisfy $a \le b \le c$ and $abc = 2(a + b + c)$.

A number is called lucky if computing the sum of the squares of its digits and repeating this operation sufficiently many times leads to number $1$. For example, $1900$ is lucky, as $1900 \to 82 \to 68 \to 100 \to 1$. Find infinitely many pairs of consecutive numbers each of which is lucky.

Determine the digits $0\leqslant c\leqslant 9$ such that for any positive integer $k{}$ there exists a positive integer $n$ such that the last $k{}$ digits of $n^9$ are equal to $c{}.$

Let $p> 3$ be a prime number. Determine the number of all ordered sixes $(a, b, c, d, e, f)$ of positive integers whose sum is $3p$ and all fractions $\frac{a + b}{c + d},\frac{b + c}{d + e},\frac{c + d}{e + f},\frac{d + e}{f + a},\frac{e + f}{a + b}$ have integer values.

Prove that if $ a $ is an integer different from $ 1 $ and $ - 1 $, then $ a^4 + 4 $ is not a prime number.

Let $f$ be a bijective function from $A = \{ 1, 2, \ldots, n \}$ to itself. Show that there is a positive integer $M$ such that $f^{M}(i) = f(i)$ for each $i$ in $A$, where $f^{M}$ denotes the composition $f \circ f \circ \cdots \circ f$ $M$ times.

Determine, with proof, all the integer solutions of the equation $x^3 + 2y^3 + 4z^3 - 6xyz = 1$.

For every natural number $a$ and $b$, define the notation $[a,b]$ as the least common multiple of $a $ and $b$ and the notation $(a,b)$ as the greatest common divisor of $a$ and $b$. Find all $n \in \mathbb{N}$ that satisfies \[ 4 \sum_{k=1}^{n} [n,k] = 1 + \sum_{k=1}^{n} (n,k) + 2n^2 \sum_{k=1}^{n} \frac{1}{(n,k)} \]

Find all primes $p$ such that $p^2 + 2543$ has at most $16$ divisors.

A sequence $a_1,a_2,\dots$ satisfy $$ \sum_{i =1}^n a_{\lfloor \frac{n}{i}\rfloor }=n^{10}, $$ for every $n\in\mathbb{N}$. Let $c$ be a positive integer. Prove that, for every positive integer $n$, $$ \frac{c^{a_n}-c^{a_{n-1}}}{n} $$ is an integer.

Suppose that $S=\{a_{1}, \cdots, a_{r}\}$ is a set of positive integers, and let $S_{k}$ denote the set of subsets of $S$ with $k$ elements. Show that \[\text{lcm}(a_{1}, \cdots, a_{r})=\prod_{i=1}^{r}\prod_{s\in S_{i}}\gcd(s)^{\left((-1)^{i}\right)}.\]

How many positive integers less that $200$ are relatively prime to either $15$ or $24$?

[b]p1.[/b] A large square is cut into four smaller, congruent squares. If each of the smaller squares has perimeter $4$, what was the perimeter of the original square? [b]p2.[/b] Pie loves to bake apples so much that he spends $24$ hours a day baking them. If Pie bakes a dozen apples in one day, how many minutes does it take Pie to bake one apple, on average? [b]p3.[/b] Bames Jond is sent to spy on James Pond. One day, Bames sees James type in his $4$-digit phone password. Bames remembers that James used the digits $0$, $5$, and $9$, and no other digits, but he does not remember the order. How many possible phone passwords satisfy this condition? [b]p4.[/b] What do you get if you square the answer to this question, add $256$ to it, and then divide by $32$? [b]p5.[/b] Chloe the Horse and Flower the Chicken are best friends. When Chloe gets sad for any reason, she calls Flower, so Chloe must remember Flower's $3$ digit phone number, which can consist of any digits $0-5$. Given that the phone number's digits are unique and add to $5$, the number does not start with $0$, and the $3$ digit number is prime, what is the sum of all possible phone numbers? [b]p6.[/b] Anuj has a circular pizza with diameter $A$ inches, which is cut into $B$ congruent slices, where $A$,$B$ are positive integers. If one of Anuj's pizza slices has a perimeter of $3\pi + 30$ inches, find $A + B$. [b]p7.[/b] Bob really likes to study math. Unfortunately, he gets easily distracted by messages sent by friends. At the beginning of every minute, there is an $\frac{6}{10}$ chance that he will get a message from a friend. If Bob does get a message from a friend, there is a $\frac{9}{10}$ chance that he will look at the message, causing him to waste $30$ seconds before resuming his studying. If Bob doesn't get a message from a friend, there is a $\frac{3}{10}$ chance Bob will still check his messages hoping for a message from his friends, wasting $10$ seconds before he resumes his studying. What is the expected number of minutes in $100$ minutes for which Bob will be studying math? [b]p8.[/b] Suppose there is a positive integer $n$ with $225$ distinct positive integer divisors. What is the minimum possible number of divisors of n that are perfect squares? [b]p9.[/b] Let $a, b, c$ be positive integers. $a$ has $12$ divisors, $b$ has $8$ divisors, $c$ has $6$ divisors, and $lcm(a, b, c) = abc$. Let $d$ be the number of divisors of $a^2bc$. Find the sum of all possible values of $d$. [b]p10.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 17$, $BC = 28$, $AC = 25$. Let the altitude from $A$ to $BC$ and the angle bisector of angle $B$ meet at $P$. Given the length of $BP$ can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, $c$ where $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime, find $a + b + c$. [b]p11.[/b] Let $a$, $b$, and $c$ be the roots of the cubic equation $x^3-5x+3 = 0$. Let $S = a^4b+ab^4+a^4c+ac^4+b^4c+bc^4$. Find $|S|$. [b]p12.[/b] Call a number palindromeish if changing a single digit of the number into a different digit results in a new six-digit palindrome. For example, the number $110012$ is a palindromeish number since you can change the last digit into a $1$, which results in the palindrome $110011$. Find the number of $6$ digit palindromeish numbers. [b]p13.[/b] Let $P(x)$ be a polynomial of degree $3$ with real coecients and leading coecient $1$. Let the roots of $P(x)$ be $a$, $b$, $c$. Given that $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}= 4$ and $a^2 + b^2 + c^2 = 36$, the coefficient of $x^2$ is negative, and $P(1) = 2$, let the $S$ be the sum of possible values of $P(0)$. Then $|S|$ can be expressed as $\frac{a + b\sqrt{c}}{d}$ for positive integers $a$, $b$, $c$, $d$ such that $gcd(a, b, d) = 1$ and $c$ is not divisible by the square of any prime. Find $a + b + c + d$. [b]p14.[/b] Let $ABC$ be a triangle with side lengths $AB = 7$, $BC = 8$, $AC = 9$. Draw a circle tangent to $AB$ at $B$ and passing through $C$. Let the center of the circle be $O$. The length of $AO$ can be expressed as $\frac{a\sqrt{b}}{c\sqrt{d}}$ for positive integers $a$, $b$, $c$, $d$ where $gcd(a, c) = gcd(b, d) = 1$ and $b$,$ d$ are not divisible by the square of any prime. Find $a + b + c + d$. [b]p15.[/b] Many students in Mr. Noeth's BC Calculus class missed their first test, and to avoid taking a makeup, have decided to never leave their houses again. As a result, Mr. Noeth decides that he will have to visit their houses to deliver the makeup tests. Conveniently, the $17$ absent students in his class live in consecutive houses on the same street. Mr. Noeth chooses at least three of every four people in consecutive houses to take a makeup. How many ways can Mr. Noeth select students to take makeups? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Thirty players participate in a chess tournament. Every player plays one game with every other player. What maximal number of players can get exactly $5$ points? (any game adds $1$ point to the winner’s score, $0$ points to a loser’s score, in the case of a draw each player obtains $1/2$ point.) [b]p2.[/b] A father and his son returned from a fishing trip. To make their catches equal the father gave to his son some of his fish. If, instead, the son had given his father the same number of fish, then father would have had twice as many fish as his son. What percent more is the father's catch more than his son's? [b]p3.[/b] What is the maximal number of pieces of two shapes, [img]https://cdn.artofproblemsolving.com/attachments/a/5/6c567cf6a04b0aa9e998dbae3803b6eeb24a35.png[/img] and [img]https://cdn.artofproblemsolving.com/attachments/8/a/7a7754d0f2517c93c5bb931fb7b5ae8f5e3217.png[/img], that can be used to tile a $7\times 7$ square? [b]p4.[/b] Six shooters participate in a shooting competition. Every participant has $5$ shots. Each shot adds from 1 to $10$ points to shooter’s score. Every person can score totally for all five shots from $5$ to $50$ points. Each participant gets $7$ points for at least one of his shots. The scores of all participants are different. We enumerate the shooters $1$ to $6$ according to their scores, the person with maximal score obtains number $1$, the next one obtains number $2$, the person with minimal score obtains number $6$. What score does obtain the participant number 3? The total number of all obtained points is $264$. [b]p5.[/b] There are $2014$ stones in a pile. Two players play the following game. First, player $A$ takes some number of stones (from $1$ to $30$) from the pile, then player B takes $1$ or $2$ stones, then player $A$ takes $2$ or $3$ stones, then player $B$ takes $3$ or $4$ stones, then player A takes $4$ or $5$ stones, etc. The player who gets the last stone is the winner. If no player gets the last stone (there is at least one stone in the pile but the next move is not allowed) then the game results in a draw. Who wins the game using the right strategy? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].