Found problems: 85335
A particle moves from $(0, 0)$ to $(n, n)$ directed by a fair coin. For each head it moves one step east and for each tail it moves one step north. At $(n, y), y < n$, it stays there if a head comes up and at $(x, n), x < n$, it stays there if a tail comes up. Let$ k$ be a fixed positive integer. Find the probability that the particle needs exactly $2n+k$ tosses to reach $(n, n).$
Let $ABC$ be an arbitrary triangle. A regular $n$-gon is constructed outward on the three sides of $\triangle ABC$. Find all $n$ such that the triangle formed by the three centres of the $n$-gons is equilateral.
$h_a$, $h_b$ and $h_c$ are altitudes, $t_a$, $t_b$ and $t_c$ are medians of acute triangle, $r$ radius of incircle, and $R$ radius of circumcircle of acute triangle $ABC$. Prove that $$\frac{t_a}{h_a}+\frac{t_b}{h_b}+\frac{t_c}{h_c} \leq 1+ \frac{R}{r}$$
A tetrahedron is inscribed in a sphere of radius $1$ such that the center of the sphere is inside the tetrahedron. Prove that the sum of lengths of all edges of the tetrahedron is greater than 6.
Andrea flips a fair coin repeatedly, continuing until she either flips two heads in a row (the sequence $\texttt{HH}$) or flips tails followed by heads (the sequence $\texttt{TH}$). What is the probability that she will stop after flipping $\texttt{HH}$?
We partition the $n$-element subsets of an $n^2+n-1$-element set into two classes. Prove that one of the classes contains $n$-many pairwise disjunct sets.
(translated by Miklós Maróti)
In triangle $ABC$, the altitude and the median from vertex $A$ form (together with line $BC$) a triangle such that the bisectrix of angle $A$ is the median; the altitude and the median from vertex $B$ form (together with line AC) a triangle such that the bisectrix of angle $B$ is the bisectrix. Find the ratio of sides for triangle $ABC$.
Let $n$ be a natural number. Prove that there is a multiple of $n$ that can be written only with the digits $0$ and $1$.
In a coordinate system, a circle with radius $7$ and center is on the y-axis placed inside the parabola with equation $y = x^2$ , so that it just touches the parabola in two points. Determine the coordinate set for the center of the circle.
A rectangular piece of of paper measures 4 units by 5 units. Several lines are drawn parallel to the edges of the paper. A rectangle determined by the intersections of some of these lines is called [i]basic [/i]if
(i) all four sides of the rectangle are segments of drawn line segments, and
(ii) no segments of drawn lines lie inside the rectangle.
Given that the total length of all lines drawn is exactly 2007 units, let $N$ be the maximum possible number of basic rectangles determined. Find the remainder when $N$ is divided by 1000.
Find the maximum and minimum areas of the region enclosed by the curve $y=|x|e^{|x|}$ and the line $y=a\ (0\leq a\leq e)$ at $[-1,\ 1]$.
A horse stands at the corner of a chessboard, a white square. With each jump, the horse can move either two squares horizontally and one vertically or two vertically and one horizontally (like a knight moves). The horse earns two carrots every time it lands on a black square, but it must pay a carrot in rent to rabbit who owns the chessboard for every move it makes. When the horse reaches the square on which it began, it can leave. What is the maximum number of carrots the horse can earn without touching any square more than twice?
[img]https://cdn.artofproblemsolving.com/attachments/e/c/c817d92ead6cfb3868f9cb526fb4e1fd7ffe4d.png[/img]
In triangle $ ABC$ we have $ \angle{ACB} \equal{} 2\angle{ABC}$ and there exists the point $ D$ inside the triangle such that $ AD \equal{} AC$ and $ DB \equal{} DC$. Prove that $ \angle{BAC} \equal{} 3\angle{BAD}$.
Each deputy of the Academic Duma quarreled with exactly three other deputies. The President ordered the Speaker to divide the deputies into n factions so that agreement reigned within one faction. For what smallest $n$ is this always possible? (This means that there is such $n$ that deputies could always be divided into $n$ factions, but not always into $(n- 1)$ factions.)
Let $T$ be a triangulation of a $100$-gon.We construct $P(T)$ by copying the same $100$-gon and drawing a diagonal if it was not drawn in $T$ an there is a quadrilateral with this diagonal and two other vertices so that all the sides and diagonals(Except the one we are going to draw) are present in $T$.Let $f(T)$ be the number of intersections of diagonals in $P(T)$.Find the minimum and maximum of $f(T)$.
Consider $x^2+px+q=0$ where $p$ and $q$ are positive numbers. If the roots of this equation differ by $1$, then $p$ equals
$\textbf{(A) }\sqrt{4q+1}\qquad\textbf{(B) }q-1\qquad\textbf{(C) }-\sqrt{4q+1}\qquad\textbf{(D) }q+1\qquad \textbf{(E) }\sqrt{4q-1}$
Let $N = 2^{18} \cdot 3^{19} \cdot5^{20} \cdot7^{21} \cdot 11^{22}$. Compute the number of positive integer divisors of $N$ whose units digit is $7$.
Given a regular $(6n+3)$-gon, $3n$ of its vertices are used to form $n$ acute triangles with distinct vertices. Prove that the other $3n+3$ vertices can be used to form $n+1$ acute triangles with distinct vertices.
[i]Lim Jeck[/i]
Al and Bill play a game involving a fair six-sided die. The die is rolled until either there is a number less than $5$ rolled on consecutive tosses, or there is a number greater than $4$ on consecutive tosses. Al wins if the last roll is a $5$ or $6$. Bill wins if the last roll is a $2$ or lower. Let $m$ and $n$ be relatively prime positive integers such that $m/n$ is the probability that Bill wins. Find the value of $m+n$.
Determine if it is possible to choose nine points in the plane such that there are $n=10$ lines in the plane each of which passes through exactly three of the chosen points. What if $n=11$?
Let $O_1$ be the center of a semicircle $\omega_1$ with diameter $AB$ and let $O_2$ be the center of a circle $\omega_2$ inscribed in $\omega_1$ and which is tangent to $AB$ at $O_1$. Let $O_3$ be a point on $AB$ that is the center of a semicircle $\omega_3$ which is tangent to both $\omega_1$ and $\omega_2$. Let $P$ be the intersection of the line through $O_3$ perpendicular to $AB$ and the line through $O_2$ parallel to $AB$. Show that $P$ is the center of a circle $\Gamma$ tangent to all of $\omega_1, \omega_2$ and $\omega_3$.
Let $D$ be a point inside an acute triangle $ABC$, such that $\angle BAD = \angle DBC$ and $\angle DAC = \angle BCD$. Let $P$ be a point on the circumcircle of the triangle $ADB$. Suppose $P$ are itself outside the triangle $ABC$. A line through $P$ intersects the ray $BA$ in $X$ and ray $CA$ in $Y$, so that $\angle XPB = \angle PDB$. Show that $BY$ and $CX$ intersect on $AD$.
Prove that the equation $m!n! = k!$ has infinitely many solutions in which $m, n$ and $k$ are natural numbers greater than unity .
Show that given any $n+1$ diagonals of a convex $n$-gon, one can always find two which have no common point.
Define the sequence $x_1, x_2, ...$ inductively by $x_1 = \sqrt{5}$ and $x_{n+1} = x_n^2 - 2$ for each $n \geq 1$. Compute
$\lim_{n \to \infty} \frac{x_1 \cdot x_2 \cdot x_3 \cdot ... \cdot x_n}{x_{n+1}}$.