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

Prove that the number $x^8+\frac{1}{x^8}$ is an integer if $x+\frac{1}{x }$ is an integer.
Let $a_0 ,a_1 , \ldots, a_n$ be real numbers and let $f(x) =a_n x^n +\ldots +a_1 x +a_0.$ Suppose that $f(i)$ is an integer for all $i.$ Prove that $n! \cdot a_k$ is an integer for each $k.$
Show that there exist infinitely many mutually non- congruent triangles $T$, satisfying (i) The side lengths of $T $ are consecutive integers. (ii) The area of $T$ is an integer.
Show that there are infinitely many positive integers $a$ that cannot be written as $a = a_{1}^{6}+ a_{2}^{6} + \ldots + a_{7}^{6},$ where the $a_i$ are positive integers. State and prove a generalization.
(a) Let $a_0, a_1,a_2$ be real numbers and consider the polynomial $P(x) = a_0 + a_1x + a_2x^2$ . Assume that $P(-1), P(0)$ and $P(1)$ are integers. Prove that $P(n)$ is an integer for all integers $n$. (b) Let $a_0,a_1, a_2, a_3$ be real numbers and consider the polynomial $Q(x) = a0 + a_1x + a_2x^2 + a_3x^3 $. Assume that there exists an integer $i$ such that $Q(i),Q(i+1),Q(i+2)$ and $Q(i+3)$ are integers. Prove that $Q(n)$ is an integer for all integers $n$.
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.
Given rational numbers $a_1,...,a_n$ such that $\sum_{i=1}^n \{ka_i\}<\frac{n}{2}$ for any positive integer $k$. a) Prove that at least one of $a_1,...,a_n$ is integer. b) Is the previous statement true, if the number $\frac{n}{2}$ is replaced by the greater number? (Here $\{x\}$ means a fractional part of $x$.) (N. Selinger)
Find all integers that can be written in the form $\frac{1}{a_1}+\frac{2}{a_2}+...+\frac{9}{a_9}$ where $a_1,a_2, ...,a_9$ are nonzero digits, not necessarily different.
Call a set of positive integers "conspiratorial" if no three of them are pairwise relatively prime. What is the largest number of elements in any "conspiratorial" subset of the integers $1$ to $16$?
Find all triples $(a, b, c)$ of positive integers for which $\frac{32a + 3b + 48c}{4abc}$ is also an integer.
In the beginning there are $100$ integers in a row on the blackboard. Kain and Abel then play the following game: A [i]move[/i] consists in Kain choosing a chain of consecutive numbers; the length of the chain can be any of the numbers $1,2,\dots,100$ and in particular it is allowed that Kain only chooses a single number. After Kain has chosen his chain of numbers, Abel has to decide whether he wants to add $1$ to each of the chosen numbers or instead subtract $1$ from of the numbers. After that the next move begins, and so on. If there are at least $98$ numbers on the blackboard that are divisible by $4$ after a move, then Kain has won. Prove that Kain can force a win in a finite number of moves.
Let $a$ be a positive integer. For all positive integer n, we define $ a_n=1+a+a^2+\ldots+a^{n-1}. $ Let $s,t$ be two different positive integers with the following property: If $p$ is prime divisor of $s-t$, then $p$ divides $a-1$. Prove that number $\frac{a_{s}-a_{t}}{s-t}$ is an integer. (FYROM)
The positive integers $a_1,a_2, \dots, a_n$ are aligned clockwise in a circular line with $n \geq 5$. Let $a_0=a_n$ and $a_{n+1}=a_1$. For each $i \in \{1,2,\dots,n \}$ the quotient \[ q_i=\frac{a_{i-1}+a_{i+1}}{a_i} \] is an integer. Prove \[ 2n \leq q_1+q_2+\dots+q_n < 3n. \]
Find the maximum number of positive integers such that any two of them $a, b$ (with $a \ne b$) satisfy that$ |a - b| \ge \frac{ab}{100} .$
Let $n$ be a positive integer. Prove that the interval $I_n= \left( \frac{1+\sqrt{8n+1}}{2}, \frac{1+\sqrt{8n+9}}{2}\right)$ does not contain any integer.
Rational numbers $a, b$ are such that $a+b$ and $a^2+b^2$ are integers. Prove that $a, b$ are integers.
Let $k$ be any fixed positive integer. Let's look at integer pairs $(a, b)$, for which the quadratic equations $x^2 - 2ax + b = 0$ and $y^2 + 2ay + b = 0$ are real solutions (not necessarily different), which can be denoted by $x_1, x_2$ and $y_1, y_2$, respectively, in such an order that the equation $x_1 y_1 - x_2 y_2 = 4k$. a) Find the largest possible value of the second component $b$ of such a pair of numbers ($a, b)$. b) Find the sum of the other components of all such pairs of numbers.
Let $n\ge 1$ be an integer and consider the sum $$x=\sum_{k\ge 0} \dbinom{n}{2k} 2^{n-2k}3^k=\dbinom{n}{0}2^n+\dbinom{n}{2}2^{n-2}\cdot{}3+\dbinom{n}{4}2^{n-k}\cdot{}3^2 + \cdots{}.$$ Show that $2x-1,2x,2x+1$ form the sides of a triangle whose area and inradius are also integers.
A rectangle is divided by $10$ horizontal and $10$ vertical lines into $121$ rectangular cells. If $111$ of them have integer perimeters, prove that they all have integer perimeters.
Prove that if the function $ ax^2 + bx + c $ takes an integer value for every integer value of the variable $ x $, then $ 2a $, $ a + b $, $ c $ are integers and vice versa.
Consider the sets $M = \{0,1,2,, 2019\}$ and $$A=\left\{ x\in M\,\, | \frac{x^3-x}{24} \in N\right\} $$ a) How many elements does the set $A$ have? b) Determine the smallest natural number $n$, $n \ge 2$, which has the property that any $n$-element subset of the set $A $contains two distinct elements whose difference is divisible by $40$.
Let $n$ be a given positive integer and $$A =\frac{1 \cdot 3 \cdot 5 \cdot ... \cdot (2n- 1)}{2 \cdot 4 \cdot 6 \cdot ... \cdot 2n}$$ Prove that at least one term of the sequence $A, 2A,4A,8A,...,2^kA, ... $ is an integer.
Prove that if the numbers $ x_1 $ and $ x_2 $ are roots of the equation $ x^2 + px - 1 = 0 $, where $ p $ is an odd number, then for every natural $n$number $ x_1^n + x_2^n $ and $ x_1^{n+1} + x_2^{n+1} $ are integer and coprime.
(a) Determine all pairs $(x, y)$ of (real) numbers with $0 < x < 1$ and $0 <y < 1$ for which $x + 3y$ and $3x + y$ are both integer. An example is $(x,y) =( \frac{8}{3}, \frac{7}{8}) $, because $ x+3y =\frac38 +\frac{21}{8} =\frac{24}{8} = 3$ and $ 3x+y = \frac98 + \frac78 =\frac{16}{8} = 2$. (b) Determine the integer $m > 2$ for which there are exactly $119$ pairs $(x,y)$ with $0 < x < 1$ and $0 < y < 1$ such that $x + my$ and $mx + y$ are integers. Remark: if $u \ne v,$ the pairs $(u, v)$ and $(v, u)$ are different.