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

Find all solutions to the equation: \[ \left(\left\lfloor x+\frac{7}{3} \right\rfloor \right)^2-\left\lfloor x-\frac{9}{4} \right\rfloor = 16 \]
Let $S$ be the set of all subsets of the positive integers. Construct a function $f \colon \mathbb{R} \rightarrow S$ such that $f(a)$ is a proper subset of $f(b)$ whenever $a <b.$
Let $ Q^\plus{}$ denote the set of positive rational numbers. Show that there exists one and only one function $f: Q^\plus{}\to Q^\plus{}$ satisfying the following conditions: (i) If $ 0<q<1/2$ then $ f(q)\equal{}1\plus{}f(q/(1\minus{}2q))$, (ii) If $ 1<q\le2$ then $ f(q)\equal{}1\plus{}f(q\minus{}1)$, (iii) $ f(q)\cdot f(1/q)\equal{}1$ for all $ q\in Q^\plus{}$.
If $a$, $b$, $c$ are positive reals such that $a+b+c=1$, prove that \[\frac{1+a}{1-a}+\frac{1+b}{1-b}+\frac{1+c}{1-c}\leq 2\left(\frac{b}{a}+\frac{c}{b}+\frac{a}{c}\right).\]
Let $f: \mathbb{Z} \rightarrow \{-1,1\}$ be a function such that \[ f(mn) =f(m)f(n),\ \forall m,n \in \mathbb{Z}. \] Show that there exists a positive integer $a$ such that $1 \leq a \leq 12$ and $f(a) = f(a + 1) = 1$.
A sequence $(a_n)_0^N$ of real numbers is called concave if $2a_n\ge a_{n-1} + a_{n+1}$ for all integers $n, 1 \le n \le N - 1$. $(a)$ Prove that there exists a constant $C >0$ such that \[\left(\displaystyle\sum_{n=0}^{N}a_n\right)^2\ge C(N - 1)\displaystyle\sum_{n=0}^{N}a_n^2\:\:\:\:\:(1)\] for all concave positive sequences $(a_n)^N_0$ $(b)$ Prove that $(1)$ holds with $C = \frac{3}{4}$ and that this constant is best possible.
Suppose that $ a$,$ b$,$ c$ be three positive real numbers such that $ a\plus{}b\plus{}c\equal{}3$ . Prove that : $ \frac{1}{2\plus{}a^{2}\plus{}b^{2}}\plus{}\frac{1}{2\plus{}b^{2}\plus{}c^{2}}\plus{}\frac{1}{2\plus{}c^{2}\plus{}a^{2}} \leq \frac{3}{4}$
Determine all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that, for all real numbers $x$ and $y$, $$f(x)(x+f(f(y))) = f(x^2)+xf(y)$$
Let $f,g:[a,b]\to [0,\infty)$ be two continuous and non-decreasing functions such that each $x\in [a,b]$ we have \[ \int^x_a \sqrt { f(t) }\ dt \leq \int^x_a \sqrt { g(t) }\ dt \ \ \textrm{and}\ \int^b_a \sqrt {f(t)}\ dt = \int^b_a \sqrt { g(t)}\ dt. \] Prove that \[ \int^b_a \sqrt { 1+ f(t) }\ dt \geq \int^b_a \sqrt { 1 + g(t) }\ dt. \]
Source: 1976 Euclid Part A Problem 6 ----- The $y$-intercept of the graph of the function defined by $y=\frac{4(x+3)(x-2)-24}{(x+4)}$ is $\textbf{(A) } -24 \qquad \textbf{(B) } -12 \qquad \textbf{(C) } 0 \qquad \textbf{(D) } -4 \qquad \textbf{(E) } -48$
Positive numbers $a,\ b,\ c$ satisfy $\dfrac{1}{a}+\dfrac{1}{b}+\dfrac{1}{c}=3$. Prove the inequality \[\dfrac{1}{\sqrt{a^3+1}}+\dfrac{1}{\sqrt{b^3+1}}+\dfrac{1}{\sqrt{c^3+1}}\le \dfrac{3}{\sqrt{2}}. \] [i](N. Alexandrov)[/i]
Does there exist a real $3\times 3$ matrix $A$ such that $\text{tr}(A)=0$ and $A^2+A^t=I?$ ($\text{tr}(A)$ denotes the trace of $A,\ A^t$ the transpose of $A,$ and $I$ is the identity matrix.) [i]Proposed by Moubinool Omarjee, Paris[/i]
How many of the first 1000 positive integers can be expressed in the form \[ \lfloor 2x \rfloor + \lfloor 4x \rfloor + \lfloor 6x \rfloor + \lfloor 8x \rfloor, \] where $x$ is a real number, and $\lfloor z \rfloor$ denotes the greatest integer less than or equal to $z$?
Find all functions $f : \mathbb{R} \to \mathbb{R}$ that satisfy the condition \[f(f(x) + y) = 2x + f(f(y) - x)\quad \text{ for all } x, y \in\mathbb{R}.\]
Let $k$ be a positive integer, and set $n=2^k$, $N=\{1, 2, \cdots, n\}$. For any bijective function $f:N\rightarrow N$, if a set $A\subset N$ contains an element $a\in A$ such that $\{a, f(a), f(f(a)), \cdots\} = A$, then we call $A$ as a cycle of $f$. Prove that: among all bijective functions $f:N\rightarrow N$, at least $\frac{n!}{2}$ of them have number of cycles less than or equal to $2k-1$. [i]Note: A function is bijective if and only if it is injective and surjective; in other words, it is 1-1 and onto.[/i] [i]Proposed by CSJL[/i]
Find all functions $f$ defined for all $x$ that satisfy the condition $xf(y) + yf(x) = (x + y)f(x)f(y),$ for all $x$ and $y.$ Prove that exactly two of them are continuous.
For a positive integer $n$, let $a_1, a_2, \ldots a_n$ be nonnegative real numbers such that for all real numbers $x_1>x_2>\ldots>x_n>0$ with $x_1+x_2+\ldots+x_n<1$, the inequality $\sum_{k=1}^na_kx_k^3<1$ holds. Show that \[na_1+(n-1)a_2+\ldots+(n-j+1)a_j+\ldots+a_n\leqslant\frac{n^2(n+1)^2}{4}.\]
Suppose that a function $f(x)$ defined in $-1<x<1$ satisfies the following properties (i) , (ii), (iii). (i) $f'(x)$ is continuous. (ii) When $-1<x<0,\ f'(x)<0,\ f'(0)=0$, when $0<x<1,\ f'(x)>0$. (iii) $f(0)=-1$ Let $F(x)=\int_0^x \sqrt{1+\{f'(t)\}^2}dt\ (-1<x<1)$. If $F(\sin \theta)=c\theta\ (c :\text{constant})$ holds for $-\frac{\pi}{2}<\theta <\frac{\pi}{2}$, then find $f(x)$. [i]1975 Waseda University entrance exam/Science and Technology[/i]
Fix a positive real number $c>1$ and positive integer $n$. Initially, a blackboard contains the numbers $1,c,\ldots, c^{n-1}$. Every minute, Bob chooses two numbers $a,b$ on the board and replaces them with $ca+c^2b$. Prove that after $n-1$ minutes, the blackboard contains a single number no less than \[\left(\dfrac{c^{n/L}-1}{c^{1/L}-1}\right)^L,\] where $\phi=\tfrac{1+\sqrt 5}2$ and $L=1+\log_\phi(c)$.
Find all functions $f:\mathbb{Z} \to \mathbb{Z}$ such that for all $m\in\mathbb{Z}$: [list][*] $f(m+8) \le f(m)+8$, [*] $f(m+11) \ge f(m)+11$.[/list]
The polynomial $P(x)=a_0+a_1x+a_2x^2+...+a_8x^8+2009x^9$ has the property that $P(\tfrac{1}{k})=\tfrac{1}{k}$ for $k=1,2,3,4,5,6,7,8,9$. There are relatively prime positive integers $m$ and $n$ such that $P(\tfrac{1}{10})=\tfrac{m}{n}$. Find $n-10m$.
Given a prime number $p\ge 3,$ and an integer $d \ge 1$. Prove that there exists an integer $n\ge 1,$ such that $\gcd(n,d) = 1,$ and the product \[P=\prod\limits_{1 \le i < j < p} {({i^{n + j}} - {j^{n + i}})} \text{ is not divisible by } p^n.\]
For a particular peculiar pair of dice, the probabilities of rolling 1, 2, 3, 4, 5 and 6 on each die are in the ratio $ 1: 2: 3: 4: 5: 6$. What is the probability of rolling a total of 7 on the two dice? $ \textbf{(A) } \frac 4{63} \qquad \textbf{(B) } \frac 18 \qquad \textbf{(C) } \frac 8{63} \qquad \textbf{(D) } \frac 16 \qquad \textbf{(E) } \frac 27$
Let $p$ be a prime number. Determine the maximal degree of a polynomial $T(x)$ whose coefficients belong to $\{ 0,1,\cdots,p-1 \}$, whose degree is less than $p$, and which satisfies \[T(n)=T(m) \; \pmod{p}\Longrightarrow n=m \; \pmod{p}\] for all integers $n, m$.
Determine all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ that satisfy the following equation for all $x, y \in \mathbb{R}$. $$(x+y)f(x-y) = f(x^2-y^2).$$