Found problems: 85335
One fair die has faces $ 1$, $ 1$, $ 2$, $ 2$, $ 3$, $ 3$ and another has faces $ 4$, $ 4$, $ 5$, $ 5$, $ 6$, $ 6$. The dice are rolled and the numbers on the top faces are added. What is the probability that the sum will be odd?
$ \textbf{(A)}\ \frac{1}{3}\qquad
\textbf{(B)}\ \frac{4}{9}\qquad
\textbf{(C)}\ \frac{1}{2}\qquad
\textbf{(D)}\ \frac{5}{9}\qquad
\textbf{(E)}\ \frac{2}{3}$
Determine all real numbers $a$ and $b$ such that $a+b\in\mathbb{Z}$ and $a^2+b^2=2$.
Given real numbers $(a_i)$ and $(b_i)$ (for $i=1,2,3,4$) such that $a_1 b _2 \ne a_2 b_1 .$ Consider the set of all solutions $(x_1 ,x_2 ,x_3 , x_4)$ of the simultaneous equations
$$ a_1 x_1 +a _2 x_2 +a_3 x_3 +a_4 x_4 =0 \;\; \text{and}\;\; b_1 x_1 +b_2 x_2 +b_3 x_3 +b_4 x_4 =0 $$
for which no $x_i$ is zero. Each such solution generates a $4$-tuple of plus and minus signs (by considering the sign of $x_i$).
[list=a]
[*] Determine, with proof, the maximum number of distinct $4$-tuples possible.
[*] Investigate necessary and sufficient conditions on $(a_i)$ and $(b_i)$ such that the above maximum of distinct $4$-tuples is attained.
Rational Man and Irrational Man both buy new cars, and they decide to drive around two racetracks from time $t=0$ to time $t=\infty$. Rational Man drives along the path parametrized by \begin{align*}x&=\cos(t)\\y&=\sin(t)\end{align*} and Irrational Man drives along the path parametrized by \begin{align*}x&=1+4\cos\frac{t}{\sqrt{2}}\\ y&=2\sin\frac{t}{\sqrt{2}}.\end{align*} Find the largest real number $d$ such that at any time $t$, the distance between Rational Man and Irrational Man is not less than $d$.
Given a convex quadrilateral $ABCD$, such that $OA = \frac{OB \cdot OD}{OC + CD}$ where $O$ is the intersection of the two diagonals. The circumcircle of triangle $ABC$ intersects $BD$ at point $Q$. Prove that $CQ$ bisects $\angle ACD$
Bisectors of angle $C$ and externalangle $A$ of trapezoid $ABCD$ with bases $BC$ and $AD$ intersect at point $M$, and the bisector of angle $B$ and external angle $D$ intersect at point $N$. Prove that the midpoint of the segment $MN$ is equidistant from the lines $AB$ and $CD$.
The function $f(x)$ has the property that, for some real positive constant $C$, the expression \[\frac{f^{(n)}(x)}{n+x+C}\] is independent of $n$ for all nonnegative integers $n$, provided that $n+x+C\neq 0$. Given that $f'(0)=1$ and $\int_{0}^{1}f(x) \, dx = C+(e-2)$, determine the value of $C$.
Note: $f^{(n)}(x)$ is the $n$-th derivative of $f(x)$, and $f^{(0)}(x)$ is defined to be $f(x)$.
J has $98$ cheetahs in his pants, some of which are male and the rest of which are female. He realizes that three times the number of male cheetahs in his pants is equal to nine more than twice the number of female cheetahs. How many male cheetahs are in his pants?
Ted is fi ve times as old as Rosie was when Ted was Rosie's age. When Rosie reaches Ted's current age, the sum of their ages will be $72$. Find Ted's current age.
If all edges of a non-planar quadrilateral tangent the faces of a sphere, prove that all of the points of tangency belong to a plane.
An object is thrown with a fixed initial speed $v_\text{0}$ at various angles $\alpha$ relative to the horizon. At some constant height $h$ above the launch point the speed $v$ of the object is measured as a function of the initial angle $\alpha$. Which of the following best describes the dependence of $v$ on $\alpha$? (Assume that the height h is achieved, and assume that there is no air resistance.)
(A) $v$ will increase monotonically with $\alpha$.
(B) $v$ will increase to some critical value $v_{max}$ and then decrease.
(C) $v$ will remain constant, independent of $\alpha$.
(D) $v$ will decrease to some critical value $v_{min}$ and then increase.
(E) None of the above.
Find all functions $f:\mathbb{R}\to\mathbb{R}$ which satisfy for all $x$:
$(i)$ $f(x)=-f(-x);$
$(ii)$ $f(x+1)=f(x)+1;$
$(iii)$ $f\left( \frac{1}{x}\right)=\frac{1}{x^2}f(x)$ for $x\ne 0$
Prove that $1^{2011}+2^{2011}+3^{2011}+...+2012^{2011} $ is divisible by $2025078$.
For every non-negative integer $n$ , let $s_n$ be the sum of digits in the decimal expansion of $2^n$. Is the sequence $(s_n)_{n \in \mathbb{N}}$ eventually increasing ?
A polynomial product of the form \[(1-z)^{b_1}(1-z^2)^{b_2}(1-z^3)^{b_3}(1-z^4)^{b_4}(1-z^5)^{b_5}\cdots(1-z^{32})^{b_{32}},\] where the $b_k$ are positive integers, has the surprising property that if we multiply it out and discard all terms involving $z$ to a power larger than $32$, what is left is just $1-2z$. Determine, with proof, $b_{32}$.
Call a positive integer $N \ge 2$ ``special'' if for every $k$ such that $2 \leq k \leq N$, $N$ can be expressed as a sum of $k$ positive integers that are relatively prime to $N$ (although not necessarily relatively prime to each other). How many special integers are there less than $100$?
Find all pairs of integers $a$ and $b$ for which
\[7a+14b=5a^2+5ab+5b^2\]
What is the maximum number of subsets, having property that none of them is a subset of another, can a set with 10 elements have?
$\textbf{(A)}\ 126 \qquad\textbf{(B)}\ 210 \qquad\textbf{(C)}\ 252 \qquad\textbf{(D)}\ 420 \qquad\textbf{(E)}\ 1024$
Let $n$ be a positive integer. Two players, Alice and Bob, are playing the following game:
- Alice chooses $n$ real numbers; not necessarily distinct.
- Alice writes all pairwise sums on a sheet of paper and gives it to Bob. (There are $\frac{n(n-1)}{2}$ such sums; not necessarily distinct.)
- Bob wins if he finds correctly the initial $n$ numbers chosen by Alice with only one guess.
Can Bob be sure to win for the following cases?
a. $n=5$
b. $n=6$
c. $n=8$
Justify your answer(s).
[For example, when $n=4$, Alice may choose the numbers 1, 5, 7, 9, which have the same pairwise sums as the numbers 2, 4, 6, 10, and hence Bob cannot be sure to win.]
Let $ABCD$ be a square with unit sides. Which interior point $P$ will the expression $\sqrt2 \cdot AP + BP + CP$ have a minimum value, and what is this minimum?
$ ABC$ and $ A'B'C'$ are two triangles in the same plane such that the lines $ AA',BB',CC'$ are mutually parallel. Let $ [ABC]$ denotes the area of triangle $ ABC$ with an appropriate $ \pm$ sign, etc.; prove that
\[ 3([ABC] \plus{} [A'B'C']) \equal{} [AB'C'] \plus{} [BC'A'] \plus{} [CA'B'] \plus{} [A'BC] \plus{} [B'CA] \plus{} [C'AB].\]
Given a positive integer $k$ and an integer $a\equiv 3 \pmod{8}$, show that $a^m+a+2$ is divisible by $2^k$ for some positive integer $m$.
Let $p$ be an odd prime number, and $k$ be an odd number not divisible by $p$. Consider a field $K$ be a field with $kp+1$ elements, and $A = \{x_1,x_2, \dots, x_t\}$ be the set of elements of $K^*$, whose order is not $k$ in the multiplicative group $(K^*,\cdot)$. Prove that the polynomial $P(X)=(X+x_1)(X+x_2)\dots(X+x_t)$ has at least $p$ coefficients equal to $1$.
Find all functions $f,g:\mathbb{R}^2\to\mathbb{R}$ satisfying that
\[|f(a,b)-f(c,d)|+|g(a,b)-g(c,d)|=|a-c|+|b-d|\]
for all real numbers $a,b,c,d$.
[i]Proposed by usjl[/i]
A six dimensional "cube" (a $6$-cube) has $64$ vertices at the points $(\pm 3,\pm 3,\pm 3,\pm 3,\pm 3,\pm 3).$ This $6$-cube has $192\text{ 1-D}$ edges and $240\text{ 2-D}$ edges. This $6$-cube gets cut into $6^6=46656$ smaller congruent "unit" $6$-cubes that are kept together in the tightly packaged form of the original $6$-cube so that the $46656$ smaller $6$-cubes share 2-D square faces with neighbors ($\textit{one}$ 2-D square face shared by $\textit{several}$ unit $6$-cube neighbors). How many 2-D squares are faces of one or more of the unit $6$-cubes?