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: 238

Given arbitrary positive integer $ a$ larger than $ 1$, show that for any positive integer $ n$, there always exists a n-degree integral coefficient polynomial $ p(x)$, such that $ p(0)$, $ p(1)$, $ \cdots$, $ p(n)$ are pairwise distinct positive integers, and all have the form of $ 2a^k\plus{}3$, where $ k$ is also an integer.
Let $n$, $k$ be positive integers such that $n$ is not divisible by $3$ and $k\ge n$. Prove that there exists a positive integer m which is divisible by $n$ and the sum of its digits in the decimal representation is $k$.
The equation $z^6 + z^3 + 1$ has one complex root with argument $\theta$ between $90^\circ$ and $180^\circ$ in the complex plane. Determine the degree measure of $\theta$.
Let $a$ be an integer and $n$ a positive integer . Show that the sum : $$\sum_{k=1}^{n} a^{(k,n)}$$ is divisible by $n$ , where $(x,y)$ is the greatest common divisor of the numbers $x$ and $y$ .
We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.
Let $n$ be an integer with $n \ge 2$. Show that $\phi(2^{n}-1)$ is divisible by $n$.
Let $n$ be an integer and $p$ a prime greater than 2. Show that: $$(p-1)^nn!|(p^n-1)(p^n-p)(p^n-p^2)\cdots(p^n-p^{n-1}).$$
Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.
What is the units digit of $ 13^{2003}$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 7 \qquad \textbf{(D)}\ 8 \qquad \textbf{(E)}\ 9$
Prove that there exists a positive integer $n < 10^6$ such that $5^n$ has six consecutive zeros in its decimal representation. [i]Proposed by Evan Chen[/i]
Find all pairs of positive integers $(n,t)$ such that $6^n+1=n^2t$, and $(n,29 \times 197)=1$
Let $a,b,c$ be the sides of a triangle, $\alpha ,\beta ,\gamma$ the corresponding angles and $r$ the inradius. Prove that $$a\cdot sin\alpha+b\cdot sin\beta+c\cdot sin\gamma\geq 9r$$
Given an integer $n>2$ and an integer $a$, if there exists an integer $d$ such that $n\mid a^d-1$ and $n\nmid a^{d-1}+\cdots+1$, we say [i]$a$ is $n-$separating[/i]. Given any n>2, let the [i]defect of $n$[/i] be defined as the number of integers $a$ such that $0<a<n$, $(a,n)=1$, and $a$ is not [i] $n-$separating[/i]. Determine all integers $n>2$ whose defect is equal to the smallest possible value.
Find the number of ordered pairs $(m, n)$ such that $m$ and $n$ are positive integers in the set $\{1, 2, ..., 30\}$ and the greatest common divisor of $2^m + 1$ and $2^n - 1$ is not $1.$
In $\triangle ABC$ let $I$ be the center of the inscribed circle, and let the bisector of $\angle ACB$ intersect $AB$ at $L$. The line through $C$ and $L$ intersects the circumscribed circle of $\triangle ABC$ at the two points $C$ and $D$. If $LI = 2$ and $LD = 3$, then $IC = \tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p + q$.
Let $a_n = 6^n + 8^n$. Determine the remainder on dividing $a_{83}$ by 49.
A triangle with sides of $ 5$, $ 12$, and $ 13$ has both an inscibed and a circumscribed circle. What is the distance between the centers of those circles? $ \textbf{(A)}\ \frac{3\sqrt{5}}{2}\qquad \textbf{(B)}\ \frac{7}{2}\qquad \textbf{(C)}\ \sqrt{15}\qquad \textbf{(D)}\ \frac{\sqrt{65}}{2}\qquad \textbf{(E)}\ \frac{9}{2}$
Given two positives integers $m$ and $n$, prove that there exists a positive integer $k$ and a set $S$ of at least $m$ multiples of $n$ such that the numbers $\frac {2^k{\sigma({s})}} {s}$ are odd for every $s \in S$. $\sigma({s})$ is the sum of all positive integers of $s$ (1 and $s$ included).
Let $a > 1$ be a positive integer and $d > 1$ be a positive integer coprime to $a$. Let $x_1=1$, and for $k\geq 1$, define $$x_{k+1} = \begin{cases} x_k + d &\text{if } a \text{ does not divide } x_k \\ x_k/a & \text{if } a \text{ divides } x_k \end{cases}$$ Find, in terms of $a$ and $d$, the greatest positive integer $n$ for which there exists an index $k$ such that $x_k$ is divisible by $a^n$.
Let $a > 1$ be a positive integer. Prove that for some nonnegative integer $n$, the number $2^{2^n}+a$ is not prime. [i]Proposed by Jack Gurev[/i]
Let $p,q$ be prime numbers ($q$ is odd). Prove that there exists an integer $x$ such that: $$q |(x+1)^p-x^p$$ If and only if $$q \equiv 1 \pmod p$$
Find all integer solutions of $ p^3\equal{}p^2\plus{}q^2\plus{}r^2$ where $ p,q,r$ are primes.
We say that a set $S$ of integers is [i]rootiful[/i] if, for any positive integer $n$ and any $a_0, a_1, \cdots, a_n \in S$, all integer roots of the polynomial $a_0+a_1x+\cdots+a_nx^n$ are also in $S$. Find all rootiful sets of integers that contain all numbers of the form $2^a - 2^b$ for positive integers $a$ and $b$.
Let $n>2$ be an integer. A deck contains $\frac{n(n-1)}{2}$ cards,numbered \[1,2,3,\cdots , \frac{n(n-1)}{2}\] Two cards form a [i]magic pair[/i] if their numbers are consecutive , or if their numbers are $1$ and $\frac{n(n+1)}{2}$. For which $n$ is it possible to distribute the cards into $n$ stacks in such a manner that, among the cards in any two stacks , there is exactly one [i]magic pair[/i]?