Found problems: 43
2004 Germany Team Selection Test, 2
Find all functions $f: \Bbb{R}_{0}^{+}\rightarrow \Bbb{R}_{0}^{+}$ with the following properties:
(a) We have $f\left( xf\left( y\right) \right) \cdot f\left( y\right) =f\left( x+y\right)$ for all $x$ and $y$.
(b) We have $f\left(2\right) = 0$.
(c) For every $x$ with $0 < x < 2$, the value $f\left(x\right)$ doesn't equal $0$.
[b]NOTE.[/b] We denote by $\Bbb{R}_{0}^{+}$ the set of all non-negative real numbers.
2009 Germany Team Selection Test, 3
Find all functions $ f: \mathbb{R} \mapsto \mathbb{R}$ such that $ \forall x,y,z \in \mathbb{R}$ we have: If
\[ x^3 \plus{} f(y) \cdot x \plus{} f(z) \equal{} 0,\]
then
\[ f(x)^3 \plus{} y \cdot f(x) \plus{} z \equal{} 0.\]
2015 Bundeswettbewerb Mathematik Germany, 4
Many people use the social network "BWM". It is known that: By choosing any four people of that network there always is one that is a friend of the other three.
Is it then true that by choosing any four people there always is one that is a friend of everyone in "BWM"?
[b]Note:[/b] If member $A$ is a friend of member $B$, then member $B$ also is a friend of member $A$.
2009 Germany Team Selection Test, 3
Find all functions $ f: \mathbb{R} \mapsto \mathbb{R}$ such that $ \forall x,y,z \in \mathbb{R}$ we have: If
\[ x^3 \plus{} f(y) \cdot x \plus{} f(z) \equal{} 0,\]
then
\[ f(x)^3 \plus{} y \cdot f(x) \plus{} z \equal{} 0.\]
2005 Germany Team Selection Test, 2
Let $ n$ be a positive integer such that $ n\geq 3$. Let $ a_1$, $ a_2$, ..., $ a_n$ and $ b_1$, $ b_2$, ..., $ b_n$ be $ 2n$ positive real numbers satisfying the equations
\[ a_1 \plus{} a_2 \plus{} ... \plus{} a_n \equal{} 1, \quad \text{and} \quad b_1^2 \plus{} b_2^2 \plus{} ... \plus{} b_n^2 \equal{} 1.\]
Prove the inequality
\[a_1\left(b_1 \plus{} a_2\right) \plus{} a_2\left(b_2 \plus{} a_3\right) \plus{} ... \plus{} a_{n \minus{} 1}\left(b_{n \minus{} 1} \plus{} a_n\right) \plus{} a_n\left(b_n \plus{} a_1\right) < 1.\]
2004 Germany Team Selection Test, 1
A function $f$ satisfies the equation
\[f\left(x\right)+f\left(1-\frac{1}{x}\right)=1+x\]
for every real number $x$ except for $x = 0$ and $x = 1$. Find a closed formula for $f$.
2017 Germany, Landesrunde - Grade 11/12, 1
Solve the equation \[ x^5+x^4+x^3+x^2=x+1 \] in $\mathbb{R}$.
2016 German National Olympiad, 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.
2005 Germany Team Selection Test, 2
Let $ n$ be a positive integer such that $ n\geq 3$. Let $ a_1$, $ a_2$, ..., $ a_n$ and $ b_1$, $ b_2$, ..., $ b_n$ be $ 2n$ positive real numbers satisfying the equations
\[ a_1 \plus{} a_2 \plus{} ... \plus{} a_n \equal{} 1, \quad \text{and} \quad b_1^2 \plus{} b_2^2 \plus{} ... \plus{} b_n^2 \equal{} 1.\]
Prove the inequality
\[a_1\left(b_1 \plus{} a_2\right) \plus{} a_2\left(b_2 \plus{} a_3\right) \plus{} ... \plus{} a_{n \minus{} 1}\left(b_{n \minus{} 1} \plus{} a_n\right) \plus{} a_n\left(b_n \plus{} a_1\right) < 1.\]
2005 Germany Team Selection Test, 2
Let $M$ be a set of points in the Cartesian plane, and let $\left(S\right)$ be a set of segments (whose endpoints not necessarily have to belong to $M$) such that one can walk from any point of $M$ to any other point of $M$ by travelling along segments which are in $\left(S\right)$. Find the smallest total length of the segments of $\left(S\right)$ in the cases
[b]a.)[/b] $M = \left\{\left(-1,0\right),\left(0,0\right),\left(1,0\right),\left(0,-1\right),\left(0,1\right)\right\}$.
[b]b.)[/b] $M = \left\{\left(-1,-1\right),\left(-1,0\right),\left(-1,1\right),\left(0,-1\right),\left(0,0\right),\left(0,1\right),\left(1,-1\right),\left(1,0\right),\left(1,1\right)\right\}$.
In other words, find the Steiner trees of the set $M$ in the above two cases.
2004 Germany Team Selection Test, 2
In a triangle $ABC$, let $D$ be the midpoint of the side $BC$, and let $E$ be a point on the side $AC$. The lines $BE$ and $AD$ meet at a point $F$.
Prove: If $\frac{BF}{FE}=\frac{BC}{AB}+1$, then the line $BE$ bisects the angle $ABC$.
2004 Germany Team Selection Test, 4
Let the positive integers $x_1$, $x_2$, $...$, $x_{100}$ satisfy the equation
\[\frac{1}{\sqrt{x_1}}+\frac{1}{\sqrt{x_2}}+...+\frac{1}{\sqrt{x_{100}}}=20.\]
Show that at least two of these integers are equal to each other.
2016 Bundeswettbewerb Mathematik, 1
A number with $2016$ zeros that is written as $101010 \dots 0101$ is given, in which the zeros and ones alternate. Prove that this number is not prime.
2022 Bundeswettbewerb Mathematik, 2
Eva draws an equilateral triangle and its altitudes. In a first step she draws the center triangle of the equilateral triangle, in a second step the center triangle of this center triangle and so on.
After each step Eva counts all triangles whose sides lie completely on drawn lines. What is the minimum number of center triangles she must have drawn so that the figure contains more than 2022 such triangles?
2017 Bundeswettbewerb Mathematik, 3
Let $M$ be the incenter of the tangential quadrilateral $A_1A_2A_3A_4$. Let line $g_1$ through $A_1$ be perpendicular to $A_1M$; define $g_2,g_3$ and $g_4$ similarly. The lines $g_1,g_2,g_3$ and $g_4$ define another quadrilateral $B_1B_2B_3B_4$ having $B_1$ be the intersection of $g_1$ and $g_2$; similarly $B_2,B_3$ and $B_4$ are intersections of $g_2$ and $g_3$, $g_3$ and $g_4$, resp. $g_4$ and $g_1$.
Prove that the diagonals of quadrilateral $B_1B_2B_3B_4$ intersect in point $M$.
[asy]
import graph; size(15cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-9.773972777861085,xmax=12.231603726660566,ymin=-3.9255487671791487,ymax=7.37238601960895;
pair M=(2.,2.), A_4=(-1.6391623316400197,1.2875505916864178), A_1=(3.068893183992864,-0.5728665455336459), A_2=(4.30385937824148,2.2922812065339455), A_3=(2.221541124684679,4.978916319940133), B_4=(-0.9482172571022687,-2.24176848577888), B_1=(4.5873184669543345,0.057960746374459436), B_2=(3.9796042717514277,4.848169684238838), B_3=(-2.4295496490492385,5.324816563638236);
draw(circle(M,2.),linewidth(0.8)); draw(A_4--A_1,linewidth(0.8)); draw(A_1--A_2,linewidth(0.8)); draw(A_2--A_3,linewidth(0.8)); draw(A_3--A_4,linewidth(0.8)); draw(M--A_3,linewidth(0.8)+dotted); draw(M--A_2,linewidth(0.8)+dotted); draw(M--A_1,linewidth(0.8)+dotted); draw(M--A_4,linewidth(0.8)+dotted); draw((xmin,-0.07436970390935019*xmin+5.144131675605378)--(xmax,-0.07436970390935019*xmax+5.144131675605378),linewidth(0.8)); draw((xmin,-7.882338401302275*xmin+36.2167572574517)--(xmax,-7.882338401302275*xmax+36.2167572574517),linewidth(0.8)); draw((xmin,0.4154483588930812*xmin-1.847833182441644)--(xmax,0.4154483588930812*xmax-1.847833182441644),linewidth(0.8)); draw((xmin,-5.107958950031516*xmin-7.085223310768749)--(xmax,-5.107958950031516*xmax-7.085223310768749),linewidth(0.8));
dot(M,linewidth(3.pt)+ds); label("$M$",(2.0593440948136896,2.0872038897020024),NE*lsf); dot(A_4,linewidth(3.pt)+ds); label("$A_4$",(-2.6355449660387147,1.085078446888477),NE*lsf); dot(A_1,linewidth(3.pt)+ds); label("$A_1$",(3.1575637581709772,-1.2486383377457595),NE*lsf); dot(A_2,linewidth(3.pt)+ds); label("$A_2$",(4.502882845783654,2.30684782237346),NE*lsf); dot(A_3,linewidth(3.pt)+ds); label("$A_3$",(2.169166061149418,5.203402184478307),NE*lsf); label("$g_3$",(-9.691606303109287,5.354407388189934),NE*lsf); label("$g_2$",(3.0889250292111465,6.727181967386543),NE*lsf); label("$g_1$",(-4.763345563793459,-3.4725331560442676),NE*lsf); label("$g_4$",(-2.663000457622647,6.878187171098171),NE*lsf); dot(B_4,linewidth(3.pt)+ds); label("$B_4$",(-1.5647807942653595,-3.0332452907013523),NE*lsf); dot(B_1,linewidth(3.pt)+ds); label("$B_1$",(4.955898456918535,-0.6583452686912173),NE*lsf); dot(B_2,linewidth(3.pt)+ds); label("$B_2$",(4.104778217816637,5.0661247265586455),NE*lsf); dot(B_3,linewidth(3.pt)+ds); label("$B_3$",(-3.4454819677647146,5.656417795613188),NE*lsf);
clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle);
[/asy]
2005 Germany Team Selection Test, 2
Let $M$ be a set of points in the Cartesian plane, and let $\left(S\right)$ be a set of segments (whose endpoints not necessarily have to belong to $M$) such that one can walk from any point of $M$ to any other point of $M$ by travelling along segments which are in $\left(S\right)$. Find the smallest total length of the segments of $\left(S\right)$ in the cases
[b]a.)[/b] $M = \left\{\left(-1,0\right),\left(0,0\right),\left(1,0\right),\left(0,-1\right),\left(0,1\right)\right\}$.
[b]b.)[/b] $M = \left\{\left(-1,-1\right),\left(-1,0\right),\left(-1,1\right),\left(0,-1\right),\left(0,0\right),\left(0,1\right),\left(1,-1\right),\left(1,0\right),\left(1,1\right)\right\}$.
In other words, find the Steiner trees of the set $M$ in the above two cases.
2016 Bundeswettbewerb Mathematik, 3
Let $A,B,C$ and $D$ be points on a circle in this order. The chords $AC$ and $BD$ intersect in point $P$. The perpendicular to $AC$ through C and the perpendicular to $BD$ through $D$ intersect in point $Q$.
Prove that the lines $AB$ and $PQ$ are perpendicular.
2015 German National Olympiad, 4
Let $k$ be a positive integer. Define $n_k$ to be the number with decimal representation $70...01$ where there are exactly $k$ zeroes. Prove the following assertions:
a) None of the numbers $n_k$ is divisible by $13$.
b) Infinitely many of the numbers $n_k$ are divisible by $17$.
2004 Germany Team Selection Test, 2
Let $d$ be a diameter of a circle $k$, and let $A$ be an arbitrary point on this diameter $d$ in the interior of $k$. Further, let $P$ be a point in the exterior of $k$. The circle with diameter $PA$ meets the circle $k$ at the points $M$ and $N$.
Find all points $B$ on the diameter $d$ in the interior of $k$ such that
\[\measuredangle MPA = \measuredangle BPN \quad \text{and} \quad PA \leq PB.\]
(i. e. give an explicit description of these points without using the points $M$ and $N$).
2017 German National Olympiad, 5
Prove that for all non-negative numbers $x,y,z$ satisfying $x+y+z=1$, one has
\[1 \le \frac{x}{1-yz}+\frac{y}{1-zx}+\frac{z}{1-xy} \le \frac{9}{8}.\]
2016 Germany National Olympiad (4th Round), 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.
2004 Germany Team Selection Test, 1
A function $f$ satisfies the equation
\[f\left(x\right)+f\left(1-\frac{1}{x}\right)=1+x\]
for every real number $x$ except for $x = 0$ and $x = 1$. Find a closed formula for $f$.
2015 Bundeswettbewerb Mathematik Germany, 1
Twelve 1-Euro-coins are laid flat on a table, such that their midpoints form a regular $12$-gon. Adjacent coins are tangent to each other.
Prove that it is possible to put another seven such coins into the interior of the ring of the twelve coins.
2004 Germany Team Selection Test, 2
In a triangle $ABC$, let $D$ be the midpoint of the side $BC$, and let $E$ be a point on the side $AC$. The lines $BE$ and $AD$ meet at a point $F$.
Prove: If $\frac{BF}{FE}=\frac{BC}{AB}+1$, then the line $BE$ bisects the angle $ABC$.
2017 Germany, Landesrunde - Grade 11/12, 3
Find the smallest prime number that can not be written in the form $\left| 2^a-3^b \right|$ with non-negative integers $a,b$.