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

Given $ m$ and $ n$ as relatively prime positive integers greater than one, show that \[ \frac{\log_{10} m}{\log_{10} n}\] is not a rational number.
Let $ABCD$ be a parallelogram with $AB>BC$ and $\angle DAB$ less than $\angle ABC$. The perpendicular bisectors of sides $AB$ and $BC$ intersect at the point $M$ lying on the extension of $AD$. If $\angle MCD=15^{\circ}$, find the measure of $\angle ABC$
For $a,b, x \in R$ holds: $x^2 - (2a^2 + 4)x + a^2 + 2a + b = 0$. For which $b$ does this equation have at least one root between $0$ and $1$ for all $a$?
The position [i]vs.[/i] time graph for an object moving in a straight line is shown below. What is the instantaneous velocity at $\text{t = 2 s}$? [asy] size(300); // x-axis draw((0,0)--(12,0)); // x-axis tick marks draw((4,0)--(4,-0.2)); draw((8,0)--(8,-0.2)); draw((12,0)--(12,-0.2)); // x-axis labels label("1",(4,0),2*S); label("2",(8,0),2*S); label("3",(12,0),2*S); //y-axis draw((0,-3)--(0,5)); //y-axis tick marks draw((-0.2,-2)--(0,-2)); draw((-0.2,0)--(0,0)); draw((-0.2,2)--(0,2)); draw((-0.2,4)--(0,4)); // y-axis labels label("-2",(0,-2),2*W); label("0",(0,0),2*W); label("2",(0,2),2*W); label("4",(0,4),2*W); // Axis Labels label("Time (s)",(10,0),N); label(rotate(90)*"Position (m)",(0,1),6*W); //Line draw((0,4)--(12,-2)); [/asy] (a) $-\text{2 m/s}$ (b) $-\frac{1}{2} \ \text{m/s}$ (c) $\text{0 m/s}$ (d) $\text{2 m/s}$ (e) $\text{4 m/s}$
Do either (1) or (2): (1) Show that any solution $f(t)$ of the functional equation $$f(x+y)f(x-y)=f(x)^{2} +f(y)^{2} -1$$ for $x,y\in \mathbb{R}$ satisfies $$f''(t)= \pm c^{2} f(t)$$ for a constant $c$, assuming the existence and continuity of the second derivative. Deduce that $f(t)$ is one of the functions $$ \pm \cos ct, \;\;\; \pm \cosh ct.$$ (2) Let $(a_{i})_{i=1,...,n}$ and $(b_{i})_{i=1,...,n}$ be real numbers. Define an $(n+1)\times (n+1)$-matrix $A=(c_{ij})$ by $$ c_{i1}=1, \; \; c_{1j}= x^{j-1} \; \text{for} \; j\leq n,\; \; c_{1n+1}=p(x), \;\; c_{ij}=a_{i-1}^{j-1} \; \text{for}\; i>1, j\leq n,\;\; c_{in+1}=b_{i-1}\; \text{for}\; i>1.$$ The polynomial $p(x)$ is defined by the equation $\det A=0$. Let $f$ be a polynomial and replace $(b_{i})$ with $(f(b_{i}))$. Then $\det A=0$ defines another polynomial $q(x)$. Prove that $f(p(x))-q(x)$ is a multiple of $$\prod_{i=1}^{n} (x-a_{i}).$$
How many positive integers less than $1000$ have the property that the sum of the digits of each such number is divisible by $7$ and the number itself is divisible by $3$?
One thousand students participate in the $2011$ Canadian Closed Mathematics Challenge. Each student is assigned a unique three-digit identification number $abc,$ where each of $a, b$ and $c$ is a digit between $0$ and $9,$ inclusive. Later, when the contests are marked, a number of markers will be hired. Each of the markers will be given a unique two-digit identification number $xy,$ with each of $x$ and $y$ a digit between $0$ and $9,$ inclusive. Marker $xy$ will be able to mark any contest with an identification number of the form $xyA$ or $xAy$ or $Axy,$ for any digit $A.$ What is the minimum possible number of markers to be hired to ensure that all contests will be marked?
Find all integers $ m $ such that $ m^3+m^2+7 $ is divisible by $ m^2-m+1 $.
What is the fewest number of multiplications required to reach $x^{2000}$ from $x$, using only previously generated powers of $x$? For example $x\rightarrow x^{2}\rightarrow x^{4}\rightarrow x^{8}\rightarrow x^{16}\rightarrow x^{32}\rightarrow x^{64}\rightarrow x^{128}\rightarrow x^{256}\rightarrow x^{512}\rightarrow x^{1024}\rightarrow x^{1536}\rightarrow x^{1792}\rightarrow x^{1920}\rightarrow x^{1984}\rightarrow x^{2000}$ uses $15$ multiplications.
There is a graph with 30 vertices. If any of 26 of its vertices with their outgoiing edges are deleted, then the remained graph is a connected graph with 4 vertices. What is the smallest number of the edges in the initial graph with 30 vertices?
Let $ABCD$ be a rhombus of sides $AB = BC = CD= DA = 13$. On the side $AB$ construct the rhombus $BAFE$ outside $ABCD$ and such that the side $AF$ is parallel to the diagonal $BD$ of $ABCD$. If the area of $BAFE$ is equal to $65$, calculate the area of $ABCD$.
Let $P$ be a point in the interior of an acute triangle $ABC$, and let $Q$ be its isogonal conjugate. Denote by $\omega_P$ and $\omega_Q$ the circumcircles of triangles $BPC$ and $BQC$, respectively. Suppose the circle with diameter $\overline{AP}$ intersects $\omega_P$ again at $M$, and line $AM$ intersects $\omega_P$ again at $X$. Similarly, suppose the circle with diameter $\overline{AQ}$ intersects $\omega_Q$ again at $N$, and line $AN$ intersects $\omega_Q$ again at $Y$. Prove that lines $MN$ and $XY$ are parallel. (Here, the points $P$ and $Q$ are [i]isogonal conjugates[/i] with respect to $\triangle ABC$ if the internal angle bisectors of $\angle BAC$, $\angle CBA$, and $\angle ACB$ also bisect the angles $\angle PAQ$, $\angle PBQ$, and $\angle PCQ$, respectively. For example, the orthocenter is the isogonal conjugate of the circumcenter.) [i]Proposed by Sammy Luo[/i]
p1. From the measurement of the height of nine trees obtained data as following. a) There are three different measurement results (in meters) b) All data are positive numbers c) Mean$ =$ median $=$ mode $= 3$ d) The sum of the squares of all data is $87.$ Determine all possible heights of the nine trees. p2. If $x$ and $y$ are integers, find the number of pairs $(x,y)$ that satisfy $|x|+|y|\le 50$. p3. The plane figure $ABCD$ on the side is a trapezoid with $AB$ parallel to $CD$. Points $E$ and $F$ lie on $CD$ so that $AD$ is parallel to $BE$ and $AF$ is parallel to $BC$. Point $H$ is the intersection of $AF$ with $BE$ and point $G$ is the intersection of $AC$ with $BE$. If the length of $AB$ is $4$ cm and the length of $CD$ is $10$ cm, calculate the ratio of the area of ​​the triangle $AGH$ to the area of ​​the trapezoid $ABCD$. [img]https://cdn.artofproblemsolving.com/attachments/c/7/e751fa791bce62f091024932c73672a518a240.png[/img] p4. A prospective doctor is required to intern in a hospital for five days in July $2011$. The hospital leadership gave the following rules: a) Internships may not be conducted on two consecutive days. b) The fifth day of internship can only be done after four days counted since the fourth day of internship. Suppose the fourth day of internship is the date $20$, then the fifth day of internship can only be carried out at least the date $24$. Determine the many possible schedule options for the prospective doctor. p5. Consider the following sequences of natural numbers: $5$, $55$, $555$, $5555$, $55555$, $...$ ,$\underbrace{\hbox{5555...555555...}}_{\hbox{n\,\,numbers}}$ . The above sequence has a rule: the $n$th term consists of $n$ numbers (digits) $5$. Show that any of the terms of the sequence is divisible by $2011$.
Solve the equation $\sqrt {a-\sqrt{a+x}}=x$ in real numbers in terms of the real number $a>1$.
Given a finite set $ P$ of prime numbers, prove that there exists a positive integer $ x$ such that it can be written in the form $ a^p \plus{} b^p$ ($ a,b$ are positive integers), for each $ p\in P$, and cannot be written in that form for each $ p$ not in $ P$.
Suppose $n \ge 0$ is an integer and all the roots of $x^3 + \alpha x + 4 - ( 2 \times 2016^n) = 0$ are integers. Find all possible values of $\alpha$.
If the three-digit number $ABC$ is divisible by $27$, prove that the three-digit numbers $BCA$ and $CAB$ are also divisible by $27$.
Alex and Kevin are radish watching. The probability that they will see a radish within the next hour is $\frac{1}{17}$. If the probability that they will see a radish within the next $15$ minutes is $p$, determine $\lfloor 1000p \rfloor$. Assume that the probability of seeing a radish at any given moment is uniform for the entire hour. [i]Proposed by Ephram Chun[/i]
Let us call a natural number $unlucky$ if it cannot be expressed as $\frac{x^2-1}{y^2-1} $ with natural numbers $x,y >1$. Is the number of $unlucky$ numbers finite or infinite?
At a party every woman dances with at least one man, and no man dances with every woman. Show that there are men M and M' and women W and W' such that M dances with W, M' dances with W', but M does not dance with W', and M' does not dance with W.
In a year that has $365$ days, what is the maximum number of "Tuesday the $13$th" there can be? Note: The months of April, June, September and November have $30$ days each, February has $28$ and all others have $31$ days.
Let $(I_b)$, $(I_c)$ are excircles of a triangle $ABC$. Given a circle $ \omega $ passes through $A$ and externally tangents to the circles $(I_b)$ and $(I_c)$ such that it intersects with $BC$ at points $M$, $N$. Prove that $ \angle BAM=\angle CAN $. A. Smirnov
What is the largest real number $C$ that satisfies the inequality $x^2 \geq C \lfloor x \rfloor (x-\lfloor x \rfloor)$ for every real $x$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 4 \qquad\textbf{(D)}\ 9 \qquad\textbf{(E)}\ 25 $
Let \(ABC\) be a right-angled triangle with \(\angle B=90^{\circ}\). Let \(I\) be the incentre if \(ABC\). Extend \(AI\) and \(CI\); let them intersect \(BC\) in \(D\) and \(AB\) in \(E\) respectively. Draw a line perpendicular to \(AI\) at \(I\) to meet \(AC\) in \(J\), draw a line perpendicular to \(CI\) at \(I\) to meet \(AC\) at \(K\). Suppose \(DJ=EK\). Prove that \(BA=BC\).
What is the smallest integer $a_0$ such that, for every positive integer $n$, there exists a sequence of positive integers $a_0, a_1, ..., a_{n-1}, a_n$ such that the first $n-1$ are all distinct, $a_0 = a_n$, and for $0 \le i \le n -1$, $a_i^{a_{i+1}}$ ends in the digits $\overline{0a_i}$ when expressed without leading zeros in base $10$.