Find all positive integers $n>2$ such that $$ n! \mid \prod_{ p<q\le n, p,q \, \text{primes}} (p+q)$$

Determine all real numbers $x$, such that $x^n+x^{-n}$ is an integer for all integers $n$.

[b]p1.[/b] Show that $9x + 5y$ is a multiple of$ 17$ whenever $2x + 3y$ is a multiple of $17$. [b]p2.[/b] Express the five distinct fifth roots of $1$ in terms of radicals. [b]p3.[/b] Prove that the three perpendiculars dropped to the three sides of an equilateral triangle from any point inside the triangle have a constant sum. [b]p4.[/b] Find the volume of a sphere which circumscribes a regular tetrahedron of edge $a$. [b]p5.[/b] For any integer $n$ greater than $1$, show that $n^2-2n + 1$ is a factor at $n^{n-1}-1$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Show an example of $15$ nonzero natural numbers with the property that if each one of them is increased by one, then the product of all increased numbers is $2015$ times higher than the product of the initial numbers

Let $x,y$ be the positive integers such that $3x^2 +x = 4y^2 + y$. Prove that $x - y$ is a perfect (square).

Let us call a set of positive integers [i]nice[/i], if its number of elements is equal to the average of all its elements. Call a number $n$ [i]amazing[/i], if one can partition the set $\{1,2,\ldots,n\}$ into nice subsets. a) Prove that any perfect square is amazing. b) Prove that there exist infinitely many positive integers which are not amazing.

Find all $4$-tuples $(a,b,c,d)$ of natural numbers with $a \le b \le c$ and $a!+b!+c!=3^d$

Find all pairs $(m, n)$ of positive integers such that $m^2 + n^2 =(m + 1)(n + 1).$

Consider the natural number prime $p, p> 5$. From the decimal number $\frac1p$, randomly remove $2012$ numbers, after the comma. Show that the remaining number can be represented as $\frac{a}{b}$ , where $a$ and $b$ are coprime numbers , and $b$ is multiple of $p$.

What is the biggest positive integer which divides $p^4 - q^4$ for all primes $p$ and $q$ greater than $10$?

Given a positive prime number $p$. Prove that there exist a positive integer $\alpha$ such that $p|\alpha(\alpha-1)+3$, if and only if there exist a positive integer $\beta$ such that $p|\beta(\beta-1)+25$.

Let us denote with $S(n)$ the sum of all the digits of $n$. a) Is there such an $n$ that $n+S(n)=1980$? b) Prove that at least one of two arbitrary successive natural numbers is representable as $n + S(n)$ for some third number $n$.

Let \(S(n)\) denote the sum of the digits of the base-10 representation of an natural number \(n\). For example. \(S(2017) = 2+0+1+7 = 10\). Prove that for all primes \(p\), there exists infinitely many \(n\) which satisfy \(S(n) \equiv n \mod p\).

Solve the equation in the set of natural numbers $xyz+yzt+xzt+xyt = xyzt + 3$

[b]p1.[/b] A canoeist is paddling upstream in a river when she passes a log floating downstream,, She continues upstream for awhile, paddling at a constant rate. She then turns around and goes downstream and paddles twice as fast. She catches up to the same log two hours after she passed it. How long did she paddle upstream? [b]p2.[/b] Let $g(x) =1-\frac{1}{x}$ and define $g_1(x) = g(x)$ and $g_{n+1}(x) = g(g_n(x))$ for $n = 1,2,3, ...$. Evaluate $g_3(3)$ and $g_{1982}(l982)$. [b]p3.[/b] Let $Q$ denote quadrilateral $ABCD$ where diagonals $AC$ and $BD$ intersect. If each diagonal bisects the area of $Q$ prove that $Q$ must be a parallelogram. [b]p4.[/b] Given that: $a_1, a_2, ..., a_7$ and $b_1, b_2, ..., b_7$ are two arrangements of the same seven integers, prove that the product $(a_1-b_1)(a_2-b_2)...(a_7-b_7)$ is always even. [b]p5.[/b] In analyzing the pecking order in a finite flock of chickens we observe that for any two chickens exactly one pecks the other. We decide to call chicken $K$ a king provided that for any other chicken $X, K$ necks $X$ or $K$ pecks a third chicken $Y$ who in turn pecks $X$. Prove that every such flock of chickens has at least one king. Must the king be unique? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find a four-digit perfect square whose first digit is the same as the second, and the third is the same as the fourth.

Given a natural number $ n, $ prove that the set $ \{ -n+1,-n+2,\ldots ,-1,1,2,\ldots ,n-1,n\} $ can be partitioned into $ k $ subsets such that the sums of all elements of each of these subsets are equal, if and only if $ n $ is multiple of $ k. $

Determine positive integers $a$ and $b$ co-prime such that $a^2+b = (a-b)^3$ .

Determine the ordered systems $(x,y,z)$ of positive rational numbers for which $x+\frac{1}{y},y+\frac{1}{z}$ and $z+\frac{1}{x}$ are integers.

Let us define a function $f:\mathbb N\to\mathbb N_0$ by $f(1)=0$ and, for all $n\in\mathbb N$, $$f(2n)=2f(n)+1,\qquad f(2n+1)=2f(n).$$Given a positive integer $p$, define a sequence $(u_n)$ by $u_0=p$ and $u_{k+1}=f(u_k)$ whenever $u_k\ne0$. (a) Prove that, for each $p\in\mathbb N$, there is a unique integer $v(p)$ such that $u_{v(p)}=0$. (b) Compute $v(1994)$. What is the smallest integer $p>0$ for which $v(p)=v(1994)$. (c) Given an integer $N$, determine the smallest integer $p$ such that $v(p)=N$.

Find the number of primes $p$ such that $p! + 25p$ is a perfect square.

[b]p1.[/b] An Egyptian fraction has the form $1/n$, where $n$ is a positive integer. In ancient Egypt, these were the only fractions allowed. Other fractions between zero and one were always expressed as a sum of distinct Egyptian fractions. For example, $3/5$ was seen as $1/2 + 1/10$, or $1/3 + 1/4 + 1/60$. The preferred method of representing a fraction in Egypt used the "greedy" algorithm, which at each stage, uses the Egyptian fraction that eats up as much as possible of what is left of the original fraction. Thus the greedy fraction for $3/5$ would be $1/2 + 1/10$. a) Find the greedy Egyptian fraction representations for $2/13$. b) Find the greedy Egyptian fraction representations for $9/10$. c) Find the greedy Egyptian fraction representations for $2/(2k+1)$, where $k$ is a positive integer. d) Find the greedy Egyptian fraction representations for $3/(6k+1)$, where $k$ is a positive integer. [b]p2.[/b] a) The smaller of two concentric circles has radius one unit. The area of the larger circle is twice the area of the smaller circle. Find the difference in their radii. [img]https://cdn.artofproblemsolving.com/attachments/8/1/7c4d81ebfbd4445dc31fa038d9dc68baddb424.png[/img] b) The smaller of two identically oriented equilateral triangles has each side one unit long. The smaller triangle is centered within the larger triangle so that the perpendicular distance between parallel sides is always the same number $d$. The area of the larger triangle is twice the area of the smaller triangle. Find $d$. [img]https://cdn.artofproblemsolving.com/attachments/8/7/1f0d56d8e9e42574053c831fa129eb40c093d9.png[/img] [b]p3.[/b] Suppose that the domain of a function $f$ is the set of real numbers and that $f$ takes values in the set of real numbers. A real number $x_0$ is a fixed point of f if $f(x_0) = x_0$. a) Let $f(x) = m x + b$. For which $m$ does $f$ have a fixed point? b) Find the fixed point of f$(x) = m x + b$ in terms of m and b, when it exists. c) Consider the functions $f_c(x) = x^2 - c$. i. For which values of $c$ are there two different fixed points? ii. For which values of $c$ are there no fixed points? iii. In terms of $c$, find the value(s) of the fixed point(s). d) Find an example of a function that has exactly three fixed points. [b]p4.[/b] A square based pyramid is made out of rubber balls. There are $100$ balls on the bottom level, 81 on the next level, etc., up to $1$ ball on the top level. a) How many balls are there in the pyramid? b) If each ball has a radius of $1$ meter, how tall is the pyramid? c) What is the volume of the solid that you create if you place a plane against each of the four sides and the base of the balls? [b]p5.[/b] We wish to consider a general deck of cards specified by a number of suits, a sequence of denominations, and a number (possibly $0$) of jokers. The deck will consist of exactly one card of each denomination from each suit, plus the jokers, which are "wild" and can be counted as any possible card of any suit. For example, a standard deck of cards consists of $4$ suits, $13$ denominations, and $0$ jokers. a) For a deck with $3$ suits $\{a, b, c\}$ and $7$ denominations $\{1, 2, 3, 4, 5, 6, 7\}$, and $0$ jokers, find the probability that a 3-card hand will be a straight. (A straight consists of $3$ cards in sequence, e.g., $1 \heartsuit$ ,$2 \spadesuit$ , $3\clubsuit$ , $2\diamondsuit$ but not $6 \heartsuit$ ,$7 \spadesuit$ , $1\diamondsuit$). b) For a deck with $3$ suits, $7$ denominations, and $0$ jokers, find the probability that a $3$-card hand will consist of $3$ cards of the same suit (i.e., a flush). c) For a deck with $3$ suits, $7$ denominations, and $1$ joker, find the probability that a $3$-card hand dealt at random will be a straight and also the probability that a $3$-card hand will be a flush. d) Find a number of suits and the length of the denomination sequence that would be required if a deck is to contain $1$ joker and is to have identical probabilities for a straight and a flush when a $3$-card hand is dealt. The answer that you find must be an answer such that a flush and a straight are possible but not certain to occur. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $p$ be a prime number of the form $4k+3$. Prove that there are no integers $w,x,y,z$ whose product is not divisible by $p$, such that: \[ w^{2p}+x^{2p}+y^{2p}=z^{2p}. \]

Consider a square-free even integer $n$ and a prime $p$, such that 1) $(n,p)=1$; 2) $p\le 2\sqrt{n}$; 3) There exists an integer $k$ such that $p|n+k^2$. Prove that there exists pairwise distinct positive integers $a,b,c$ such that $n=ab+bc+ca$. [i]Proposed by Hongbing Yu[/i]

For a given positive integer $n$, let $f(x) =x^{n}$. Is it possible for the decimal number $$0.f(1)f(2)f(3)\ldots$$ to be rational? (Example: for $n=2$, we are considering $0.1491625\ldots$)