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: 4776

Let $S$ be the domain in the coordinate plane determined by two inequalities: \[y\geq \frac 12x^2,\ \ \frac{x^2}{4}+4y^2\leq \frac 18.\] Denote by $V_1$ the volume of the solid by a rotation of $S$ about the $x$-axis and by $V_2$, by a rotation of $S$ about the $y$-axis. (1) Find the values of $V_1,\ V_2$. (2) Compare the size of the value of $\frac{V_2}{V_1}$ and 1.
Let $n$ be a positive integer and let $a_1, a_2, \cdots a_k$ be all numbers less than $n$ and coprime to $n$ in increasing order. Find the set of values the function $f(n)=gcd(a_1^3-1, a_2^3-1, \cdots, a_k^3-1)$.
Let $a, b, n \in \mathbb{N}$, with $a, b \geq 2.$ Also, let $I_{1}(n)=\int_{0}^{1} \left \lfloor{a^n x} \right \rfloor dx $ and $I_{2} (n) = \int_{0}^{1} \left \lfloor{b^n x} \right \rfloor dx.$ Find $\lim_{n \to \infty} \dfrac{I_1(n)}{I_{2}(n)}.$
Suppose that $f$ and $g$ are two functions defined on the set of positive integers and taking positive integer values. Suppose also that the equations $f(g(n)) = f(n) + 1$ and $g(f(n)) = g(n) + 1$ hold for all positive integers. Prove that $f(n) = g(n)$ for all positive integer $n.$ [i]Proposed by Alex Schreiber, Germany[/i]
Let $n$ be a positive integer. What is the largest $k$ for which there exist $n\times n$ matrices $M_1,\dots,M_k$ and $N_1,\dots,N_k$ with real entries such that for all $i$ and $j,$ the matrix product $M_iN_j$ has a zero entry somewhere on its diagonal if and only if $i\ne j?$
For some integers $a$ and $b$ the function $f(x)=ax+b$ has the properties that $f(f(0))=0$ and $f(f(f(4)))=9$. Find $f(f(f(f(10))))$.
Let $f$ be a non-constant function from the set of positive integers into the set of positive integer, such that $a-b$ divides $f(a)-f(b)$ for all distinct positive integers $a$, $b$. Prove that there exist infinitely many primes $p$ such that $p$ divides $f(c)$ for some positive integer $c$. [i]Proposed by Juhan Aru, Estonia[/i]
Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ with the property that $$f(x)f(y) = (xy - 1)^2f\left(\frac{x + y - 1}{xy - 1}\right)$$ for all real numbers $x, y$ with $xy \neq 1$.
Let $m_1, m_2, \cdots ,m_k$ be positive numbers with the sum $S$. Prove that \[\displaystyle\sum_{i=1}^k\left(m_i +\frac{1}{m_i}\right)^2 \ge k\left(\frac{k}{S}+\frac{S}{k}\right)^2\]
a)Prove that $\frac{1}{2}+\frac{1}{3}+...+\frac{1}{{{2}^{m}}}<m$, for any $m\in {{\mathbb{N}}^{*}}$. b)Let ${{p}_{1}},{{p}_{2}},...,{{p}_{n}}$ be the prime numbers less than ${{2}^{100}}$. Prove that $\frac{1}{{{p}_{1}}}+\frac{1}{{{p}_{2}}}+...+\frac{1}{{{p}_{n}}}<10$
If \[ \sum_{n=1}^{\infty}\frac{\frac11 + \frac12 + \dots + \frac 1n}{\binom{n+100}{100}} = \frac pq \] for relatively prime positive integers $p,q$, find $p+q$. [i]Proposed by Michael Kural[/i]
Let $ n$ be a positive integer, $ X \equal{} \{1, 2, \ldots , n\},$ and $ k$ a positive integer such that $ \frac{n}{2} \leq k \leq n.$ Determine, with proof, the number of all functions $ f : X \mapsto X$ that satisfy the following conditions: [b](i)[/b] $ f^2 \equal{} f;$ [b](ii)[/b] the number of elements in the image of $ f$ is $ k;$ [b](iii)[/b] for each $ y$ in the image of $ f,$ the number of all points $ x \in X$ such that $ f(x)\equal{}y$ is at most $ 2.$
Let $ABC$ be a triangle with $AB=26$, $AC=28$, $BC=30$. Let $X$, $Y$, $Z$ be the midpoints of arcs $BC$, $CA$, $AB$ (not containing the opposite vertices) respectively on the circumcircle of $ABC$. Let $P$ be the midpoint of arc $BC$ containing point $A$. Suppose lines $BP$ and $XZ$ meet at $M$ , while lines $CP$ and $XY$ meet at $N$. Find the square of the distance from $X$ to $MN$. [i]Proposed by Michael Kural[/i]
Find all functions $\displaystyle f : \mathbb N^\ast \to M$ such that \[ \displaystyle 1 + f(n) f(n+1) = 2 n^2 \left( f(n+1) - f(n) \right), \, \forall n \in \mathbb N^\ast , \] in each of the following situations: (a) $\displaystyle M = \mathbb N$; (b) $\displaystyle M = \mathbb Q$. [i]Dinu Şerbănescu[/i]
Determine all functions $f:\mathbb{R}\to\mathbb{R}$ for which there exists a function $g:\mathbb{R}\to\mathbb{R}$ such that $f(x)+f(y)=\lfloor g(x+y)\rfloor$ for all real numbers $x$ and $y$. [i]Emil Vasile[/i]
Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ that satisfy $$(f(a)-f(b))(f(b)-f(c))(f(c)-f(a)) = f(ab^2+bc^2+ca^2) - f(a^2b+b^2c+c^2a)$$for all real numbers $a$, $b$, $c$. [i]Proposed by Ankan Bhattacharya, USA[/i]
Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that $$f(f(x)^2 + |y|) = x^2 + f(y)$$
Find all functions $f:R\rightarrow R$ such that \[ f(x^3)+f(y^3)=(x+y)(f(x^2)+f(y^2)-f(xy)) \] for all $x,y\in R$.
Find all functions $f:\mathbb{R}^+ \to \mathbb{R}$ such that for all $x,y,z>0$ $$ 3(x^3+y^3+z^3)\geq f(x+y+z)\cdot f(xy+yz+xz) \geq (x+y+z)(xy+yz+xz). $$
Find all functions $f:(0,\infty) \rightarrow (0,\infty)$ such that \[f\left(x+\frac{1}{y}\right)+f\left(y+\frac{1}{z}\right) + f\left(z+\frac{1}{x}\right) = 1\] for all $x,y,z >0$ with $xyz =1$.
Let $(a_n)_{n=1}^{\infty}$ be a sequence with $a_n \in \{0,1\}$ for every $n$. Let $F:(-1,1) \to \mathbb{R}$ be defined by \[F(x)=\sum_{n=1}^{\infty} a_nx^n\] and assume that $F\left(\frac{1}{2}\right)$ is rational. Show that $F$ is the quotient of two polynomials with integer coefficients.
Let be a real function that has the intermediate value property and is monotone on the irrationals. Show that it's continuous. [i]Mihai Piticari[/i]
Find all functions $f, g: \mathbb{R} \rightarrow \mathbb{R}$ satisfying $f (0)=2022$ and $f (x+g(y)) =xf(y)+(2023-y)f(x)+g(x)$ for all $x, y \in \mathbb{R}$.
Find all functions $f: \mathbb{Q}\to \mathbb{R}$ such that for all $x,y\in \mathbb{Q}$: \[f(xy)=f(x)f(y)-f(x+y)+1.\]
Let $ f$ be a function from the non-negative integers to the non-negative integers such that $ f(nm) \equal{} n f(m) \plus{} m f(n), f(10) \equal{} 19, f(12) \equal{} 52,$ and $ f(15) \equal{} 26.$ What is $ f(8)$? A. 12 B. 24 C. 36 D. 48 E. 60