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

2001 Irish Math Olympiad, 5

Tags: function , algebra
Determine all functions $ f: \mathbb{N} \rightarrow \mathbb{N}$ which satisfy: $ f(x\plus{}f(y))\equal{}f(x)\plus{}y$ for all $ x,y \in \mathbb{N}$.

1974 Czech and Slovak Olympiad III A, 1

Let $\left(a_k\right)_{k=1}^\infty$ be a sequence of positive numbers such that \[a_{k-1}a_{k+1}\ge a_k^2\] for all $k>1.$ For $n\ge1$ denote \[b_n=\left(a_1a_2\cdots a_n\right)^{1/n}.\] Show that also the inequality \[b_{n-1}b_{n+1}\ge b_n^2\] holds for every $n>1.$

2017 All-Russian Olympiad, 2

$a,b,c$ - different natural numbers. Can we build quadratic polynomial $P(x)=kx^2+lx+m$, with $k,l,m$ are integer, $k>0$ that for some integer points it get values $a^3,b^3,c^3$ ?

2008 Princeton University Math Competition, 7

Tags: algebra
The graphs of the following equations divide the $xy$ plane into some number of regions. $4 + (x + 2)y =x^2$ $(x + 2)^2 + y^2 =16$ Find the area of the second smallest region.

2024 Belarusian National Olympiad, 11.2

$29$ quadratic polynomials $f_1(x), \ldots, f_{29}(x)$ and $15$ real numbers $x_1<x_2<\ldots<x_{15}$ are given. Prove that for some two given polynomials $f_i(x)$ and $f_j(x)$ the following inequality holds: $$\sum_{k=1}^{14} (f_i(x_{k+1})-f_i(x_k))(f_j(x_{k+1})-f_j(x_k))>0$$ [i]A. Voidelevich[/i]

2021 Iran Team Selection Test, 4

Find all functions $f : \mathbb{N} \rightarrow \mathbb{R}$ such that for all triples $a,b,c$ of positive integers the following holds : $$f(ac)+f(bc)-f(c)f(ab) \ge 1$$ Proposed by [i]Mojtaba Zare[/i]

2013 Putnam, 3

Suppose that the real numbers $a_0,a_1,\dots,a_n$ and $x,$ with $0<x<1,$ satisfy \[\frac{a_0}{1-x}+\frac{a_1}{1-x^2}+\cdots+\frac{a_n}{1-x^{n+1}}=0.\] Prove that there exists a real number $y$ with $0<y<1$ such that \[a_0+a_1y+\cdots+a_ny^n=0.\]

2016 CMIMC, 2

Tags: logarithm , algebra
Suppose that some real number $x$ satisfies \[\log_2 x + \log_8 x + \log_{64} x = \log_x 2 + \log_x 16 + \log_x 128.\] Given that the value of $\log_2 x + \log_x 2$ can be expressed as $\tfrac{a\sqrt{b}}{c}$, where $a$ and $c$ are coprime positive integers and $b$ is squarefree, compute $abc$.

2013 Iran Team Selection Test, 3

For nonnegative integers $m$ and $n$, define the sequence $a(m,n)$ of real numbers as follows. Set $a(0,0)=2$ and for every natural number $n$, set $a(0,n)=1$ and $a(n,0)=2$. Then for $m,n\geq1$, define \[ a(m,n)=a(m-1,n)+a(m,n-1). \] Prove that for every natural number $k$, all the roots of the polynomial $P_{k}(x)=\sum_{i=0}^{k}a(i,2k+1-2i)x^{i}$ are real.

2010 Thailand Mathematical Olympiad, 6

Let $f : R \to R$ be a function satisfying the functional equation $f(3x + y) + f(3x-y) = f(x + y) + f(x - y) + 16f(x)$ for all reals $x, y$. Show that $f$ is even, that is, $f(-x) = f(x)$ for all reals $x$

2017 Taiwan TST Round 1, 5

Let $n$ be an odd number larger than 1, and $f(x)$ is a polynomial with degree $n$ such that $f(k)=2^k$ for $k=0,1,\cdots,n$. Prove that there is only finite integer $x$ such that $f(x)$ is the power of two.

2002 Balkan MO, 4

Determine all functions $f: \mathbb N\to \mathbb N$ such that for every positive integer $n$ we have: \[ 2n+2001\leq f(f(n))+f(n)\leq 2n+2002. \]

1966 Miklós Schweitzer, 8

Prove that in Euclidean ring $ R$ the quotient and remainder are always uniquely determined if and only if $ R$ is a polynomial ring over some field and the value of the norm is a strictly monotone function of the degree of the polynomial. (To be precise, there are two trivial cases: $ R$ can also be a field or the null ring.) [i]E. Fried[/i]

2024 Mozambique National Olympiad, P2

Prove that if $a+b+c=0$ then $a^3+b^3+c^3=3abc$

2003 Gheorghe Vranceanu, 1

For a real number $ k\ge 2, $ solve the equation $ \frac{\{x\}[x]}{x} =k. $

2012 India National Olympiad, 6

Let $f : \mathbb{Z} \to \mathbb{Z}$ be a function satisfying $f(0) \ne 0$, $f(1) = 0$ and $(i) f(xy) + f(x)f(y) = f(x) + f(y)$ $(ii)\left(f(x-y) - f(0)\right ) f(x)f(y) = 0 $ for all $x,y \in \mathbb{Z}$, simultaneously. $(a)$ Find the set of all possible values of the function $f$. $(b)$ If $f(10) \ne 0$ and $f(2) = 0$, find the set of all integers $n$ such that $f(n) \ne 0$.

2009 Mathcenter Contest, 1

Let $m,n$ be natural numbers. Prove that $$m^{m^{m^m}}+n^{n^{n^n}}\geq m^{n^{n^n}}+ n^{m^{m^m}}$$ [i](nooonuii)[/i]

2022 MOAA, 9

Tags: algebra
Emily has two cups $A$ and $B$, each of which can hold $400$ mL, A initially with $200$ mL of water and $B$ initially with $300$ mL of water. During a round, she chooses the cup with more water (randomly picking if they have the same amount), drinks half of the water in the chosen cup, then pours the remaining half into the other cup and refills the chosen cup to back to half full. If Emily goes for $20$ rounds, how much water does she drink, to the nearest integer?

1956 Moscow Mathematical Olympiad, 326

a) In the decimal expression of a positive number, $a$, all decimals beginning with the third after the decimal point, are deleted (i.e., we take an approximation of $a$ with accuracy to $0.01$ with deficiency). The number obtained is divided by $a$ and the quotient is similarly approximated with the same accuracy by a number $b$. What numbers $b$ can be thus obtained? Write all their possible values. b) same as (a) but with accuracy to $0.001$ c) same as (a) but with accuracy to $0.0001$

2012 Putnam, 5

Let $\mathbb{F}_p$ denote the field of integers modulo a prime $p,$ and let $n$ be a positive integer. Let $v$ be a fixed vector in $\mathbb{F}_p^n,$ let $M$ be an $n\times n$ matrix with entries in $\mathbb{F}_p,$ and define $G:\mathbb{F}_p^n\to \mathbb{F}_p^n$ by $G(x)=v+Mx.$ Let $G^{(k)}$ denote the $k$-fold composition of $G$ with itself, that is, $G^{(1)}(x)=G(x)$ and $G^{(k+1)}(x)=G(G^{(k)}(x)).$ Determine all pairs $p,n$ for which there exist $v$ and $M$ such that the $p^n$ vectors $G^{(k)}(0),$ $k=1,2,\dots,p^n$ are distinct.

2007 All-Russian Olympiad, 2

Given polynomial $P(x) = a_{0}x^{n}+a_{1}x^{n-1}+\dots+a_{n-1}x+a_{n}$. Put $m=\min \{ a_{0}, a_{0}+a_{1}, \dots, a_{0}+a_{1}+\dots+a_{n}\}$. Prove that $P(x) \ge mx^{n}$ for $x \ge 1$. [i]A. Khrabrov [/i]

2018 Purple Comet Problems, 19

Tags: algebra
Suppose that $a$ and $b$ are positive real numbers such that $3\log_{101}\left(\frac{1,030,301-a-b}{3ab}\right) = 3 - 2 \log_{101}(ab)$. Find $101 - \sqrt[3]{a}- \sqrt[3]{b}$.

1999 Brazil Team Selection Test, Problem 2

If $a,b,c,d$ are Distinct Real no. such that $a = \sqrt{4+\sqrt{5+a}}$ $b = \sqrt{4-\sqrt{5+b}}$ $c = \sqrt{4+\sqrt{5-c}}$ $d = \sqrt{4-\sqrt{5-d}}$ Then $abcd = $

2021 BMT, 17

Tags: algebra
Simplify $\sqrt[4]{17 + 12\sqrt2} - \sqrt[4]{17 - 12\sqrt2}$.

2005 Germany Team Selection Test, 2

For any positive integer $ n$, prove that there exists a polynomial $ P$ of degree $ n$ such that all coeffients of this polynomial $ P$ are integers, and such that the numbers $ P\left(0\right)$, $ P\left(1\right)$, $ P\left(2\right)$, ..., $ P\left(n\right)$ are pairwisely distinct powers of $ 2$.