Found problems: 85335
Determine the sum of all possible surface area of a cube two of whose vertices are $(1,2,0)$ and $(3,3,2)$.
Mike rides a bike for $30$ minutes, traveling $8$ miles. He started riding at $20$ miles per hour, but by the end of his journey he was only traveling at $10$ miles per hour. What was his average speed, in miles per hour?
[i]Proposed by Nathan Ramesh
It takes $5$ seconds for a clock to strike $6$ o'clock beginning at $6:00$ o'clock precisely. If the strikings are uniformly spaced, how long, in seconds, does it take to strike $12$ o'clock?
$ \textbf{(A) }9\frac{1}{5} \qquad\textbf{(B) }10\qquad\textbf{(C) }11\qquad\textbf{(D) }14\frac{2}{5}\qquad\textbf{(E) }\text{none of these} $
Find all triplets $(x,y,z)\in\mathbb{R}^3$ such that
\begin{align*}
x^2-yz &= |y-z|+1, \\
y^2-zx &= |z-x|+1, \\
z^2-xy &= |x-y|+1.
\end{align*}
Joey is playing with a $2$-by-$2$-by-$2$ Rubik’s cube made up of $ 8$ $1$-by-$1$-by-$1$ cubes (with two of these smaller cubes along each of the sides of the bigger cubes). Each face of the Rubik’s cube is distinct color. However, one day, Joey accidentally breaks the cube! He decides to put the cube back together into its solved state, placing each of the pieces one by one. However, due to the nature of the cube, he is only able to put in a cube if it is adjacent to a cube he already placed. If different orderings of the ways he chooses the cubes are considered distinct, determine the number of ways he can reassemble the cube.
If the sum of all positive divisors (including itself) of a positive integer $n$ is $2n$, then $n$ is called a perfect number. For example, the sum of the positive divisors of 6 is $1 + 2 + 3 + 6 = 2 \times 6$, hence 6 is a perfect number.
Prove: There does not exist a perfect number of the form $p^a q^b r^c$, where $a, b, c$ are positive integers, and $p, q, r$ are odd primes.
We are given a positive integer $ r$ and a rectangular board $ ABCD$ with dimensions $ AB \equal{} 20, BC \equal{} 12$. The rectangle is divided into a grid of $ 20 \times 12$ unit squares. The following moves are permitted on the board: one can move from one square to another only if the distance between the centers of the two squares is $ \sqrt {r}$. The task is to find a sequence of moves leading from the square with $ A$ as a vertex to the square with $ B$ as a vertex.
(a) Show that the task cannot be done if $ r$ is divisible by 2 or 3.
(b) Prove that the task is possible when $ r \equal{} 73$.
(c) Can the task be done when $ r \equal{} 97$?
Prove that there are infinitely many positive integers $n$ such that $\frac{5^n-1}{n+2}$ is an integer.
Determine all tuples of integers $(a,b,c)$ such that:
$$(a-b)^3(a+b)^2 = c^2 + 2(a-b) + 1$$
Triangle $\vartriangle ABC$ has side lengths $AB = 39$, $BC = 16$, and $CA = 25$. What is the volume of the solid formed by rotating $\vartriangle ABC$ about line $BC$?
For what integers $ n\ge 3$ is it possible to accommodate, in some order, the numbers $ 1,2,\cdots, n$ in a circular form such that every number divides the sum of the next two numbers, in a clockwise direction?
The vertices of $\triangle ABC$ are $A = (0,0)$, $B = (0,420)$, and $C = (560,0)$. The six faces of a die are labeled with two $A$'s, two $B$'s, and two $C$'s. Point $P_1 = (k,m)$ is chosen in the interior of $\triangle ABC$, and points $P_2$, $P_3$, $P_4, \dots$ are generated by rolling the die repeatedly and applying the rule: If the die shows label $L$, where $L \in \{A, B, C\}$, and $P_n$ is the most recently obtained point, then $P_{n + 1}$ is the midpoint of $\overline{P_n L}$. Given that $P_7 = (14,92)$, what is $k + m$?
Let $ n$ be a natural number such that $ n \equal{} a^2 \plus{} b^2 \plus{}c^2$ for some natural numbers $ a,b,c$. Prove that
\[ 9n \equal{} (p_1a\plus{}q_1b\plus{}r_1c)^2 \plus{} (p_2a\plus{}q_2b\plus{}r_2c)^2 \plus{} (p_3a\plus{}q_3b\plus{}r_3c)^2\]
where $ p_j$'s , $ q_j$'s , $ r_j$'s are all [b]nonzero[/b] integers. Further, if $ 3$ does [b]not[/b] divide at least one of $ a,b,c,$ prove that $ 9n$ can be expressed in the form $ x^2\plus{}y^2\plus{}z^2$, where $ x,y,z$ are natural numbers [b]none[/b] of which is divisible by $ 3$.
Let $ABC$ be a triangle inscribed in a circle and let
\[ l_a = \frac{m_a}{M_a} \ , \ \ l_b = \frac{m_b}{M_b} \ , \ \ l_c = \frac{m_c}{M_c} \ , \]
where $m_a$,$m_b$, $m_c$ are the lengths of the angle bisectors (internal to the triangle) and $M_a$, $M_b$, $M_c$ are the lengths of the angle bisectors extended until they meet the circle. Prove that
\[ \frac{l_a}{\sin^2 A} + \frac{l_b}{\sin^2 B} + \frac{l_c}{\sin^2 C} \geq 3 \]
and that equality holds iff $ABC$ is an equilateral triangle.
You are given $n$ different primes $p_1, p_2,..., p_n$. Consider the polynomial $$x^n + a_1x^{n -1} + a_2x^{n - 2} + ...+ a_{n - 1}x + a_n$$, where $a_i$ is the product of the first $i$ given prime numbers. For what $n$ can it have an integer root?
On the inner surface of a fixed circle, rolls a wheel half the radius of the circle, without slipping. We marked a point red on the wheel. Prove that while the wheel makes a turn, the point moves on a line.
[img]https://1.bp.blogspot.com/-PhgUWk0eU2c/X9j1gNJ7w3I/AAAAAAAAMzo/gP13TIZq7YsvNDBGVISkMQSdjwCgk_zwQCLcBGAsYHQ/s0/2014%2BDurer%2BD2.png[/img]
Find all pairs $(a, p)$ of positive integers, where $p$ is a prime, such that for any pair of positive integers $m$ and $n$ the remainder obtained when $a^{2^n}$ is divided by $p^n$ is non-zero and equals the remainder obtained when $a^{2^m}$ is divided by $p^m$.
By inserting parentheses, it is possible to give the expression
\[ 2\times3\plus{}4\times5
\]several values. How many different values can be obtained?
$ \textbf{(A)}\ 2\qquad
\textbf{(B)}\ 3\qquad
\textbf{(C)}\ 4\qquad
\textbf{(D)}\ 5\qquad
\textbf{(E)}\ 6$
Triangle $ ABC$ has $ AC \equal{} 450$ and $ BC \equal{} 300$. Points $ K$ and $ L$ are located on $ \overline{AC}$ and $ \overline{AB}$ respectively so that $ AK \equal{} CK$, and $ \overline{CL}$ is the angle bisector of angle $ C$. Let $ P$ be the point of intersection of $ \overline{BK}$ and $ \overline{CL}$, and let $ M$ be the point on line $ BK$ for which $ K$ is the midpoint of $ \overline{PM}$. If $ AM \equal{} 180$, find $ LP$.
Let $a_1,a_2,\ldots,a_n,\ldots$ be any permutation of all positive integers. Prove that there exist infinitely many positive integers $i$ such that $\gcd(a_i,a_{i+1})\leq \frac{3}{4} i$.
The SET game is a deck with $81$ unique cards that vary in four features across three possibilities for each kind of feature: shape (oval, squiggle or diamond), color (red, green or purple), number of shapes (one, two or three) and shading (solid, striped or open). A $\textbf{set}$ consists in three cards whose characteristics, when considered individually, are the same on each card or different on all of them. All features have to satisfy this rule. In other words: the shape must be the same on all three cards or different on all them, the color must be the same on the three cards or different on all them, and so on.
Ana and Bárbara divided among themselves the $81$ SET cards. Ana got $40$ cards and Bárbara got $41$. Each girl counted the number of ways she could form a three-card $\textbf{set}$ with her cards. What are the possible values of the sum of these two numbers?
A king decides to reward one of his knights by making a game. He sits the knights at a round table and has them call out $1,2,3,1,2,3,\dots$ around the circle (that is, clockwise, and each person says a number). The people who say $2$ or $3$ immediately lose, and this continues until the last knight is left, the winner.
Numbering the knights initially as $1,2,\dots,n$, find all values of $n$ such that knight $2008$ is the winner.
A light flashes in one of three different colors: red, green, and blue. Every $3$ seconds, it flashes green. Every $5$ seconds, it flashes red. Every $7$ seconds, it flashes blue. If it is supposed to flash in two colors at once, it flashes the more infrequent color. How many times has the light flashed green after $671$ seconds?
$\text{(A) }148\qquad\text{(B) }154\qquad\text{(C) }167\qquad\text{(D) }217\qquad\text{(E) }223$
Find all polynomials with real coefficients, for which the equality
\[ P(2P(x)) \equal{} 2P(P(x)) \plus{} 2(P(x))^{2}\]
holds for any real number $ x$.
We are placing $n$ integers whose sum is $94$ over a circle such that each number is equal to the absolute value of the difference of (clockwise) next two numbers. What is the largest $n$ that makes such placing possible?
$
\textbf{(A)}\ 188
\qquad\textbf{(B)}\ 186
\qquad\textbf{(C)}\ 141
\qquad\textbf{(D)}\ 100
\qquad\textbf{(E)}\ 47
$