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

$R$ is a ring such that $xy=yx$ for every $x,y\in R$ and if $ab=0$ then $a=0$ or $b=0$. if for every Ideal $I\subset R$ there exist $x_1,x_2,..,x_n$ in $R$ ($n$ is not constant) such that $I=(x_1,x_2,...,x_n)$, prove that every element in $R$ that is not $0$ and it's not a unit, is the product of finite irreducible elements.($\frac{100}{6}$ points)
Let $f$ be a real-valued function defined for all real numbers, such that for some $a>0$ we have \[ f(x+a)={1\over2}+\sqrt{f(x)-f(x)^2} \] for all $x$. Prove that $f$ is periodic, and give an example of such a non-constant $f$ for $a=1$.
For each $n\in\mathbb N$, the function $f_n$ is defined on real numbers $x\ge n$ by $$f_n(x)=\sqrt{x-n}+\sqrt{x-n+1}+\ldots+\sqrt{x+n}-(2n+1)\sqrt x.$$(a) If $n$ is fixed, prove that $\lim_{x\to+\infty}f_n(x)=0$. (b) Find the limit of $f_n(n)$ as $n\to+\infty$.
For a given $\alpha >0$ let us consider the regular, non-vanishing $f(z)$ maps on the unit disc $\{ |z|<1 \}$ for which $f(0)=1$ and $\mathrm{Re}\, z\frac{f'(z)}{f(z)}>-\alpha$ ($|z|<1$). Show that the range of $$g(z)=\frac{1}{(1-z)^{2\alpha}}$$ contains the range of all other such functions. Here we consider that regular branch of $g(z)$ for which $g(0)=1$. (translated by Miklós Maróti)
Suppose that $n$ is a natural number. we call the sequence $(x_1,y_1,z_1,t_1),(x_2,y_2,z_2,t_2),.....,(x_s,y_s,z_s,t_s)$ of $\mathbb Z^4$ [b]good[/b] if it satisfies these three conditions: [b]i)[/b] $x_1=y_1=z_1=t_1=0$. [b]ii)[/b] the sequences $x_i,y_i,z_i,t_i$ be strictly increasing. [b]iii)[/b] $x_s+y_s+z_s+t_s=n$. (note that $s$ may vary). Find the number of good sequences. [i]proposed by Mohammad Ghiasi[/i]
Is there a sequence $ a_1,a_2,\ldots$ of positive reals satisfying simoultaneously the following inequalities for all positive integers $ n$: a) $ a_1\plus{}a_2\plus{}\ldots\plus{}a_n\le n^2$ b) $ \frac1{a_1}\plus{}\frac1{a_2}\plus{}\ldots\plus{}\frac1{a_n}\le2008$?
Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ such that whenever $a>b>c>d>0$ and $ad=bc$, \[f(a+d)+f(b-c)=f(a-d)+f(b+c).\] [i]Calvin Deng.[/i]
Let $ C$ be the circle with radius 1 centered on the origin. Fix the endpoint of the string with length $ 2\pi$ on the point $ A(1,\ 0)$ and put the other end point $ P$ on the point $ P_0(1,\ 2\pi)$. From this situation, when we twist the string around $ C$ by moving the point $ P$ in anti clockwise with the string streched tightly, find the length of the curve that the point $ P$ draws from sarting point $ P_0$ to reaching point $ A$.
Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying: $ x^2 f(x)\plus{}f(1\minus{}x)\equal{}2x\minus{}x^4$ for all $ x \in \mathbb{R}$.
Let $\mathbb{Z}$ be the set of integers. Find all functions $f : \mathbb{Z} \rightarrow \mathbb{Z}$ such that \[xf(2f(y)-x)+y^2f(2x-f(y))=\frac{f(x)^2}{x}+f(yf(y))\] for all $x, y \in \mathbb{Z}$ with $x \neq 0$.
Find all the functions $f:\mathbb{N}\to\mathbb{R}$ that satisfy \[ f(x+y)=f(x)+f(y) \] for all $x,y\in\mathbb{N}$ satisfying $10^6-\frac{1}{10^6} < \frac{x}{y} < 10^6+\frac{1}{10^6}$. Note: $\mathbb{N}$ denotes the set of positive integers and $\mathbb{R}$ denotes the set of real numbers.
Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\] [i]Proposed by Denmark[/i]
Let $\mathbb N$ denote the set of positive integers. A function $f\colon\mathbb N\to\mathbb N$ has the property that for all positive integers $m$ and $n$, exactly one of the $f(n)$ numbers \[f(m+1),f(m+2),\ldots,f(m+f(n))\] is divisible by $n$. Prove that $f(n)=n$ for infinitely many positive integers $n$.
Let $ f$ be a function defined on the set of non-negative integers and taking values in the same set. Given that (a) $ \displaystyle x \minus{} f(x) \equal{} 19\left[\frac{x}{19}\right] \minus{} 90\left[\frac{f(x)}{90}\right]$ for all non-negative integers $ x$; (b) $ 1900 < f(1990) < 2000$, find the possible values that $ f(1990)$ can take. (Notation : here $ [z]$ refers to largest integer that is $ \leq z$, e.g. $ [3.1415] \equal{} 3$).
Let $f(x)=\frac{P(x)}{Q(x)}$, where $P(x), Q(x)$ are two non-constant polynomials with no common zeros and $P(0)=P(1)=0$. Suppose $f(x)f\left(\frac{1}{x}\right)=f(x)+f\left(\frac{1}{x}\right)$ for infinitely many values of $x$. a) Show that $\text{deg}(P)<\text{deg}(Q)$. b) Show that $P'(1)=2Q'(1)-\text{deg}(Q)\cdot Q(1)$. Here, $P'(x)$ denotes the derivative of $P(x)$ as usual.
[b]a.)[/b] Let $a,b$ be real numbers. Define sequence $x_k$ and $y_k$ such that \[x_0 = 1, y_0 = 0, x_{k+1} = a \cdot x_k - b \cdot y_l, \quad y_{k+1} = x_k - a \cdot y_k \text{ for } k = 0,1,2, \ldots \] Prove that \[x_k = \sum^{[k/2]}_{l=0} (-1)^l \cdot a^{k - 2 \cdot l} \cdot \left(a^2 + b \right)^l \cdot \lambda_{k,l}\] where $\lambda_{k,l} = \sum^{[k/2]}_{m=l} \binom{k}{2 \cdot m} \cdot \binom{m}{l}$ [b]b.)[/b] Let $u_k = \sum^{[k/2]}_{l=0} \lambda_{k,l} $. For positive integer $m,$ denote the remainder of $u_k$ divided by $2^m$ as $z_{m,k}$. Prove that $z_{m,k},$ $k = 0,1,2, \ldots$ is a periodic function, and find the smallest period.
Let $f_1,f_2,\ldots $ be a sequence of non-increasing functions from the naturals to the naturals. Show there exists $i < j$ such that $$f_i(n) \leq f_j(n) \text{ for all } n \in \mathbb{N}.$$
Let $\mathbb{Z}^+$ be the set of positive integers. Find all functions $f:\mathbb{Z}^+ \rightarrow\mathbb{Z}^+$ such that the following conditions both hold: (i) $f(n!)=f(n)!$ for every positive integer $n$, (ii) $m-n$ divides $f(m)-f(n)$ whenever $m$ and $n$ are different positive integers.
Find all functions $ f: \mathbb{R} \to \mathbb{R} $ such that $$ f\left(f\left(x\right)+y\right) = f\left(x^2-y\right)+4\left(y-2\right)\left(f\left(x\right)+2\right) $$ holds for all $ x, y \in \mathbb{R} $
Find a function $f$ such that $f(t^2 +t +1) = t$ for all real $t \ge 0$
What is the greatest real root of the equation $x^3-x^2-x-\frac 13 = 0$? $ \textbf{(A)}\ \dfrac{\sqrt {3} - \sqrt{2}}{2} \qquad\textbf{(B)}\ \dfrac{\sqrt [3]{3} - \sqrt[3]{2}}{2} \qquad\textbf{(C)}\ \dfrac 1{\sqrt[3] {3} - 1} \qquad\textbf{(D)}\ \dfrac 1{\sqrt[3] {4} - 1} \qquad\textbf{(E)}\ \text{None of above} $
The function $ F$ is defined on the set of nonnegative integers and takes nonnegative integer values satisfying the following conditions: for every $ n \geq 0,$ (i) $ F(4n) \equal{} F(2n) \plus{} F(n),$ (ii) $ F(4n \plus{} 2) \equal{} F(4n) \plus{} 1,$ (iii) $ F(2n \plus{} 1) \equal{} F(2n) \plus{} 1.$ Prove that for each positive integer $ m,$ the number of integers $ n$ with $ 0 \leq n < 2^m$ and $ F(4n) \equal{} F(3n)$ is $ F(2^{m \plus{} 1}).$
A box contains $3$ shiny pennies and $4$ dull pennies. One by one, pennies are drawn at random from the box and not replaced. If the probability is $\frac{a}{b}$ that it will take more than four draws until the third shiny penny appears and $\frac{a}{b}$ is in lowest terms, then $a+b=$ $ \textbf{(A)}\ 11 \qquad\textbf{(B)}\ 20 \qquad\textbf{(C)}\ 35 \qquad\textbf{(D)}\ 58 \qquad\textbf{(E)}\ 66 $
Is there a triangle with angles in ratio of $ 1: 2: 4$ and the length of its sides are integers with at least one of them is a prime number? [i]Nanang Susyanto, Jogjakarta[/i]
Find the differentiable functions $ f:\mathbb{R}\longrightarrow (-\infty ,1) $ with the property $ f(1)=-1 $ and $$ f(x+y)=f(x)+f(y)-f(x)f(y) , $$ for any reals $ x,y. $ [i]Vasile Pop[/i]