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

The graph of ${(x^2 + y^2 - 1)}^3 = x^2 y^3$ is a heart-shaped curve, shown in the figure below. [asy] import graph; unitsize(10); real f(real x) { return sqrt(cbrt(x^4) - 4 x^2 + 4); } real g(real x) { return (cbrt(x^2) + f(x))/2; } real h(real x) { return (cbrt(x^2) - f(x)) / 2; } real xmax = 1.139028; draw(graph(g, -xmax, xmax) -- reverse(graph(h, -xmax, xmax)) -- cycle); xaxis("$x$", -1.5, 1.5, above = true); yaxis("$y$", -1.5, 1.5, above = true); [/asy] For how many ordered pairs of integers $(x, y)$ is the point $(x, y)$ inside or on this curve?
A two-digit number $\overline{ab}$ is [i]self-loving[/i] if $a$ and $b$ are relatively prime positive integers and $\overline{ab}$ is divisible by $a+b$. How many self-loving numbers are there? [i]Proposed by Anthony Yang and Andy Xu[/i]
Three different digits were used to create three different three-digit numbers forming an arithmetic progression. (In each number, all the digits are different.) What is the largest difference in this progression?
Let $ABC$ be an acute angled triangle with circumcircle $O$. Line $AO$ intersects the circumcircle of triangle $ABC$ again at point $D$. Let $P$ be a point on the side $BC$. Line passing through $P$ perpendicular to $AP$ intersects lines $DB$ and $DC$ at $E$ and $F$ respectively . Line passing through $D$ perpendicular to $BC$ intersects $EF$ at point $Q$. Prove that $EQ = FQ$ if and only if $BP = CP$.
The city of Bridge Village has some highways. Highways are closed curves that have intersections with each other or themselves in $4$-way crossroads. Mr.Bridge Lover, mayor of the city, wants to build a bridge on each crossroad in order to decrease the number of accidents. He wants to build the bridges in such a way that in each highway, cars pass above a bridge and under a bridge alternately. By knowing the number of highways determine that this action is possible or not. [i]Proposed by Erfan Salavati[/i]
Consider the curve $\Gamma$ defined by the equation $y^2 = x^3 +bx+b^2$, where $b$ is a nonzero rational constant. Inscribe in the curve $\Gamma$ a triangle whose vertices have rational coordinates.
For each non-negative integer $n$, let $u_n = \left( 2+\sqrt{5} \right)^n + \left( 2-\sqrt{5} \right)^n$. a) Prove that $u_n$ is a positive integer for all $n \geq 0$. When $n$ changes, what is the largest possible remainder when $u_n$ is divided by $24$? b) Find all pairs of positive integers $(a, b)$ such that $a, b < 500$ and for all odd positive integers $n$, $u_n \equiv a^n - b^n \pmod {1111}$.
Sequences $(a_n)_{n=0}^{\infty}$ and $(b_n)_{n=0}^{\infty}$ are defined with recurrent relations : $$a_0=0 , \;\;\; a_1=1, \;\;\;\; a_{n+1}=\frac{2018}{n} a_n+ a_{n-1}\;\;\; \text {for }\;\;\; n\geq 1$$ and $$b_0=0 , \;\;\; b_1=1, \;\;\;\; b_{n+1}=\frac{2020}{n} b_n+ b_{n-1}\;\;\; \text {for }\;\;\; n\geq 1$$ Prove that :$$\frac{a_{1010}}{1010}=\frac{b_{1009}}{1009}$$
Given is triangle $ABC$ with centroid $T$, such that $\angle BAC + \angle BTC = 180^\circ$. Let $G$ and $H$ be the second points of intersection of lines $CT$ and $BT$ with the circumcircle of triangle $ABC$, respectively. Prove that the line $GH$ is tangent to the Euler circle of triangle $ABC$. [i]Proposed by Andrija Živadinović[/i]
Let $n$ be an integer and $a, b$ real numbers such that $n > 1$ and $a > b > 0$. Prove that $$(a^n - b^n) \left ( \frac{1}{b^{n- 1}} - \frac{1}{a^{n -1}}\right) > 4n(n -1)(\sqrt{a} - \sqrt{b})^2$$
Consider an arc $AB$ of a circle $C$ and a point $P$ variable in that arc $AB$. Let $D$ be the midpoint of the arc $AP$ that doeas not contain $B$ and let $E$ be the midpoint of the arc $BP$ that does not contain $A$. Let $C_1$ be the circle with center $D$ passing through $A$ and $C_2$ be the circle with center $E$ passing through $B.$ Prove that the line that contains the intersection points of $C_1$ and $C_2$ passes through a fixed point.
Two circles, $\omega_1$ and $\omega_2,$ intersect at $X$ and $Y.$ The segment between their centers intersects $\omega_1$ and $\omega_2$ at $A$ and $B$ respectively, such that $AB=2.$ Given that the radii of $\omega_1$ and $\omega_2$ are $3$ and $4,$ respectively, find $XY.$
Let $n\geq 2$ be some fixed positive integer and suppose that $a_1, a_2,\dots,a_n$ are positive real numbers satisfying $a_1+a_2+\cdots+a_n=2^n-1$. Find the minimum possible value of $$\frac{a_1}{1}+\frac{a_2}{1+a_1}+\frac{a_3}{1+a_1+a_2}+\cdots+\frac{a_n}{1+a_1+a_2+\cdots+a_{n-1}}$$
Let for all $k \in {\mathbb N}$ $k$'s sum of the digits is $T(k)$. If a natural number $n$ such that $T(n)=T(1997n)$, prove that $$9\mid n$$
How many integer values of $x$ satisfy \[\dfrac32 < \dfrac9x < \dfrac 73?\] $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }5$
The expression $ \frac{1^{4y\minus{}1}}{5^{\minus{}1}\plus{}3^{\minus{}1}}$ is equal to: $ \textbf{(A)}\ \frac{4y\minus{}1}{8} \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ \frac{15}{2} \qquad \textbf{(D)}\ \frac{15}{8} \qquad \textbf{(E)}\ \frac{1}{8}$
Let $a_0,a_1,\dots,a_{2024}$ be real numbers such that $\left|a_{i+1}-a_i\right| \le 1$ for $i=0,1,\dots,2023$. a) Find the minimum possible value of $$a_0a_1+a_1a_2+\dots+a_{2023}a_{2024}$$ b) Does there exist a real number $C$ such that $$a_0a_1-a_1a_2+a_2a_3-a_3a_4+\dots+a_{2022}a_{2023}-a_{2023}a_{2024} \ge C$$ for all real numbers $a_0,a_1,\dots,a_2024$ such that $\left|a_{i+1}-a_i\right| \le 1$ for $i=0,1,\dots,2023$.
For a real number $ x$ in the interval $ (0,1)$ with decimal representation \[ 0.a_1(x)a_2(x)...a_n(x)...,\] denote by $ n(x)$ the smallest nonnegative integer such that \[ \overline{a_{n(x)\plus{}1}a_{n(x)\plus{}2}a_{n(x)\plus{}3}a_{n(x)\plus{}4}}\equal{}1966 .\] Determine $ \int_0^1n(x)dx$. ($ \overline{abcd}$ denotes the decimal number with digits $ a,b,c,d .$) [i]A. Renyi[/i]
Let $p(x)$ be a polynomial with integer coefficients such that $p(0)=p(1)=1$. We define the sequence $a_0, a_1, a_2, \ldots, a_n, \ldots$ that starts with an arbitrary nonzero integer $a_0$ and satisfies $a_{n+1}=p(a_n)$ for all $n \in \mathbb N\cup \{0\}$. Prove that $\gcd(a_i,a_j)=1$ for all $i,j \in \mathbb N \cup \{0\}$.
Given triangle $ABC$. $D$ is a point on $BC$. $AC$ meets $(ABD)$ again at $E$,and $AB$ meets $(ACD)$ again at $F$. $M$ is the midpoint of $EF$. $BC$ meets $(DEF)$ again at $P$. Prove that $\angle BAP = \angle MAC$.
The problem is about real polynomial functions, denoted by $f$, of degree $\deg f$. a) Prove that a polynomial function $f$ can`t be wrriten as sum of at most $\deg f$ periodic functions. b) Show that if a polynomial function of degree $1$ is written as sum of two periodic functions, then they are unbounded on every interval (thus, they are "wild"). c) Show that every polynomial function of degree $1$ can be written as sum of two periodic functions. d) Show that every polynomial function $f$ can be written as sum of $\deg f+1$ periodic functions. e) Give an example of a function that can`t be written as a finite sum of periodic functions. [i]Dan Schwarz[/i]
Let $c, s$ be real functions defined on $\mathbb{R}\setminus\{0\}$ that are nonconstant on any interval and satisfy \[c\left(\frac{x}{y}\right)= c(x)c(y) - s(x)s(y)\text{ for any }x \neq 0, y \neq 0\] Prove that: $(a) c\left(\frac{1}{x}\right) = c(x), s\left(\frac{1}{x}\right) = -s(x)$ for any $x = 0$, and also $c(1) = 1, s(1) = s(-1) = 0$; $(b) c$ and $s$ are either both even or both odd functions (a function $f$ is even if $f(x) = f(-x)$ for all $x$, and odd if $f(x) = -f(-x)$ for all $x$). Find functions $c, s$ that also satisfy $c(x) + s(x) = x^n$ for all $x$, where $n$ is a given positive integer.
Let $ a,b,$ and $ c$ denote three distinct integers, and let $ P$ denote a polynomial having integer coefficients. Show that it is impossible that $ P(a) \equal{} b, P(b) \equal{} c,$ and $ P(c) \equal{} a$.
There are $n$ boys $B_1, B_2, ... , B_n$ and $n$ girls $G_1, G_2, ... , G_n$. Each boy ranks the girls in order of preference, and each girl ranks the boys in order of preference. Show that we can arrange the boys and girls into n pairs so that we cannot find a boy and a girl who prefer each other to their partners. For example if $(B_1, G_3)$ and $(B_4, G_7)$ are two of the pairs, then it must not be the case that $B_4$ prefers $G_3$ to $G_7$ and $G_3$ prefers $B_4$ to $B_1$.
Let $f : R^+ \to R^+$ be a function such that for all $x, y \in R^+$, $f(x)f(y) = f(xy) + f\left( \frac{x}{y}\right)$, where $R^+$ represents the positive real numbers. Given that $f(2) = 3$, compute the last two digits of $f(2^{2^{2020}})$. .