Found problems: 85335
The fields of an $n\times n$ chess board are colored black and white, such that in every small $2\times 2$-square both colors should be the same number. How many there possibilities are for this?
Let $n$ be an odd positive integer. Show that the equation
$$ \frac{4}{n} =\frac{1}{x} + \frac{1}{y}$$
has a solution in the positive integers if and only if $n$ has a divisor of the form $4k+3$.
The game of rock-scissors is played just like rock-paper-scissors, except that neither player is allowed to play paper. You play against a poorly-designed computer program that plays rock with $50\%$ probability and scissors with $50\%$ probability. If you play optimally against the computer, find the probability that after $8$ games you have won at least $4$.
[i]In the game of rock-paper-scissors, two players each choose one of rock, paper, or scissors to play. Rock beats scissors, scissors beats paper, and paper beats rock. If the players play the same thing, the match is considered a draw.[/i]
Compute the largest integer not exceeding $$\frac{2549^3}{2547\cdot 2548} -\frac{2547^3}{2548\cdot 2549}$$
Which is the largest four-digit number that has all four of its digits among its divisors and its digits are all different?
Determine $ \gcd (n^2\plus{}2,n^3\plus{}1)$ for $ n\equal{}9^{753}$.
Let $a,b,c,d$ real numbers such that $a+b+c+d=19$ and $a^2+b^2+c^2+d^2=91$. Find the maximum value of
\[ \frac{1}{a} +\frac{1}{b} +\frac{1}{c} +\frac{1}{d} \]
Let $P(n)$ denote the product of digits of $n$. Find the number of positive integers $n \leq 2024$ where $P(n)$ is divisible by $n$.
Let $n = 2^8 \cdot 3^9 \cdot 5^{10} \cdot 7^{11}$.
For $k$ a positive integer, let $f(k)$ be the number of integers $0 \le x < n$ such that $x^2 \equiv k^2$ (mod $n$).
Compute the number of positive integers k such that $k | f(k)$.
a) Find the minimal value of the polynomial $$P(x,y) = 4 + x^2y^4 + x^4y^2 - 3x^2y^2$$
b) Prove that it cannot be represented as a sum of the squares of some polynomials of $x,y$.
A domino is a $1 \times 2$ (or 2 $\times 1$) rectangular piece; namely, made up of two squares. There is an $8 \times 8$ board such that each domino can be cover exactly two of its squares. John places $n$ dominoes on the board, so that each one covers exactly two squares of the board and it is no longer possible to place a piece more without overlapping with any of those already placed. Determine the smallest value of $n$ for which the described situation is possible.
The sides of a right triangle are $ a$ and $ b$ and the hypotenuse is $ c$. A perpendicular from the vertex divides $ c$ into segments $ r$ and $ s$, adjacent respectively to $ a$ and $ b$. If $ a : b \equal{} 1 : 3$, then the ratio of $ r$ to $ s$ is:
$ \textbf{(A)}\ 1 : 3\qquad
\textbf{(B)}\ 1 : 9\qquad
\textbf{(C)}\ 1 : 10\qquad
\textbf{(D)}\ 3 : 10\qquad
\textbf{(E)}\ 1 : \sqrt{10}$
The figure shows a network of roads bounding $12$ blocks. Person $P$ goes from $A$ to $B,$ and person $Q$ goes from $B$ to $A,$ each going by a shortest path (along roads). The persons start simultaneously and go at the same constant speed. At each point with two possible directions to take, both have the same probability. Find the probability that the persons meet.
[asy]
import graph; size(150); real lsf = 0.5; pen dp = linewidth(0.7) + fontsize(10); defaultpen(dp); pen ds = black;
draw((0,3)--(4,3),linewidth(1.2pt)); draw((4,3)--(4,0),linewidth(1.2pt)); draw((4,0)--(0,0),linewidth(1.2pt)); draw((0,0)--(0,3),linewidth(1.2pt)); draw((1,3)--(1,0),linewidth(1.2pt)); draw((2,3)--(2,0),linewidth(1.2pt)); draw((3,3)--(3,0),linewidth(1.2pt)); draw((0,1)--(4,1),linewidth(1.2pt)); draw((4,2)--(0,2),linewidth(1.2pt));
dot((0,0),ds); label("$A$", (-0.3,-0.36),NE*lsf); dot((4,3),ds); label("$B$", (4.16,3.1),NE*lsf); clip((-4.3,-10.94)--(-4.3,6.3)--(16.18,6.3)--(16.18,-10.94)--cycle);
[/asy]
The real numbers $a,b,c$ satisfy the condition:
for all $x$, such that for $ -1 \le x \le 1$, the inequality $$| ax^2 + bx + c | \le 1$$ is held. Prove that for the same $x$ , $$| cx^2 + bx + a | \le 2$$
A very well known family of mathematicians has three children called [i]Antonia, Bernhard[/i] and [i]Christian[/i]. Each evening one of the children has to do the dishes. One day, their dad decided to construct of plan that says which child has to do the dishes at which day for the following $55$ days.
Let $x$ be the number of possible such plans in which Antonia has to do the dishes on three consecutive days at least once. Furthermore, let $y$ be the number of such plans in which there are three consecutive days in which Antonia does the dishes on the first, Bernhard on the second and Christian on the third day.
Determine, whether $x$ and $y$ are different and if so, then decide which of those is larger.
Prove that for any positive integers $k$ and $N$, \[\left(\frac{1}{N}\sum\limits_{n=1}^{N}(\omega (n))^k\right)^{\frac{1}{k}}\leq k+\sum\limits_{q\leq N}\frac{1}{q},\] where $\sum\limits_{q\leq N}\frac{1}{q}$ is the summation over of prime powers $q\leq N$ (including $q=1$).
Note: For integer $n>1$, $\omega (n)$ denotes number of distinct prime factors of $n$, and $\omega (1)=0$.
The denominators of two irreducible fractions are 600 and 700. Find the minimum value of the denominator of their sum (written as an irreducible fraction).
The sides of a triangle have lengths of $ 15$, $ 20$, and $ 25$. Find the length of the shortest altitude.
$ \text{(A)}\ 6 \qquad
\text{(B)}\ 12 \qquad
\text{(C)}\ 12.5 \qquad
\text{(D)}\ 13 \qquad
\text{(E)}\ 15$
Let $M_n=\{(u,v) \in S^n \times S^n: u \cdot v=0\}$, where $n \ge 2$, and $u \cdot v$ is the Euclidean inner product of $u$ and $v$. Suppose that the topology of $M_n$ is induces from $S^n \times S^n$.
(1) Prove that $M_n$ is a connected regular submanifold of $S^n \times S^n$.
(2) $M_n$ is Lie Group if and only if $n=2$.
A rectangle has integer side lengths and an area of $2024$. What is the least possible perimeter of the rectangle?
$
\textbf{(A) }160 \qquad
\textbf{(B) }180 \qquad
\textbf{(C) }222 \qquad
\textbf{(D) }228 \qquad
\textbf{(E) }390 \qquad
$
Find the number of integers $n$ with $n \ge 2$ such that the remainder when $2013$ is divided by $n$ is equal to the remainder when $n$ is divided by $3$.
[i]Proposed by Michael Kural[/i]
For $ a_i \in \mathbb{Z}^ \plus{}$, $ i \equal{} 1, \ldots, k$, and $ n \equal{} \sum^k_{i \equal{} 1} a_i$, let $ d \equal{} \gcd(a_1, \ldots, a_k)$ denote the greatest common divisor of $ a_1, \ldots, a_k$.
Prove that $ \frac {d} {n} \cdot \frac {n!}{\prod\limits^k_{i \equal{} 1} (a_i!)}$ is an integer.
[i]Dan Schwarz, Romania[/i]
Find the largest positive constant $C$ such that the following is satisfied: Given $n$ arcs (containing their endpoints) $A_1,A_2,\ldots ,A_n$ on the circumference of a circle, where among all sets of three arcs $(A_i,A_j,A_k)$ $(1\le i< j< k\le n)$, at least half of them has $A_i\cap A_j\cap A_k$ nonempty, then there exists $l>Cn$, such that we can choose $l$ arcs among $A_1,A_2,\ldots ,A_n$, whose intersection is nonempty.
Let $ABC$ be a triangle with $\angle BAC=60^\circ$. Consider a point $P$ inside the triangle having $PA=1$, $PB=2$ and $PC=3$. Find the maximum possible area of the triangle $ABC$.
Let $L_1, L_2, L_3, L_4$ be four lines in the space such that no three of them are in the same plane. Let $L_1, L_2$ intersect in $A$, $L_2,L_3$ intersect in $B$ and $L_3, L_4$ intersect in $C.$ Find minimum and maximum number of lines in the space that intersect $L_1, L_2, L_3$ and $L_4.$ Justify your answer.