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

A function from the positive integers to the positive integers satisfies these properties 1. $f(ab)=f(a)f(b)$ for any two coprime positive integers $a,b$. 2. $f(p+q)=f(p)+f(q)$ for any two primes $p,q$. Prove that $f(2)=2, f(3)=3, f(1999)=1999$.
Find all functions $f$ such that \[f(f(x) + y) = f(x^2-y) + 4yf(x)\] for all real numbers $x$ and $y$.
Let $ (a,b,c)$ be the real solution of the system of equations $ x^3 \minus{} xyz \equal{} 2$, $ y^3 \minus{} xyz \equal{} 6$, $ z^3 \minus{} xyz \equal{} 20$. The greatest possible value of $ a^3 \plus{} b^3 \plus{} c^3$ can be written in the form $ \frac{m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$.
Let $f (x) = 2x^2 + x - 1$, $f^0(x) = x$ and $f^{n + 1}(x) = f (f^n(x))$ for all real $x$ and $n \ge 0$ integer . (a) Determine the number of real distinct solutions of the equation of $f^3(x) = x$. (b) Determine, for each integer $n \ge 0$, the number of real distinct solutions of the equation $f^n(x) = 0$.
Find all functions $ f :\mathbb{R}\to\mathbb{R} $, satisfying the condition $f (xf (y) + f (x)) = 2f (x) + xy$ for any real $x$ and $y$.
Let $ 0\leq \theta\leq \frac{\pi}{2}$ . Prove that $\sin \theta \geq \frac{2\theta}{\pi}$.
Find the indefinite integral $ \int \frac{x^3}{(x\minus{}1)^3(x\minus{}2)}\ dx$.
Let $ k$ be a positive integer. Suppose that the integers $ 1,2,3,\dots,3k \plus{} 1$ are written down in random order. What is the probability that at no time during this process, the sum of the integers that have been written up to that time is a positive integer divisible by $ 3$ ? Your answer should be in closed form, but may include factorials.
Let $\kappa$ be an infinite cardinality and let A , B be sets of cardinality $\kappa$. Construct a family $\cal F$ of functions $f : A \to B$ with cardinality $2^\kappa$ such that for all functions $f_1,\cdots, f_n \in\cal F$ and for all $b_1 , ..., b_n \in B$, there exist $a\in A$ such that $f_1(a) = b_1,\cdots, f_n(a) = b_n$.
The function $f$, defined on the set of ordered pairs of positive integers, satisfies the following properties: \begin{eqnarray*} f(x,x) &=& x, \\ f(x,y) &=& f(y,x), \quad \text{and} \\ (x + y) f(x,y) &=& yf(x,x + y). \end{eqnarray*} Calculate $f(14,52)$.
A function $f(x)$ defined in $x\geq 0$ satisfies $\lim_{x\to\infty} \frac{f(x)}{x}=1$. Find $\int_0^{\infty} \{f(x)-f'(x)\}e^{-x}dx$. [i]1997 Hokkaido University entrance exam/Science[/i]
Let \( f(x) = \frac{100^x}{100^x + 10} \). Determine the value of: \[ f\left( \frac{1}{2024} \right) - f\left( \frac{2}{2024} \right) + f\left( \frac{3}{2024} \right) - f\left( \frac{4}{2024} \right) + \ldots - f\left( \frac{2022}{2024} \right) + f\left( \frac{2023}{2024} \right) \]
Find all pairs of positive integers $(m,n)$ such that \[m+n-\frac{3mn}{m+n}=\frac{2011}{3}.\]
A strictly decreasing function $f:(0, \infty)\Rightarrow (0, \infty)$ attaining all positive values and positive numbers $a_1\ne b_1$ are given. Numbers $a_2, b_2, a_3, b_3, ...$ satisfy $$a_{n+1}=a_n+f(b_n),\;\;\;\;\;\;\;b_{n+1}=b_n+f(a_n)$$ for every $n\geq 1$. Prove that there exists a positive integer $n$ satisfying $|a_n-b_n| >2025$.
Real numbers $a_{1},a_{2},\dots,a_{n}$ satisfy $a_{i}\geq\frac{1}{i}$, for all $i=\overline{1,n}$. Prove the inequality: \[\left(a_{1}+1\right)\left(a_{2}+\frac{1}{2}\right)\cdot\dots\cdot\left(a_{n}+\frac{1}{n}\right)\geq\frac{2^{n}}{(n+1)!}(1+a_{1}+2a_{2}+\dots+na_{n}).\]
Let $N$ be the set of all non-negative integers and for each $n \in N$ denote $n'= n +1$. The function $A : N^3 \to N$ is defined as follows: (i) $A(0, m, n) = m'$ for all $m, n \in N$ (ii) $A(k', 0, n) =\left\{ \begin{array}{ll} n & if \, \, k = 0 \\ 0 & if \, \,k = 1, \\ 1 & if \, \, k > 1 \end{array} \right.$ for all $k, n \in N$ (iii) $A(k', m', n) = A(k, A(k',m,n), n)$ for all $k,m, n \in N$. Compute $A(5, 3, 2)$. (H. Nestra)
Suppose all the pairs of a positive integers from a finite collection \[A=\{a_{1}, a_{2}, \cdots \}\] are added together to form a new collection \[A^{*}=\{a_{i}+a_{j}\;\; \vert \; 1 \le i < j \le n \}.\] For example, $A=\{ 2, 3, 4, 7 \}$ would yield $A^{*}=\{ 5, 6, 7, 9, 10, 11 \}$ and $B=\{ 1, 4, 5, 6 \}$ would give $B^{*}=\{ 5, 6, 7, 9, 10, 11 \}$. These examples show that it's possible for different collections $A$ and $B$ to generate the same collections $A^{*}$ and $B^{*}$. Show that if $A^{*}=B^{*}$ for different sets $A$ and $B$, then $|A|=|B|$ and $|A|=|B|$ must be a power of $2$.
Define a sequence $\{ a_n \}_{n=0}^{\infty}$ by $a_0 = 1,$ $a_1 = 8,$ and $a_n = 2a_{n-1} + a_{n-2}$ for $n \geq 2.$ The infinite sum \[ \sum_{n=1}^{\infty} \int_{0}^{2021\pi/14} \sin(a_{n-1}x)\sin(a_nx)\,dx \] can be expressed as a common fraction $\tfrac{p}{q}.$ Compute $p + q.$
Let $a(x)$ and $b(x)$ be continuous functions on $[0,1]$ and let $0 \leq a(x) \leq a <1$ on that range. Under what other conditions (if any) is the solution of the equation for $u,$ $$ u= \max_{0 \leq x \leq 1} b(x) +a(x)u$$ given by $$u = \max_{0 \leq x \leq 1} \frac{b(x)}{1-a(x)}.$$
Prove that there is no function $f: \mathbb{Z}\to\mathbb{Z}$ such that $f(f(x))=x+1$, for all $x\in\mathbb{Z}$.
Consider a regular $n$-gon $A_1A_2\ldots A_n$ with area $S$. Let us draw the lines $l_1,l_2,\ldots,l_n$ perpendicular to the plane of the $n$-gon at $A_1,A_2,\ldots,A_n$ respectively. Points $B_1,B_2,\ldots,B_n$ are selected on lines $l_1,l_2,\ldots,l_n$ respectively so that: (i) $B_1,B_2,\ldots,B_n$ are all on the same side of the plane of the $n$-gon; (ii) Points $B_1,B_2,\ldots,B_n$ lie on a single plane; (iii) $A_1B_1=h_1,A_2B_2=h_2,\ldots,A_nB_n=h_n$. Express the volume of polyhedron $A_1A_2\ldots A_nB_1B_2\ldots B_n$ as a function in $S,h_1,\ldots,h_n$.
For a positive integer $n$ with prime factorization $n = p_1^{\alpha_1}p_2^{\alpha_2}\cdots p_k^{\alpha_k}$ let's define $\lambda(n) = (-1)^{\alpha_1 + \alpha_2 + \dots + \alpha_k}$. Define $L(n)$ as sum of $\lambda(x)$ over all integers from $1$ to $n$. Define $K(n)$ as sum of $\lambda(x)$ over all [b]composite[/b] integers from $1$ to $n$. For some $N>1$, we know, that for every $2\le n \le N$, $L(n)\le 0$. Prove that for this $N$, for every $2\le n \le N$, $K(n)\ge 0$. [i]Mykhailo Shtandenko[/i]
Let $A,B \in \mathcal{M}_n(\mathbb{R}).$ We consider the function $f:\mathcal{M}_n(\mathbb{C}) \to \mathcal{M}_n(\mathbb{C}),$ defined by $f(Z)=AZ+B\overline{Z},$ $Z \in \mathcal{M}_n(\mathbb{C}),$ where $\overline{Z}$ is the matrix whose entries are the conjugates of the corresponding entries of $Z.$ Prove that the following statements are equivalent: $(1)$ the function $f$ is injective; $(2)$ the function $f$ is surjective; $(3)$ the matrices $A+B$ and $A-B$ are invertible.
Determine the range of the following function defined for integer $k$, \[f(k)=(k)_3+(2k)_5+(3k)_7-6k\] where $(k)_{2n+1}$ denotes the multiple of $2n+1$ closest to $k$
\[A=3\sum_{m=1}^{n^2}(\frac12-\{\sqrt{m}\})\] where $n$ is an positive integer. Find the largest $k$ such that $n^k$ divides $[A]$.