Found problems: 698
Let $ p$ be the product of two consecutive integers greater than 2. Show that there are no integers $ x_1, x_2, \ldots, x_p$ satisfying the equation
\[ \sum^p_{i \equal{} 1} x^2_i \minus{} \frac {4}{4 \cdot p \plus{} 1} \left( \sum^p_{i \equal{} 1} x_i \right)^2 \equal{} 1
\]
[b]OR[/b]
Show that there are only two values of $ p$ for which there are integers $ x_1, x_2, \ldots, x_p$ satisfying
\[ \sum^p_{i \equal{} 1} x^2_i \minus{} \frac {4}{4 \cdot p \plus{} 1} \left( \sum^p_{i \equal{} 1} x_i \right)^2 \equal{} 1
\]
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$.
Given an integer $ n>6$. Consider those integers $ k\in (n(n\minus{}1),n^{2})$ which are coprime with $ n$. Prove that the greatest common divisor of the considered numbers is $ 1$.
Define the infinite products \[ A = \prod\limits_{i=2}^{\infty} \left(1-\frac{1}{n^3}\right) \text{ and } B = \prod\limits_{i=1}^{\infty}\left(1+\frac{1}{n(n+1)}\right). \] If $\tfrac{A}{B} = \tfrac{m}{n}$ where $m,n$ are relatively prime positive integers, determine $100m+n$.
[i]Proposed by Lewis Chen[/i]
Find the smallest positive integer $ K$ such that every $ K$-element subset of $ \{1,2,...,50 \}$ contains two distinct elements $ a,b$ such that $ a\plus{}b$ divides $ ab$.
Let $S=\{1,2,3,\ldots,280\}$. Find the smallest integer $n$ such that each $n$-element subset of $S$ contains five numbers which are pairwise relatively prime.
$(FRA 6)$ Consider the integer $d = \frac{a^b-1}{c}$, where $a, b$, and $c$ are positive integers and $c \le a.$ Prove that the set $G$ of integers that are between $1$ and $d$ and relatively prime to $d$ (the number of such integers is denoted by $\phi(d)$) can be partitioned into $n$ subsets, each of which consists of $b$ elements. What can be said about the rational number $\frac{\phi(d)}{b}?$
Qing initially writes the ordered pair $(1,0)$ on a blackboard. Each minute, if the pair $(a,b)$ is on the board, she erases it and replaces it with one of the pairs $(2a-b,a)$, $(2a+b+2,a)$ or $(a+2b+2,b)$. Eventually, the board reads $(2014,k)$ for some nonnegative integer $k$. How many possible values of $k$ are there?
[i]Proposed by Evan Chen[/i]
Let $f(n)=\varphi(n^3)^{-1}$, where $\varphi(n)$ denotes the number of positive integers not greater than $n$ that are relatively prime to $n$. Suppose
\[ \frac{f(1)+f(3)+f(5)+\dots}{f(2)+f(4)+f(6)+\dots} = \frac{m}{n} \]
where $m$ and $n$ are relatively prime positive integers. Compute $100m+n$.
[i]Proposed by Lewis Chen[/i]
On triangle $ABC$ let $D$ be the point on $AB$ so that $CD$ is an altitude of the triangle, and $E$ be the point on $BC$ so that $AE$ bisects angle $BAC.$ Let $G$ be the intersection of $AE$ and $CD,$ and let point $F$ be the intersection of side $AC$ and the ray $BG.$ If $AB$ has length $28,$ $AC$ has length $14,$ and $CD$ has length $10,$ then the length of $CF$ can be written as $\tfrac{k-m\sqrt{p}}{n}$ where $k, m, n,$ and $p$ are positive integers, $k$ and $n$ are relatively prime, and $p$ is not divisible by the square of any
prime. Find $k - m + n + p.$
Show that there are infintely many pairs $(a,b)$ of relatively prime integers (not necessarily positive) such that both the equations \begin{eqnarray*} x^2 +ax +b &=& 0 \\ x^2 + 2ax + b &=& 0 \\ \end{eqnarray*} have integer roots.
How many positive integers $n$ are there such that there are $20$ positive integers that are less than $n$ and relatively prime with $n$?
$ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ \text{None}$
Given are arbitrary integers $a,b,p$. Prove that there always exist relatively prime integers $k$ and $\ell$ such that $ak+b\ell$ is divisible by $p$.
Compute the number of positive integers $n < 2012$ that share exactly two positive factors with 2012.
[i]Proposed by Aaron Lin[/i]
Given positive integers $a,b,c$ which are pairwise relatively prime, show that \[2abc-ab-bc-ac \] is the biggest number that can't be expressed in the form $xbc+yca+zab$ with $x,y,z$ being natural numbers.
Four consecutive three-digit numbers are divided respectively by four consecutive two-digit numbers. What minimum number of different remainders can be obtained?
[i](A. Golovanov)[/i]
The repeating decimal $0.328181818181...$ can equivalently be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
Find the number of 8-digit base-6 positive integers $(a_1a_2a_3a_4a_5a_6a_7a_8)_6$ (with leading zeros permitted) such that $(a_1a_2\ldots a_8)_6\mid(a_{i+1}a_{i+2}\ldots a_{i+8})_6$ for $i=1,2,\ldots,7$, where indices are taken modulo $8$ (so $a_9=a_1$, $a_{10}=a_2$, and so on).
[i]Victor Wang[/i]
Find all relatively prime integers $a,b$ such that $$a^2+a=b^3+b$$
Find all the pairs of prime numbers $ (p,q)$ such that $ pq|5^p\plus{}5^q.$
Let $a$ and $b$ be rational numbers such that $s=a+b=a^2+b^2$. Prove that $s$ can be written as a fraction where the denominator is relatively prime to $6$.
Let $m$ and $n$ be natural numbers such that \[A=\frac{(m+3)^{n}+1}{3m}\] is an integer. Prove that $A$ is odd.
Let $a$ be a positive integer such that $\gcd(an+1, 2n+1) = 1$ for all integer $n$.
a) Prove that $\gcd(a-2, 2n+1) = 1$ for all integer $n$.
b) Find all possible $a$.
Let $a$ be an odd integer. Prove that $a^{2^m}+2^{2^m}$ and $a^{2^n}+2^{2^n}$ are relatively prime for all positive integers $n$ and $m$ with $n\not= m$.
Ten points in the plane are given, with no three collinear. Four distinct segments joining pairs of these points are chosen at random, all such segments being equally likely. The probability that some three of the segments form a triangle whose vertices are among the ten given points is $m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$