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

$n$ being a given integer, find all functions $f\colon \mathbb{Z} \to \mathbb{Z}$, such that for all integers $x,y$ we have $f\left( {x + y + f(y)} \right) = f(x) + ny$.
Find the function $f(x)$ which satisfies the following integral equation. \[f(x)=\int_0^x t(\sin t-\cos t)dt+\int_0^{\frac{\pi}{2}} e^t f(t)dt\]
Let $ a\in\mathbb{R}. $ Prove the following proposition: $$ \left( x,y\in\mathbb{R}\implies x^4+y^4+axy+2\ge 0 \right)\iff |a|\le 4. $$
For a positive integer $n$, let $s(n)$ and $c(n)$ be the number of divisors of $n$ that are perfect squares and perfect cubes respectively. A positive integer $n$ is called fair if $s(n)=c(n)>1$. Find the number of fair integers less than $100$.
Let $\mathbb{N}$ denote the set of positive integers. Fix a function $f: \mathbb{N} \rightarrow \mathbb{N}$ and for any $m,n \in \mathbb{N}$ define $$\Delta(m,n)=\underbrace{f(f(\ldots f}_{f(n)\text{ times}}(m)\ldots))-\underbrace{f(f(\ldots f}_{f(m)\text{ times}}(n)\ldots)).$$ Suppose $\Delta(m,n) \neq 0$ for any distinct $m,n \in \mathbb{N}$. Show that $\Delta$ is unbounded, meaning that for any constant $C$ there exists $m,n \in \mathbb{N}$ with $\left|\Delta(m,n)\right| > C$.
=A subset $ S$ of $ \mathbb R^2$ is called an algebraic set if and only if there is a polynomial $ p(x,y)\in\mathbb R[x,y]$ such that \[ S \equal{} \{(x,y)\in\mathbb R^2|p(x,y) \equal{} 0\} \] Are the following subsets of plane an algebraic sets? 1. A square [img]http://i36.tinypic.com/28uiaep.png[/img] 2. A closed half-circle [img]http://i37.tinypic.com/155m155.png[/img]
Determine all pairs $(f,g)$ of functions from the set of real numbers to itself that satisfy \[g(f(x+y)) = f(x) + (2x + y)g(y)\] for all real numbers $x$ and $y$. [i]Proposed by Japan[/i]
For $x\geq 0$, Prove that $\int_0^x (t-t^2)\sin ^{2002} t \,dt<\frac{1}{2004\cdot 2005}$
Let $p$ be a prime, $n$ be a positive integer, and let $\mathbb{Z}_{p^n}$ denote the set of congruence classes modulo $p^n.$ Determine the number of functions $f: \mathbb{Z}_{p^n} \to \mathbb{Z}_{p^n}$ satisfying the condition \[ f(a)+f(b) \equiv f(a+b+pab) \pmod{p^n} \] for all $a,b \in \mathbb{Z}_{p^n}.$
Define the sequence $x_1, x_2, ...$ inductively by $x_1 = \sqrt{5}$ and $x_{n+1} = x_n^2 - 2$ for each $n \geq 1$. Compute $\lim_{n \to \infty} \frac{x_1 \cdot x_2 \cdot x_3 \cdot ... \cdot x_n}{x_{n+1}}$.
The plot of the $y=f(x)$ function, being rotated by the (right) angle around the $(0,0)$ point is not changed. a) Prove that the equation $f(x)=x$ has the unique solution. b) Give an example of such a function.
Let $ f$ be an infinitely differentiable real-valued function defined on the real numbers. If $ f(1/n)\equal{}\frac{n^{2}}{n^{2}\plus{}1}, n\equal{}1,2,3,...,$ Compute the values of the derivatives of $ f^{k}(0), k\equal{}0,1,2,3,...$
Find all functions $f: \mathbb{Q}^{+}\to \mathbb{Q}^{+}$ such that for all $x,y \in \mathbb{Q}$: \[f \left( x+\frac{y}{x}\right) =f(x)+\frac{f(y)}{f(x)}+2y, \; x,y \in \mathbb{Q}^{+}.\]
Let $ a_{1}, a_{2}...a_{n}$ be non-negative reals, not all zero. Show that that (a) The polynomial $ p(x) \equal{} x^{n} \minus{} a_{1}x^{n \minus{} 1} \plus{} ... \minus{} a_{n \minus{} 1}x \minus{} a_{n}$ has preceisely 1 positive real root $ R$. (b) let $ A \equal{} \sum_{i \equal{} 1}^n a_{i}$ and $ B \equal{} \sum_{i \equal{} 1}^n ia_{i}$. Show that $ A^{A} \leq R^{B}$.
Prove that : $\left|\sum_{i=0}^n \left(1-\pi \sin \frac{i\pi}{4n}\cos \frac{i\pi}{4n}\right)\right|<1.$
The ratio of the length to the width of a rectangle is $4:3$. If the rectangle has diagonal of length $d$, then the area may be expressed as $kd^2$ for some constant $k$. What is $k$? $\textbf{(A) }\dfrac27\qquad\textbf{(B) }\dfrac37\qquad\textbf{(C) }\dfrac{12}{25}\qquad\textbf{(D) }\dfrac{16}{25}\qquad\textbf{(E) }\dfrac34$
Find the largest possible value of $M$ for which $\frac{x}{1+\frac{yz}{x}}+\frac{y}{1+\frac{zx}{y}}+\frac{z}{1+\frac{xy}{z}}\geq M$ for all $x,y,z>0$ with $xy+yz+zx=1$
A function $f$ is defined on the set of all real numbers except $0$ and takes all real values except $1$. It is also known that $\color{white}\ . \ \color{black}\ \quad f(xy)=f(x)f(-y)-f(x)+f(y)$ for any $x,y\not= 0$ and that $\color{white}\ . \ \color{black}\ \quad f(f(x))=\frac{1}{f(\frac{1}{x})}$ for any $x\not\in\{ 0,1\}$. Determine all such functions $f$.
Find all functions $ f: \mathbb Q\longrightarrow\mathbb Q$ such that: $ f(x)+f(\frac1x)=1$ $ 2f(f(x))=f(2x)$
Let $ A,B$ be different points on a parabola. Prove that we can find $ P_1,P_2,\dots,P_{n}$ between $ A,B$ on the parabola such that area of the convex polygon $ AP_1P_2\dots P_nB$ is maximum. In this case prove that the ratio of $ S(AP_1P_2\dots P_nB)$ to the sector between $ A$ and $ B$ doesn't depend on $ A$ and $ B$, and only depends on $ n$.
Find all functions $f:\mathbb{Z}\rightarrow\mathbb{Z}$ such that for any $x,y$ the following is true: $$f(x+y+f(y))=f(x)+2y$$ [I]proposed by F. Petrov[/i]
Let real coefficient polynomial $f(x) = x^n + a_1 \cdot x^{n-1} + \ldots + a_n$ has real roots $b_1, b_2, \ldots, b_n$, $n \geq 2,$ prove that $\forall x \geq max\{b_1, b_2, \ldots, b_n\}$, we have \[f(x+1) \geq \frac{2 \cdot n^2}{\frac{1}{x-b_1} + \frac{1}{x-b_2} + \ldots + \frac{1}{x-b_n}}.\]
Let $f(x)$ is such function, that $f(x)=1$ for integer $x$ and $f(x)=0$ for non integer $x$. Build such function using only variable $x$, integer numbers, and operations $+,-,*,/,[.]$(plus, minus, multiply,divide and integer part)
Let $k$ be a positive integer. Find the maximum value of \[a^{3k-1}b+b^{3k-1}c+c^{3k-1}a+k^2a^kb^kc^k,\] where $a$, $b$, $c$ are non-negative reals such that $a+b+c=3k$.
Let $f$ and $g$ be two functions such that \[f(x)=\frac{1}{\lfloor | x | \rfloor}, \quad g(x)=\frac{1}{|\lfloor x \rfloor |}.\] Find the domains of $f$ and $g$ and then prove that \[\lim_{x \to -1^+} f(x)= \lim_{x \to 1^- } g(x).\]