This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 85335

Find all functions from $\mathbb{N}\cup\{0\}\to\mathbb{N}\cup\{0\}$ such that $f(m^2+mf(n))=mf(m+n)$, for all $m,n\in \mathbb{N}\cup\{0\}$.
Let $ABCD$ be a convex quadrilateral with $AB = BD = 8$ and $CD = DA = 6$. Let $P$ be a point on side $AB$ such that $DP$ is bisector of angle $\angle ADB$ and let $Q$ be a point on side $BC$ such that $DQ$ is bisector of angle $\angle CDB$. Calculate the radius of the circumcircle of triangle $DPQ$. Note: The circumcircle of a triangle is the circle that passes through its three vertices.
Let $n \ge 2$ be an integer, and let $O$ be the $n \times n$ matrix whose entries are all equal to $0$. Two distinct entries of the matrix are chosen uniformly at random, and those two entries are changed from $0$ to $1$. Call the resulting matrix $A$. Determine the probability that $A^2 = O$, as a function of $n$.
A $8 \times 8$ board is given, with sides directed north-south and east-west. It is divided into $1 \times 1$ cells in the usual manner. In each cell, there is most one [i]house[/i]. A house occupies only one cell. A house is [i] in the shade[/i] if there is a house in each of the cells in the south, east and west sides of its cell. In particular, no house placed on the south, east or west side of the board is in the shade. Find the maximal number of houses that can be placed on the board such that no house is in the shade.
Find all functions $f :[0, +\infty) \rightarrow [0, +\infty)$ for which $f(f(x)+f(y)) = xy f (x+y)$ for every two non-negative real numbers $x$ and $y$.
In triangle $ABC$ there are points $D\in(AC)$ and $F\in(AB)$ such that $AD=AB$ and line $BC$ splits the segment $[CF]$ in half. Prove that $BF=CD$.
Find the smallest positive three-digit integer $n$ such that $3^n+4^n$ is divisible by $5$.
Let $\Omega$ and $\omega$ be circles with radii $123$ and $61$, respectively, such that the center of $\Omega$ lies on $\omega$. A chord of $\Omega$ is cut by $\omega$ into three segments, whose lengths are in the ratio $1 : 2 : 3$ in that order. Given that this chord is not a diameter of $\Omega$, compute the length of this chord.
The ratio of boys to girls in Mr. Brown's math class is $ 2: 3$. If there are $ 30$ students in the class, how many more girls than boys are in the class? \[ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 10 \]
Together, Kenneth and Ellen pick a real number $a$. Kenneth subtracts $a$ from every thousandth root of unity (that is, the thousand complex numbers $\omega$ for which $\omega^{1000}=1$) then inverts each, then sums the results. Ellen inverts every thousandth root of unity, then subtracts $a$ from each, and then sums the results. They are surprised to find that they actually got the same answer! How many possible values of $a$ are there?
$ C$ and $ D$ are points on a semicircle. The tangent at $ C$ meets the extended diameter of the semicircle at $ B$, and the tangent at $ D$ meets it at $ A$, so that $ A$ and $ B$ are on opposite sides of the center. The lines $ AC$ and $ BD$ meet at $ E$. $ F$ is the foot of the perpendicular from $ E$ to $ AB$. Show that $ EF$ bisects angle $ CFD$
Let $\vartriangle ABC$ be a triangle with $G$ as its centroid, which is the intersection of the three medians of the triangle, as shown in the diagram. If $\overline{GA} \perp \overline{GB}$ and $AB = 7$, compute $AC^2 + BC^2$. [img]https://cdn.artofproblemsolving.com/attachments/e/1/240be132c6adcfde0334a000e1f916a6292907.png[/img]
Two disjoint circles $\omega_1$ and $\omega_2$ are inscribed into an angle. Consider all pairs of parallel lines $l_1$ and $l_2$ such that $l_1$ touches $\omega_1$ and $l_2$ touches $\omega_2$ ($\omega_1$, $\omega_2$ lie between $l_1$ and $l_2$). Prove that the medial lines of all trapezoids formed by $l_1$ and $l_2$ and the sides of the angle touch some fixed circle.
Find all integer numbers $a,b,c$ such that $\frac{(a+b)(b+c)(c+a)}{2}+(a+b+c)^{3}=1-abc$.
In the plane, $\Gamma$ is a circle with centre $O$ and radius $r, P$ and $Q$ are distinct points on $\Gamma , A$ is a point outside $\Gamma , M$ and $N$ are the midpoints of $PQ$ and $AO$ respectively. Suppose$ OA = 2a$ and $\angle PAQ$ is a right angle. Find the length of $MN$ in terms of $r$ and $a$. Express your answer in its simplest form, and justify your answer.
Let $k$ be the circle inscribed in convex quadrilateral $ABCD$. Lines $AD$ and $BC$ meet at $P$ ,and circumcircles of $\triangle PAB$ and $\triangle PCD$ meet in $X$ . Prove that tangents from $X$ to $k$ form equal angles with lines $AX$ and $CX$ .
Compute \[ \frac{(10^4+324)(22^4+324)(34^4+324)(46^4+324)(58^4+324)}{(4^4+324)(16^4+324)(28^4+324)(40^4+324)(52^4+324)}. \]
Let $n$ be a positive integer. A German set in an $n \times n$ square grid is a set of $n$ cells which contains exactly one cell in each row and column. Given a labelling of thecells with the integers from $1$ to $n^2$ using each integer exactly once, we say that an integer is a German product if it is the product of the labels of the cells in a German set. (a) Let $n=8$. Determine whether there exists a labelling of an $8 \times 8$ grid such that the following condition is fulfilled: The difference of any two German products is alwaysdivisible by $65$. (b) Let $n=10$. Determine whether there exists a labelling of a $10 \times 10$ grid such that the following condition is fulfilled: The difference of any two German products is always divisible by $101$.
The incircle of a triangle $ABC$ touches the sides $BC,CA,AB$ at points $D,E,F$, respectively. Let $X$ be a point on the incircle, different from the points $D,E,F$. The lines $XD$ and $EF,XE$ and $FD,XF$ and $DE$ meet at points $J,K,L$, respectively. Let further $M,N,P$ be points on the sides $BC,CA,AB$, respectively, such that the lines $AM,BN,CP$ are concurrent. Prove that the lines $JM,KN$ and $LP$ are concurrent. [i]Dinu Serbanescu[/i]
Prove that for any integer $n\ge 6$ we can divide an equilateral triangle completely into $n$ smaller equilateral triangles.
[u]Round 5 [/u] [b]p13.[/b] How many ways can we form a group with an odd number of members (plural) from $99$ people? Express your answer in the form $a^b + c$, where $a, b$, and $c$ are integers and $a$ is prime. [b]p14.[/b] A cube is inscibed in a right circular cone such that the ratio of the height of the cone to the radius is $2:1$. Compute the fraction of the cone’s volume that the cube occupies. [b]p15.[/b] Let $F_0 = 1$, $F_1 = 1$ and $F_k = F_{k-1} + F_{k-2}$. Let $P(x) = \sum^{99}_{k=0} x^{F_k}$ . The remainder when $P(x)$ is divided by $x^3 - 1$ can be expressed as $ax^2 + bx + c$. Find $2a + b$. [u]Round 6 [/u] [b]p16.[/b] Ankit finds a quite peculiar deck of cards in that each card has n distinct symbols on it and any two cards chosen from the deck will have exactly one symbol in common. The cards are guaranteed to not have a certain symbol which is held in common with all the cards. Ankit decides to create a function f(n) which describes the maximum possible number of cards in a set given the previous constraints. What is the value of $f(10)$? [b]p17.[/b] If $|x| <\frac14$ and $$X = \sum^{\infty}_{N=0} \sum^{N}_{n=0} {N \choose n}x^{2n}(2x)^{N-n}.$$ then write $X$ in terms of $x$ without any summation or product symbols (and without an infinite number of ‘$+$’s, etc.). [b]p18.[/b] Dietrich is playing a game where he is given three numbers $a, b, c$ which range from $[0, 3]$ in a continuous uniform distribution. Dietrich wins the game if the maximum distance between any two numbers is no more than $1$. What is the probability Dietrich wins the game? [u]Round 7 [/u] [b]p19.[/b] Consider f defined by $$f(x) = x^6 + a_1x^5 + a_2x^4 + a_3x^3 + a_4x^2 + a_5x + a_6.$$ How many tuples of positive integers $(a_1, a_2, a_3, a_4, a_5, a_6)$ exist such that $f(-1) = 12$ and $f(1) = 30$? [b]p20.[/b] Let $a_n$ be the number of permutations of the numbers $S = \{1, 2, ... , n\}$ such that for all $k$ with $1 \le k \le n$, the sum of $k$ and the number in the $k$th position of the permutation is a power of $2$. Compute $a_1 + a_2 + a_4 + a_8 + ... + a_{1048576}$. [b]p21.[/b] A $4$-dimensional hypercube of edge length $1$ is constructed in $4$-space with its edges parallel to the coordinate axes and one vertex at the origin. Its coordinates are given by all possible permutations of $(0, 0, 0, 0)$,$(1, 0, 0, 0)$,$(1, 1, 0, 0)$,$(1, 1, 1, 0)$, and $(1, 1, 1, 1)$. The $3$-dimensional hyperplane given by $x+y+z+w = 2$ intersects the hypercube at $6$ of its vertices. Compute the 3-dimensional volume of the solid formed by the intersection. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2781335p24424563]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].
Let $a,b,c$ be real numbers for which $a+b+c+d=19$ and $a^2+b^2+c^2+d^2=91$. Find the maximal value of $\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}$.
A two digit prime number is such that the sum of its digits is $13.$ Determine the integer.
Points $A_1$, $A_2$, $A_3$, $A_4$ are the vertices of a regular tetrahedron of edge length $1$. The points $B_1$ and $B_2$ lie inside the figure bounded by the plane $A_1A_2A_3$ and the spheres of radius $1$ and centres $A_1$, $A_2$, $A_3$. Prove that $B_1B_2 < \max\{B_1A_1, B_1A_2, B_1A_3, B_1A_4\}$. [i] A. Kupavsky [/i]