Three pairwairs distinct positive integers $a,b,c,$ with $gcd(a,b,c)=1$, satisfy \[a|(b-c)^2 ,b|(a-c)^2 , c|(a-b)^2\] Prove that there doesnt exist a non-degenerate triangle with side lengths $a,b,c.$

Prove that for any odd positive integer $n$, $n^{12}-n^8-n^4+1$ is divisible by $2^9$.

[b]p1.[/b] Joe owns stock. On Monday morning on October $20$th, $2008$, his stocks were worth $\$250,000$. The value of his stocks, for each day from Monday to Friday of that week, increased by $10\%$, increased by $5\%$, decreased by $5\%$, decreased by $15\%$, and decreased by $20\%$, though not necessarily in that order. Given this information, let $A$ be the largest possible value of his stocks on that Friday evening, and let $B$ be the smallest possible value of his stocks on that Friday evening. What is $A - B$? [b]p2.[/b] What is the smallest positive integer $k$ such that $2k$ is a perfect square and $3k$ is a perfect cube? [b]p3.[/b] Two competitive ducks decide to have a race in the first quadrant of the $xy$ plane. They both start at the origin, and the race ends when one of the ducks reaches the line $y = \frac12$ . The first duck follows the graph of $y = \frac{x}{3}$ and the second duck follows the graph of $y = \frac{x}{5}$ . If the two ducks move in such a way that their $x$-coordinates are the same at any time during the race, find the ratio of the speed of the first duck to that of the second duck when the race ends. [b]p4.[/b] There were grammatical errors in this problem as stated during the contest. The problem should have said: You play a carnival game as follows: The carnival worker has a circular mat of radius 20 cm, and on top of that is a square mat of side length $10$ cm, placed so that the centers of the two mats coincide. The carnival worker also has three disks, one each of radius $1$ cm, $2$ cm, and $3$ cm. You start by paying the worker a modest fee of one dollar, then choosing two of the disks, then throwing the two disks onto the mats, one at a time, so that the center of each disk lies on the circular mat. You win a cash prize if the center of the large disk is on the square AND the large disk touches the small disk, otherwise you just lost the game and you get no money. How much is the cash prize if choosing the two disks randomly and then throwing the disks randomly (i.e. with uniform distribution) will, on average, result in you breaking even? [b]p5.[/b] Four boys and four girls arrive at the Highball High School Senior Ball without a date. The principal, seeking to rectify the situation, asks each of the boys to rank the four girls in decreasing order of preference as a prom date and asks each girl to do the same for the four boys. None of the boys know any of the girls and vice-versa (otherwise they would have probably found each other before the prom), so all eight teenagers write their rankings randomly. Because the principal lacks the mathematical chops to pair the teenagers together according to their stated preference, he promptly ignores all eight of the lists and randomly pairs each of the boys with a girl. What is the probability that no boy ends up with his third or his fourth choice, and no girl ends up with her third or fourth choice? [b]p6.[/b] In the diagram below, $ABCDEFGH$ is a rectangular prism, $\angle BAF = 30^o$ and $\angle DAH = 60^o$. What is the cosine of $\angle CEG$? [img]https://cdn.artofproblemsolving.com/attachments/a/1/1af1a7d5d523884703b9ff95aaf301bcc18140.png[/img] [b]p7.[/b] Two cows play a game where each has one playing piece, they begin by having the two pieces on opposite vertices of an octahedron, and the two cows take turns moving their piece to an adjacent vertex. The winner is the first player who moves its piece to the vertex occupied by its opponent’s piece. Because cows are not the most intelligent of creatures, they move their pieces randomly. What is the probability that the first cow to move eventually wins? [b]p8.[/b] Find the last two digits of $$\sum^{2008}_{k=1}k {2008 \choose k}.$$ PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find the smallest positive integer $n$ or show no such $n$ exists, with the following property: there are infinitely many distinct $n$-tuples of positive rational numbers $(a_1, a_2, \ldots, a_n)$ such that both $$a_1+a_2+\dots +a_n \quad \text{and} \quad \frac{1}{a_1} + \frac{1}{a_2} + \dots + \frac{1}{a_n}$$ are integers.

Let $a,b,c$ be positive integers such that $a,b,c,a+b-c,a+c-b,b+c-a,a+b+c$ are $7$ distinct primes. The sum of two of $a,b,c$ is $800$. If $d$ be the difference of the largest prime and the least prime among those $7$ primes, find the maximum value of $d$.

Prove that the numbers from $1$ to $16$ can be written in a line, but cannot be written in a circle so that the sum of any two adjacent numbers is square of a natural number.

let $p$and $q=p+2$ be twin primes. consider the diophantine equation $(+)$ given by $n!+pq^2=(mp)^2$ $m\geq1$, $n\geq1$ i. if $m=p$,find the value of $p$. ii. how many solution quadruple $(p,q,m,n)$ does $(+)$ have ?

Given a four digit string $ k=\overline{abcd} $, $ a, b, c, d\in \{0, 1, \cdots, 9\} $, prove that there exist a $n<20000$ such that $2^n$ contains $k$ as a substring when written in base $10$. [Extra: Can you give a better bound? Mine is $12517$]

Find all triples of positive integers $ (p,q,n)$, with $ p$ and $ q$ primes, satisfying: $ p(p\plus{}3)\plus{}q(q\plus{}3)\equal{}n(n\plus{}3)$.

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]

Show that there is a positive number in the Fibonacci sequence which is divisible by $ 1000$.

Call a finite set of positive integers [i]independent [/i] if its elements are pairwise coprime, and [i]nice [/i] if the arithmetic mean of the elements of every non-empty subset of it is an integer. a) Prove that for any positive integer $n$ there is an $n$-element set of positive integers which is both independent and nice. b) Is there an infinite set of positive integers whose every independent subset is nice and which has an $n$-element independent subset for every positive integer $n$?

$n$ is a natural number larger than $3$ and denote all positive coprime numbers with $n$ as $1= b_1 < b_2 < \cdots b_k$. For a positive integer $m$ which is larger than $3$ and is coprime with $n$, let $A$ be the set of tuples $(a_1,a_2, \cdots a_k)$ satisfying the condition. $$\textbf{Condition}: \text{For all integers } i, 0 \le a_i < m \text{ and } a_1b_1 + a_2b_2 + \cdots a_kb_k \text{ is a mutiple of } n$$ For elements of $A$, show that the difference of number of elements such that $a_1 = 1$ and the number of elements such that $a_2 = 2$ maximum $1$

The positive integers $x$ and $y$ are such that $x^{2022}+x+y^2$ is divisible by $xy$. a) Give an example of such integers $x$ and $y$, with $x>y$. b) Prove that $x$ is a perfect square.

For natural number $t$, the repeating base-$t$ representation of the (base-ten) rational number $\frac{7}{51}$ is $0.\overline{23}_t=0.232323..._t$. What is $t$ ?

A positive integer is called [i]shiny[/i] if it can be written as the sum of two not necessarily distinct integers $a$ and $b$ which have the same sum of their digits. For instance, $2012$ is [i]shiny[/i], because $2012 = 2005 + 7$, and both $2005$ and $7$ have the same sum of their digits. Find all positive integers which are [b]not[/b] [i]shiny[/i] (the dark integers).

[b]p1.[/b] Is it possible to write $5$ different fractions that add up to $1$, such that their numerators are equal to one and their denominators are natural numbers? [b]p2.[/b] The following is known about two numbers $x$ and $y$: if $x\ge 0$, then $y = 1 -x$; if $y\le 1$, then $x = 1 + y$; if $x\le 1$, then $x = |1 + y|$. Find $x$ and $y$. [b]p3.[/b] Five people living in different cities received a salary, some more, others less ($143$, $233$, $313$, $410$ and $413$ rubles). Each of them can send money to the other by mail. In this case, the post office takes $10\%$ of the amount of money sent for the transfer (in order to receive $100$ rubles, you need to send $10\%$ more, that is, $110$ rubles). They want to send money so that everyone has the same amount of money, and the post office receives as little money as possible. How much money will each person have using the most economical shipping method? [b]p4.[/b] a) List three different natural numbers $m$, $n$ and $k$ for which $m! = n! \cdot k!$ . b) Is it possible to come up with $1999$ such triplets? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

[b](a)[/b] Determine if exist an integer $n$ such that $n^2 -k$ has exactly $10$ positive divisors for each $k = 1, 2, 3.$ [b](b) [/b]Show that the number of positive divisors of $n^2 -4$ is not $10$ for any integer $n.$

Let $n\ge 2$ be an integer. $a_1,a_2,\dotsc,a_n$ are arbitrarily chosen positive integers with $(a_1,a_2,\dotsc,a_n)=1$. Let $A=a_1+a_2+\dotsb+a_n$ and $(A,a_i)=d_i$. Let $(a_2,a_3,\dotsc,a_n)=D_1, (a_1,a_3,\dotsc,a_n)=D_2,\dotsc, (a_1,a_2,\dotsc,a_{n-1})=D_n$. Find the minimum of $\prod\limits_{i=1}^n\dfrac{A-a_i}{d_iD_i}$

Determine all positive integers $n$ such that $$n\cdot 2^{n-1}+1$$ is a perfect square.

Prove that if $n$ and $k$ are positive integers such that $1<k<n-1$,Then the binomial coefficient $\binom nk$ is divisible by at least two different primes.

(a) Let $\gcd(m, k) = 1$. Prove that there exist integers $a_1, a_2, . . . , a_m$ and $b_1, b_2, . . . , b_k$ such that each product $a_ib_j$ ($i = 1, 2, \cdots ,m; \ j = 1, 2, \cdots, k$) gives a different residue when divided by $mk.$ (b) Let $\gcd(m, k) > 1$. Prove that for any integers $a_1, a_2, . . . , a_m$ and $b_1, b_2, . . . , b_k$ there must be two products $a_ib_j$ and $a_sb_t$ ($(i, j) \neq (s, t)$) that give the same residue when divided by $mk.$ [i]Proposed by Hungary.[/i]

Fix positive integers $n$ and $k\ge 2$. A list of $n$ integers is written in a row on a blackboard. You can choose a contiguous block of integers, and I will either add $1$ to all of them or subtract $1$ from all of them. You can repeat this step as often as you like, possibly adapting your selections based on what I do. Prove that after a finite number of steps, you can reach a state where at least $n-k+2$ of the numbers on the blackboard are all simultaneously divisible by $k$.

Prove that the remainder of dividing the square of an integer by $3$ is different from $2$.

Let $p$ be an odd prime and let $$F(n)=1+2n+3n^2+\ldots+(p-1)n^{p-2}.$$Prove that if $a$ and $b$ are distinct integers in $\{0,1,2,\ldots,p-1\}$ then $F(a)$ and $F(b)$ are not congruent modulo $p$.