Found problems: 85335
For all $n\ge2$, let $a_n$ be the product of all coprime natural numbers less than $n$. Prove that
(a) $n\mid a_n+1\Leftrightarrow n=2,4,p^\alpha,2p^\alpha$
(b) $n\mid a_n-1\Leftrightarrow n\ne2,4,p^\alpha,2p^\alpha$
Here $p$ is an odd prime number and $\alpha\in\mathbb N$.
For some positive integer $k$, the repeating base-$k$ representation of the (base-ten) fraction $\frac{7}{51}$ is $0.\overline{23}_k = 0.232323..._k$. What is $k$?
$\textbf{(A) } 13 \qquad\textbf{(B) } 14 \qquad\textbf{(C) } 15 \qquad\textbf{(D) } 16 \qquad\textbf{(E) } 17$
A $9\times 9$ array is filled with integers from 1 to 81. Prove that there exists $k\in\{1,2,3,\ldots, 9\}$ such that the product of the elements in the row $k$ is different from the product of the elements in the column $k$ of the array.
Let $x, y$, and $z$ be three not necessarily real numbers that satisfy the following system of equations:
$x^3 -4 = (2y +1)^2$
$y^3 -4 = (2z +1)^2$
$z^3 -4 = (2x +1)^2$.
Find the greatest possible real value of $(x -1)(y -1)(z -1)$.
If $R_n=\frac{1}{2}(a^n+b^n)$ where $a=3+2\sqrt{2}$, $b=3-2\sqrt{2}$, and $n=0,1,2, ...,$ then $R_{12345}$ is an integer. Its units digit is
$ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 7 \qquad\textbf{(E)}\ 9 $
Let $a$ , $b$ , $c$ be positive real numbers such that $abc=1$ . Show that :
\[\frac{1}{a^3+bc}+\frac{1}{b^3+ca}+\frac{1}{c^3+ab} \leq \frac{ \left (ab+bc+ca \right )^2 }{6}\]
Evaluate $\int_{0}^{4}e^{\sqrt{x}} \, dx$.
Given $n$ points, some of them connected by non-intersecting segments. You can reach every point from every one, moving along the segments, and there is no couple, connected by two different ways. Prove that the total number of the segments is $(n-1)$.
Find all solutions of the equation $4^x+3^y=z^2$ in positive integers.
Prove that for positive reals $a$,$b$,$c$ so that $a+b+c+abc=4$, \[\left (1+\dfrac{a}{b}+ca \right )\left (1+\dfrac{b}{c}+ab \right)\left (1+\dfrac{c}{a}+bc \right) \ge 27\] holds.
Find all triples $(p, q, r)$ of prime numbers for which $4q - 1$ is a prime number and $$\frac{p + q}{p + r} = r - p$$
holds.
[i](Walther Janous)[/i]
Point-like figures are placed in the vertices of a regular $k$-angle, and then we walk with them. In one step, a piece jumps over another piece, i.e. its new location will be a mirror image of its current location to the current location of another piece. In the case of $k \geq 3$ integers, it is possible to achieve with a series of such steps that the puppets form the vertices of a regular $k$-angle, different in size from the original?
Let $\{fn\}$ be the Fibonacci sequence $\{1, 1, 2, 3, 5, \dots.\}. $
(a) Find all pairs $(a, b)$ of real numbers such that for each $n$, $af_n +bf_{n+1}$ is a member of the sequence.
(b) Find all pairs $(u, v)$ of positive real numbers such that for each $n$, $uf_n^2 +vf_{n+1}^2$ is a member of the sequence.
Determine all positive integer solutions $(x, y, z, t)$ of the equation \[(x+y)(y+z)(z+x)=xyzt\] for which $\gcd(x, y)=\gcd(y, z)=\gcd(z, x)=1$.
There are $n^2$ segments in the plane (read walls), no two of which are parallel or intersecting.
Prove that there are at least $n$ points in the plane such that no two of them see each other (meaning there is a wall separating them).
Trodgor the dragon is burning down a village consisting of $ 90$ cottages. At time $ t \equal{} 0$ an angry peasant arises from each cottage, and every $ 8$ minutes ($ 480$ seconds) thereafter another angry peasant spontaneously generates from each non-burned cottage. It takes Trodgor $ 5$ seconds to either burn a peasant or to burn a cottage, but Trodgor cannot begin burning cottages until all the peasants around him have been burned. How many [b]seconds[/b] does it take Trodgor to burn down the entire village?
In triangle $ABC,$ angle $C$ is a right angle and the altitude from $C$ meets $\overline{AB}$ at $D.$ The lengths of the sides of $\triangle ABC$ are integers, $BD=29^3,$ and $\cos B=m/n,$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
Let $a_1,b_1,c_1,a_2,b_2,c_2$ be positive real number and $F,G:(0,\infty)\to(0,\infty)$ be to differentiable and positive functions that satisfy the identities: $$\frac{x}{F} = 1 + a_1x+ b_1y + c_1G$$ $$\frac{y}{G} = 1 + a_2x+ b_2y + c_2F.$$
Prove that if $0 < x_1 \leq x_2$ and $0 < y_2 \leq y_1$, then $F(x_1,x_2) \leq F(x_2,y_2)$ and $G(x_1,y_1) \geq G(x_2,y_2).$
Let $ABCD$ be a trapezoid such that $AD\parallel BC$ and $|AB|=|BC|$. Let $E$ and $F$ be the midpoints of $[BC]$ and $[AD]$, respectively. If the internal angle bisector of $\triangle ABC$ passes through $F$, find $|BD|/|EF|$.
In triangle $ABC$, choose point $A_1$ on side $BC$, point $B_1$ on side $CA$, and point $C_1$ on side $AB$ in such a way that the three segments $AA_1, BB_1$, and $CC_1$ intersect in one point $P$. Prove that $P$ is the centroid of triangle $ABC$ if and only if $P$ is the centroid of triangle $A_1B_1C_1$.
Note: A median in a triangle is a segment connecting a vertex of the triangle with the midpoint of the opposite side. The centroid of a triangle is the intersection point of the three medians of the triangle. The centroid of a triangle is also known by the names ”center of mass” and ”medicenter” of the triangle.
Let $z=z(x,y)$ be implicit function with two variables from $2sin(x+2y-3z)=x+2y-3z$. Find $\frac{\partial z}{\partial x}+\frac{\partial z}{\partial y}$.
If $a,b > 0$ and the triangle in the first quadrant bounded by the coordinate axes and the graph of $ax+by = 6$ has area 6, then $ab =$
$\text{(A)} \ 3 \qquad \text{(B)} \ 6 \qquad \text{(C)} \ 12 \qquad \text{(D)} \ 108 \qquad \text{(E)} \ 432$
Assume that $a$, $b$, $c$, and $d$ are positive integers such that $a^5 = b^4$, $c^3 = d^2$, and $c - a = 19$. Determine $d - b$.
When a certain unfair die is rolled, an even number is $3$ times as likely to appear as an odd number. The die is rolled twice. What is the probability that the sum of the numbers rolled is even?
$\textbf{(A) }\dfrac38\qquad\textbf{(B) }\dfrac49\qquad\textbf{(C) }\dfrac59\qquad\textbf{(D) }\dfrac9{16}\qquad\textbf{(E) }\dfrac58$
An $8 \times 8$ chessboard is covered completely and without overlaps by $32$ dominoes of size $1 \times 2$. Show that there are two dominoes forming a $2 \times 2$ square.