This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 583

Suppose that $2^{2n+1}+ 2^{n}+1=x^{k}$, where $k\geq2$ and $n$ are positive integers. Find all possible values of $n$.
Let $G$ be a hyper elementary abelian $p-$group and let $f : G \rightarrow G$ be a homomorphism. Then prove that $\ker f$ is isomorphic to $\mathrm{coker} f$.
Prove that the equation \[\frac{4}{n}=\frac{1}{x}+\frac{1}{y}+\frac{1}{z}\] has infinitly many natural solutions
For all positive integers $a$ and $b$, we de ne $a @ b = \frac{a - b}{gcd(a, b)}$ . Show that for every integer $n > 1$, the following holds: $n$ is a prime power if and only if for all positive integers $m$ such that $m < n$, it holds that $gcd(n, n @m) = 1$.
Find all primes $p$ for which the quotient \[ \dfrac{2^{p-1} - 1 }{p} \] is a square.
Let $n$ and $k$ be relatively prime positive integers with $k<n$. Each number in the set $M=\{1,2,3,\ldots,n-1\}$ is colored either blue or white. For each $i$ in $M$, both $i$ and $n-i$ have the same color. For each $i\ne k$ in $M$ both $i$ and $|i-k|$ have the same color. Prove that all numbers in $M$ must have the same color.
Consider $5$ distinct positive integers. Can their mean be a)Exactly $3$ times larger than their largest common divisor? b)Exactly $2$ times larger than their largest common divisor?
For positive integers $a$, $b$, and $c$, define \[ f(a,b,c)=\frac{abc}{\text{gcd}(a,b,c)\cdot\text{lcm}(a,b,c)}. \] We say that a positive integer $n$ is $f@$ if there exist pairwise distinct positive integers $x,y,z\leq60$ that satisfy $f(x,y,z)=n$. How many $f@$ integers are there? [i]Proposed by Michael Ren[/i]
Two farmers agree that pigs are worth $ \$300$ and that goats are worth $ \$210$. When one farmer owes the other money, he pays the debt in pigs or goats, with ``change'' received in the form of goats or pigs as necessary. (For example, a $ \$390$ debt could be paid with two pigs, with one goat received in change.) What is the amount of the smallest positive debt that can be resolved in this way? $ \textbf{(A) } \$5\qquad \textbf{(B) } \$10\qquad \textbf{(C) } \$30\qquad \textbf{(D) } \$90\qquad \textbf{(E) } \$210$
Let $B=\{2^1,2^2,2^3,\dots,2^{21}\}.$ Find the remainder when \[ \sum_{m, n \in B: \ m<n}\gcd(m,n) \] is divided by $1000,$ where the sum is taken over all pairs of elements $(m,n)$ of $B$ such that $m<n.$
Let $a, b,c$ be positive integers such that $gcd(a, b, c) = 1$ and each product of two is divided by the third. a) Prove that each of these numbers is equal to the least two remaining numbers the quotient of the coefficient and the highest coefficient. b) Give an example of one of these larger numbers $a, b$ and $c$
Let $n_1,\ldots,n_k$ be positive integers, and define $d_1=1$ and $d_i=\frac{(n_1,\ldots,n_{i-1})}{(n_1,\ldots,n_{i})}$, for $i\in \{2,\ldots,k\}$, where $(m_1,\ldots,m_{\ell})$ denotes the greatest common divisor of the integers $m_1,\ldots,m_{\ell}$. Prove that the sums \[\sum_{i=1}^k a_in_i\] with $a_i\in\{1,\ldots,d_i\}$ for $i\in\{1,\ldots,k\}$ are mutually distinct $\mod n_1$.
Let $g(n)$ be the greatest common divisor of $n$ and $2015$. Find the number of triples $(a,b,c)$ which satisfies the following two conditions: $1)$ $a,b,c \in$ {$1,2,...,2015$}; $2)$ $g(a),g(b),g(c),g(a+b),g(b+c),g(c+a),g(a+b+c)$ are pairwise distinct.
Show that: 1) If $2n-1$ is a prime number, then for any $n$ pairwise distinct positive integers $a_1, a_2, \ldots , a_n$, there exists $i, j \in \{1, 2, \ldots , n\}$ such that \[\frac{a_i+a_j}{(a_i,a_j)} \geq 2n-1\] 2) If $2n-1$ is a composite number, then there exists $n$ pairwise distinct positive integers $a_1, a_2, \ldots , a_n$, such that for any $i, j \in \{1, 2, \ldots , n\}$ we have \[\frac{a_i+a_j}{(a_i,a_j)} < 2n-1\] Here $(x,y)$ denotes the greatest common divisor of $x,y$.
Find all positive integers $m,n$ and prime numbers $p$ for which $\frac{5^m+2^np}{5^m-2^np}$ is a perfect square.
[b]Q11.[/b] Let be given a sequense $a_1=5, \; a_2=8$ and $a_{n+1}=a_n+3a_{n-1}, \qquad n=1,2,3,...$ Calculate the greatest common divisor of $a_{2011}$ and $a_{2012}$.
Prove that the expression \[ \dfrac {\text {gcd}(m, n)}{n} \dbinom {n}{m} \] is an integer for all pairs of integers $ n \ge m \ge 1 $.
$x,y$ are naturals. $GCM(x^7,y^4)*GCM(x^8,y^5)=xy$ Prove that $xy$ is cube
Let $n$ be a positive integer. Let $S$ be a set of $n$ positive integers such that the greatest common divisors of all nonempty sets of $S$ are distinct. Determine the smallest possible number of distinct prime divisors of the product of the elements of $S$.
Determine all possible values of $m+n$, where $m$ and $n$ are positive integers satisfying \[\operatorname{lcm}(m,n) - \gcd(m,n) = 103.\]
Let $ a $ and $ b $ be natural numbers with property $ gcd(a,b)=1 $ . Find the least natural number $ k $ such that for every natural number $ r \ge k $ , there exist natural numbers $ m,n >1 $ in such a way that the number $ m^a n^b $ has exactly $ r+1 $ positive divisors.
Let $x$ and $y$ be positive integers such that $2(x+y)=gcd(x,y)+lcm(x,y)$. Find $\frac{lcm(x,y)}{gcd(x,y)}$.
Show that the GCD of three consecutive triangular numbers is 1.
Let $a_i, b_i$ be coprime positive integers for $i = 1, 2, \ldots , k$, and $m$ the least common multiple of $b_1, \ldots , b_k$. Prove that the greatest common divisor of $a_1 \frac{m}{b_1} , \ldots, a_k \frac{m}{b_k}$ equals the greatest common divisor of $a_1, \ldots , a_k.$
Let \[ f(x)\equal{}a_0\plus{}a_1x\plus{}a_2x^2\plus{}a_{10}x^{10}\plus{}a_{11}x^{11}\plus{}a_{12}x^{12}\plus{}a_{13}x^{13} \; (a_{13} \not\equal{}0) \] and \[ g(x)\equal{}b_0\plus{}b_1x\plus{}b_2x^2\plus{}b_{3}x^{3}\plus{}b_{11}x^{11}\plus{}b_{12}x^{12}\plus{}b_{13}x^{13} \; (b_{3} \not\equal{}0) \] be polynomials over the same field. Prove that the degree of their greatest common divisor is at least $ 6$. [i]L. Redei[/i]