Found problems: 698
Find the sum of all integers $m$ with $1 \le m \le 300$ such that for any integer $n$ with $n \ge 2$, if $2013m$ divides $n^n-1$ then $2013m$ also divides $n-1$.
[i]Proposed by Evan Chen[/i]
For positive integers $n$, let $s(n)$ denote the sum of the squares of the positive integers less than or equal to $n$ that are relatively prime to $n$. Find the greatest integer less than or equal to \[ \sum_{n\mid 2013} \frac{s(n)}{n^2}, \] where the summation runs over all positive integers $n$ dividing $2013$.
[i]Ray Li[/i]
Prove that the ten's digit of any power of 3 is even.
Given a fixed positive integer $a\geq 9$. Prove: There exist finitely many positive integers $n$, satisfying:
(1)$\tau (n)=a$
(2)$n|\phi (n)+\sigma (n)$
Note: For positive integer $n$, $\tau (n)$ is the number of positive divisors of $n$, $\phi (n)$ is the number of positive integers $\leq n$ and relatively prime with $n$, $\sigma (n)$ is the sum of positive divisors of $n$.
An increasing arithmetic progression consists of one hundred positive integers. Is it possible that every two of them are relatively prime?
Square $ABCD$ is shown in the diagram below. Points $E$, $F$, and $G$ are on sides $\overline{AB}$, $\overline{BC}$ and $\overline{DA}$, respectively, so that lengths $\overline{BE}$, $\overline{BF}$, and $\overline{DG}$ are equal. Points $H$ and $I$ are the midpoints of segments $\overline{EF}$ and $\overline{CG}$, respectively. Segment $\overline{GJ}$ is the perpendicular bisector of segment $\overline{HI}$. The ratio of the areas of pentagon $AEHJG$ and quadrilateral $CIHF$ can be written as $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
[asy]
draw((0,0)--(50,0)--(50,50)--(0,50)--cycle);
label("$A$",(0,50),NW);
label("$B$",(50,50),NE);
label("$C$",(50,0),SE);
label("$D$",(0,0),SW);
label("$E$",(0,100/3-1),W);
label("$F$",(100/3-1,0),S);
label("$G$",(20,50),N);
label("$H$",((100/3-1)/2,(100/3-1)/2),SW);
label("$I$",(35,25),NE);
label("$J$",(((100/3-1)/2+35)/2,((100/3-1)/2+25)/2),S);
draw((0,100/3-1)--(100/3-1,0));
draw((20,50)--(50,0));
draw((100/6-1/2,100/6-1/2)--(35,25));
draw((((100/3-1)/2+35)/2,((100/3-1)/2+25)/2)--(20,50));
[/asy]
A dart board looks like three concentric circles with radii of 4, 6, and 8. Three darts are thrown at the board so that they stick at three random locations on then board. The probability that one dart sticks in each of the three regions of the dart board is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$.
Now Wendy wanders over and joins Dr. Lisi and her younger siblings. Thinking she knows everything there is about how to work with arithmetic series, she nearly turns right around to walk back home when Dr. Lisi poses a more challenging problem. "Suppose I select two distinct terms at random from the $2008$ term sequence. What's the probability that their product is positive?" If $a$ and $b$ are relatively prime positive integers such that $a/b$ is the probability that the product of the two terms is positive, find the value of $a+b$.
Find all positive integers $n>1$ such that
\[\tau(n)+\phi(n)=n+1\]
Which in this case, $\tau(n)$ represents the amount of positive divisors of $n$, and $\phi(n)$ represents the amount of positive integers which are less than $n$ and relatively prime with $n$.
[i]Raja Oktovin, Pekanbaru[/i]
Find the number of functions $ f: \mathbb N\rightarrow\mathbb N$ which satisfying:
(i) $ f(1) \equal{} 1$
(ii) $ f(n)f(n \plus{} 2) \equal{} f^2(n \plus{} 1) \plus{} 1997$ for every natural numbers n.
If you roll six fair dice, let $\mathsf{ p}$ be the probability that exactly five different numbers appear on the upper faces of the six dice. If $\mathsf{p} = \frac{m}{n}$ where $ m $ and $n$ are relatively prime positive integers, find $m+n.$
We define the sequence $x_n$ so that
\[x_1=a, x_2=b, x_n=\frac{{x_{n-1}}^2+{x_{n-2}}^2}{x_{n-1}+x_{n-2}} \quad \forall n \geq 3.\]
Where $a,b >1$ are relatively prime numbers. Show that $x_n$ is not an integer for $n \geq 3$.
A jar has 10 red candies and 10 blue candies. Terry picks two candies at random, then Mary picks two of the remaining candies at random. Given that the probability that they get the same color combination, irrespective of order, is $m/n$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.
Find all pairwise relatively prime positive integers $l, m, n$ such that \[(l+m+n)\left( \frac{1}{l}+\frac{1}{m}+\frac{1}{n}\right)\] is an integer.
In $\triangle ABC$, $AB=10$, $\angle A=30^\circ$, and $\angle C=45^\circ$. Let $H,D$, and $M$ be points on line $\overline{BC}$ such that $\overline{AH}\perp\overline{BC}$, $\angle BAD=\angle CAD$, and $BM=CM$. Point $N$ is the midpoint of segment $\overline{HM}$, and point $P$ is on ray $AD$ such that $\overline{PN}\perp\overline{BC}$. Then $AP^2=\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
Suppose that a parabola has vertex $\left(\tfrac{1}{4},-\tfrac{9}{8}\right)$, and equation $y=ax^2+bx+c$, where $a>0$ and $a+b+c$ is an integer. The minimum possible value of $a$ can be written as $\tfrac{p}{q},$ where $p$ and $q$ are relatively prime positive integers. Find $p+q$.
Triangle $A_1B_1C_1$ is an equilateral triangle with sidelength $1$. For each $n>1$, we construct triangle $A_nB_nC_n$ from $A_{n-1}B_{n-1}C_{n-1}$ according to the following rule: $A_n,B_n,C_n$ are points on segments $A_{n-1}B_{n-1},B_{n-1}C_{n-1},C_{n-1}A_{n-1}$ respectively, and satisfy the following: \[\dfrac{A_{n-1}A_n}{A_nB_{n-1}}=\dfrac{B_{n-1}B_n}{B_nC_{n-1}}=\dfrac{C_{n-1}C_n}{C_nA_{n-1}}=\dfrac1{n-1}\] So for example, $A_2B_2C_2$ is formed by taking the midpoints of the sides of $A_1B_1C_1$. Now, we can write $\tfrac{|A_5B_5C_5|}{|A_1B_1C_1|}=\tfrac mn$ where $m$ and $n$ are relatively prime integers. Find $m+n$. (For a triangle $\triangle ABC$, $|ABC|$ denotes its area.)
Two points $A$ and $B$ are selected independently and uniformly at random along the perimeter of a unit square with vertices at $(0,0)$, $(1,0)$, $(0,1)$, and $(1,1)$. The probability that the $y$-coordinate of $A$ is strictly greater than the $y$-coordinate of $B$ can be expressed as $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $100m+n$.
[i]Proposed by Rajiv Movva[/i]
Let $m$ boxes be given, with some balls in each box. Let $n < m$ be a given integer. The following operation is performed: choose $n$ of the boxes and put $1$ ball in each of them. Prove:
[i](a) [/i]If $m$ and $n$ are relatively prime, then it is possible, by performing the operation a finite number of times, to arrive at the situation that all the boxes contain an equal number of balls.
[i](b)[/i] If $m$ and $n$ are not relatively prime, there exist initial distributions of balls in the boxes such that an equal distribution is not possible to achieve.
As shown in the figure, line segment $\overline{AD}$ is trisected by points $B$ and $C$ so that $AB=BC=CD=2.$ Three semicircles of radius $1,$ $\overarc{AEB},\overarc{BFC},$ and $\overarc{CGD},$ have their diameters on $\overline{AD},$ and are tangent to line $EG$ at $E,F,$ and $G,$ respectively. A circle of radius $2$ has its center on $F. $ The area of the region inside the circle but outside the three semicircles, shaded in the figure, can be expressed in the form
\[\frac{a}{b}\cdot\pi-\sqrt{c}+d,\]
where $a,b,c,$ and $d$ are positive integers and $a$ and $b$ are relatively prime. What is $a+b+c+d$?
[asy]
size(6cm);
filldraw(circle((0,0),2), gray(0.7));
filldraw(arc((0,-1),1,0,180) -- cycle, gray(1.0));
filldraw(arc((-2,-1),1,0,180) -- cycle, gray(1.0));
filldraw(arc((2,-1),1,0,180) -- cycle, gray(1.0));
dot((-3,-1));
label("$A$",(-3,-1),S);
dot((-2,0));
label("$E$",(-2,0),NW);
dot((-1,-1));
label("$B$",(-1,-1),S);
dot((0,0));
label("$F$",(0,0),N);
dot((1,-1));
label("$C$",(1,-1), S);
dot((2,0));
label("$G$", (2,0),NE);
dot((3,-1));
label("$D$", (3,-1), S);
[/asy]
$\textbf{(A) } 13 \qquad\textbf{(B) } 14 \qquad\textbf{(C) } 15 \qquad\textbf{(D) } 16\qquad\textbf{(E) } 17$
Let $a/b$ be the probability that a randomly selected divisor of $2007$ is a multiple of $3$. If $a$ and $b$ are relatively prime positive integers, find $a+b$.
Prove the among $16$ consecutive integers it is always possible to find one which is relatively prime to all the rest.
Find all the natural numbers $m,n$ such that $1+5 \cdot 2^m=n^2$.
$ k$ is a given natural number. Find all functions $ f: \mathbb{N}\rightarrow\mathbb{N}$ such that for each $ m,n\in\mathbb{N}$ the following holds: \[ f(m)\plus{}f(n)\mid (m\plus{}n)^k\]
For a positive integer $n$, define the set $S_n$ as $S_n =\{(a, b)|a, b \in N, lcm[a, b] = n\}$ . Let $f(n)$ be the sum of $\phi (a)\phi (b)$ for all $(a, b) \in S_n$. If a prime $p$ relatively prime to $n$ is a divisor of $f(n)$, prove that there exists a prime $q|n$ such that $p|q^2 - 1$.