Found problems: 85335
Let $\Gamma$ be the circumcircle of isosceles triangle $ABC$ with vertex $C$. An arbitrary point $M$ is chosen on the segment $BC$ and point $N$ lies on the ray $AM$ with $M$ between $A,N$ such that $AN=AC$. The circumcircle of $CMN$ cuts $\Gamma$ in $P$ other than $C$ and $AB,CP$ intersect at $Q$. Prove that $\angle BMQ = \angle QMN.$
In this question we re-define the operations addition and multiplication as follows: $a + b$ is defined as the minimum of $a$ and $b$, while $a * b$ is defined to be the sum of $a$ and $b$. For example, $3+4 = 3$, $3*4 = 7$, and $$3*4^2+5*4+7 = \min(\text{3 plus 4 plus 4}, \text{5 plus 4}, 7) = \min(11, 9, 7) = 7.$$
Let $a, b, c$ be real numbers. Characterize, in terms of $a, b, c$, what the graph of $y = ax^2+bx+c$ looks like.
Sabrina has a fair tetrahedral die whose faces are numbered 1, 2, 3, and 4, respectively. She creates a sequence by rolling the die and recording the number on its bottom face. However, she discards (without recording) any roll such that appending its number to the sequence would result in two consecutive terms that sum to 5. Sabrina stops the moment that all four numbers appear in the sequence. Find the expected (average) number of terms in Sabrina's sequence.
Given $a$ and $b$ distinct positive integers, show that the system of equations
$x y +zw = a$
$xz + yw = b$
has only finitely many solutions in integers $x, y, z,w$.
Let $N_0$ be the set of all non-negative integers and let $f : N_0 \times N_0 \to [0, +\infty)$ be a function such that $f(a, b) = f(b, a)$ and $$f(a, b) = f(a + 1, b) + f(a, b + 1),$$ for all $a, b \in N_0$. Denote by $x_n = f(n, 0)$ for all $n \in N_0$.
Prove that for all $n \in N_0$ the following inequality takes place $$2^n x_n \ge x_0.$$
A "domino" is made up of two small squares:
[asy]
unitsize(10);
draw((0,0) -- (2,0) -- (2,1) -- (0,1) -- cycle);
fill((0,0) -- (1,0) -- (1,1) -- (0,1) -- cycle);
[/asy]
Which of the "checkerboards" illustrated below CANNOT be covered exactly and completely by a whole number of non-overlapping dominoes?
[diagram requires in-line asy]
What is the largest possible rational root of the equation $ax^2 + bx + c = 0{}$ where $a, b$ and $c{}$ are positive integers that do not exceed $100{}$?
Let $ a,\ b$ be postive real numbers. Find $ \lim_{n\to\infty} \sum_{k\equal{}1}^n \frac{n}{(k\plus{}an)(k\plus{}bn)}.$
The angles of an acute triangle $ABC$ at $\alpha , \beta, \gamma$. Let $AD$ be a height, $CF$ a median, and $BE$ the bisector of $\angle B$. Show that $AD,CF$ and $BE$ are concurrent if and only if $\cos \gamma \tan\beta = \sin \alpha$ .
Determine the number of positive integral values of $p$ for which there exists a triangle with sides $a,b,$ and $c$ which satisfy $$a^2 + (p^2 + 9)b^2 + 9c^2 - 6ab - 6pbc = 0.$$
Let $n$ be a natural number, and suppose that the equation $$x_1x_2+x_2x_3+x_3x_4+x_4x_5+\dots +x_{n-1}x_n+x_nx_1=0$$ has a solution with all the $x_i$s equal to $\pm 1$. Prove that $n$ is divisible by $4$.
The digit in unit place of $1!+2!+\ldots+99!$ is
$\textbf{(A)}~3$
$\textbf{(B)}~0$
$\textbf{(C)}~1$
$\textbf{(D)}~7$
Find all pairs of positive integers $m, n \ge 3$ for which there exist infinitely many positive integers $a$ such that \[\frac{a^{m}+a-1}{a^{n}+a^{2}-1}\] is itself an integer.
Construct a convex polyhedron of equal “bricks” shown in Figure.
[img]https://cdn.artofproblemsolving.com/attachments/6/6/75681a90478f978665b6874d0c0c9441ea3bd2.gif[/img]
Three strictly increasing sequences
\[a_1, a_2, a_3, \ldots,\qquad b_1, b_2, b_3, \ldots,\qquad c_1, c_2, c_3, \ldots\]
of positive integers are given. Every positive integer belongs to exactly one of the three sequences. For every positive integer $n$, the following conditions hold:
(a) $c_{a_n}=b_n+1$;
(b) $a_{n+1}>b_n$;
(c) the number $c_{n+1}c_{n}-(n+1)c_{n+1}-nc_n$ is even.
Find $a_{2010}$, $b_{2010}$ and $c_{2010}$.
[i](4th Middle European Mathematical Olympiad, Team Competition, Problem 1)[/i]
Prove that there exists a set $S$ of lines in the three dimensional space satisfying the following conditions:
$i)$ For each point $P$ in the space, there exist a unique line of $S$ containing $P$.
$ii)$ There are no two lines of $S$ which are parallel.
$a,b,c,d,k,l$ are positive integers such that for every natural number $n$ the set of prime factors of $n^k+a^n+c,n^l+b^n+d$ are same. prove that $k=l,a=b,c=d$.
Let $ABC$ be a right-angled triangle with $\angle C = 90^{\circ}$, $K$, $L$, $M$ be the midpoints of sides $AB$, $BC$, $CA$ respectively, and $N$ be a point of side $AB$. The line $CN$ meets $KM$ and $KL$ at points $P$ and $Q$ respectively. Points $S$, $T$ lying on $AC$ and $BC$ respectively are such that $APQS$ and $BPQT$ are cyclic quadrilaterals. Prove that
a) if $CN$ is a bisector, then $CN$, $ML$ and $ST$ concur;
b) if $CN$ is an altitude, then $ST$ bisects $ML$.
$(NET 3)$ Let $x_1, x_2, x_3, x_4,$ and $x_5$ be positive integers satisfying
\[x_1 +x_2 +x_3 +x_4 +x_5 = 1000,\]
\[x_1 -x_2 +x_3 -x_4 +x_5 > 0,\]
\[x_1 +x_2 -x_3 +x_4 -x_5 > 0,\]
\[-x_1 +x_2 +x_3 -x_4 +x_5 > 0,\]
\[x_1 -x_2 +x_3 +x_4 -x_5 > 0,\]
\[-x_1 +x_2 -x_3 +x_4 +x_5 > 0\]
$(a)$ Find the maximum of $(x_1 + x_3)^{x_2+x_4}$
$(b)$ In how many different ways can we choose $x_1, . . . , x_5$ to obtain the desired maximum?
Determine all natural $ n$ for which there exists natural $ m$ divisible by all natural numbers from 1 to $ n$ but not divisible by any of the numbers $ n \plus{} 1$, $ n \plus{} 2$, $ n \plus{} 3$.
Compute the number of ordered triples of integers $(a,b,c)$ between $1$ and $12$, inclusive, such that, if $$q=a+\frac{1}{b}-\frac{1}{b+\frac{1}{c}},$$ then $q$ is a positive rational number and, when $q$ is written in lowest terms, the numerator is divisible by $13$.
[i]Proposed by Ankit Bisain[/i]
Do there exist $10000$ ten-digit numbers divisible by $7$, all of which can be obtained from one another by a reordering of their digits?
Let $p(z)$ be a polynomial of degree $n>0$ with complex coefficients. Prove that there are at least $n+1$ complex numbers $z$ for which $p(z)\in \{0,1\}$.
Let $P(x) = x^2 - 20x - 11$. If $a$ and $b$ are natural numbers such that $a$ is composite, $\gcd(a, b) = 1$, and $P(a) = P(b)$, compute $ab$.
Note: $\gcd(m, n)$ denotes the greatest common divisor of $m$ and $n$.
[i]Proposed by Aaron Lin
[/i]
Let pairwise different positive integers $a,b, c$ with gcd$(a,b,c) = 1$ are such that $a | (b - c)^2, b | (c- a)^2, c | (a - b)^2$. Prove, that there is no non-degenerate triangle with side lengths $a, b$ and $c$.