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

Let $\phi(n)$ denote the number of positive integers less than or equal to $n$ and relatively prime to $n$. Find all natural numbers $n$ and primes $p$ such that $\phi(n)=\phi(np)$.
Let $ S$ be the set of points in the Cartesian plane that satisfy \[ \Big|\big|{|x| \minus{} 2}\big| \minus{} 1\Big| \plus{} \Big|\big|{|y| \minus{} 2}\big| \minus{} 1\Big| \equal{} 1. \] If a model of $ S$ were built from wire of negligible thickness, then the total length of wire required would be $ a\sqrt {b},$ where $ a$ and $ b$ are positive integers and $ b$ is not divisible by the square of any prime number. Find $ a \plus{} b.$
Let $f$ be a real-valued function such that \[f(x)+2f\left(\dfrac{2002}x\right)=3x\] for all $x>0$. Find $f(2)$. $\textbf{(A) }1000\qquad\textbf{(B) }2000\qquad\textbf{(C) }3000\qquad\textbf{(D) }4000\qquad\textbf{(E) }6000$
Let $n \geq 2$ be a positive integer and $a_{1},\ldots , a_{n}$ be positive real numbers such that $a_{1}+...+a_{n}= 1$. Prove that: \[\frac{a_{1}}{1+a_{2}+\cdots +a_{n}}+\cdots +\frac{a_{n}}{1+a_{1}+a_{2}+\cdots +a_{n-1}}\geq \frac{n}{2n-1}\]
The smallest value of the function $f(x) =|x| +\left|\frac{1 - 2013x}{2013 - x}\right|$ where $x \in [-1, 1] $ is: (A): $\frac{1}{2012}$, (B): $\frac{1}{2013}$, (C): $\frac{1}{2014}$, (D): $\frac{1}{2015}$, (E): None of the above.
Let us define a function $f:\mathbb N\to\mathbb N_0$ by $f(1)=0$ and, for all $n\in\mathbb N$, $$f(2n)=2f(n)+1,\qquad f(2n+1)=2f(n).$$Given a positive integer $p$, define a sequence $(u_n)$ by $u_0=p$ and $u_{k+1}=f(u_k)$ whenever $u_k\ne0$. (a) Prove that, for each $p\in\mathbb N$, there is a unique integer $v(p)$ such that $u_{v(p)}=0$. (b) Compute $v(1994)$. What is the smallest integer $p>0$ for which $v(p)=v(1994)$. (c) Given an integer $N$, determine the smallest integer $p$ such that $v(p)=N$.
Let $f$, $g$, $h : [a, b] \to \mathbb{R}$, three integrable functions such that:$$\int \limits_a^b fgdx=\int \limits_a^bghdx=\int \limits_a^bhfdx=\int \limits_a^bg^2dx\int \limits_a^bh^2dx=1$$Then$$\int \limits_a^bg^2dx=\int \limits_a^bh^2dx=1$$
Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ f(f(x \plus{} y)) \equal{} f(x \plus{} y) \plus{} f(x)f(y) \minus{} xy\] for all real numbers $x$ and $y$.
Find the number of self-maps of a set of $ 5 $ elements having the property that the preimage of any element of this set has $ 2 $ elements at most. [i]Adrian Zanoschi[/i]
Let $\overline{a_1a_2a_3\ldots a_n}$ be the representation of a $n-$digits number in base $10.$ Prove that there exists a one-to-one function like $f : \{0, 1, 2, 3, \ldots, 9\} \to \{0, 1, 2, 3, \ldots, 9\}$ such that $f(a_1) \neq 0$ and the number $\overline{ f(a_1)f(a_2)f(a_3) \ldots f(a_n) }$ is divisible by $3.$
How many handles has the Riemann surface of the function \[w=\sqrt{1+z^n}\]
Let $f : \mathbb N \to \mathbb N$ be an injective function such that there exists a positive integer $k$ for which $f(n) \leq n^k$. Prove that there exist infinitely many primes $q$ such that the equation $f(x) \equiv 0 \pmod q$ has a solution in prime numbers.
Let $\mathbb{R}^+$ denote the set of positive real numbers. Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ such that for any $x,y\in\mathbb{R}^+$, we have \[ f(x)f(y)=f(y)f\Big(xf(y)\Big)+\frac{1}{xy}.\]
Find all functions $f: \mathbb{R} \to \mathbb{R}$ satisfying \[f(x+f(y))-f(x)=(x+f(y))^4-x^4\] for all $x,y \in \mathbb{R}$.
Find all the functions $f(x),$ continuous on the whole real axis, such that for every real $x$ \[f(3x-2)\leq f(x)\leq f(2x-1).\] [i]Proposed by A. Golovanov[/i]
Given two integers $m,n$ which are greater than $1$. $r,s$ are two given positive real numbers such that $r<s$. For all $a_{ij}\ge 0$ which are not all zeroes,find the maximal value of the expression \[f=\frac{(\sum_{j=1}^{n}(\sum_{i=1}^{m}a_{ij}^s)^{\frac{r}{s}})^{\frac{1}{r}}}{(\sum_{i=1}^{m})\sum_{j=1}^{n}a_{ij}^r)^{\frac{s}{r}})^{\frac{1}{s}}}.\]
Let $a,b,c$ be positive real numbers such that \[ \cfrac{1}{1+a}+\cfrac{1}{1+b}+\cfrac{1}{1+c}\le 1. \] Prove that $(1+a^2)(1+b^2)(1+c^2)\ge 125$. When does equality hold?
If $\sin x+\cos x=1/5$ and $0\le x<\pi$, then $\tan x$ is $\textbf{(A) }-\frac{4}{3}\qquad\textbf{(B) }-\frac{3}{4}\qquad\textbf{(C) }\frac{3}{4}\qquad\textbf{(D) }\frac{4}{3}\qquad$ $\textbf{(E) }\text{not completely determined by the given information}$
Let $p$ and $k$ be positive integers such that $p$ is prime and $k>1$. Prove that there is at most one pair $(x,y)$ of positive integers such that $x^k+px=y^k$.
We call the set $A\in \mathbb R^n$ CN if and only if for every continuous $f:A\to A$ there exists some $x\in A$ such that $f(x)=x$. a) Example: We know that $A = \{ x\in\mathbb R^n | |x|\leq 1 \}$ is CN. b) The circle is not CN. Which one of these sets are CN? 1) $A=\{x\in\mathbb R^3| |x|=1\}$ 2) The cross $\{(x,y)\in\mathbb R^2|xy=0,\ |x|+|y|\leq1\}$ 3) Graph of the function $f:[0,1]\to \mathbb R$ defined by \[f(x)=\sin\frac 1x\ \mbox{if}\ x\neq0,\ f(0)=0\]
Let $f$ be any function that maps the set of real numbers into the set of real numbers. Prove that there exist real numbers $x$ and $y$ such that \[f\left(x-f(y)\right)>yf(x)+x\] [i]Proposed by Igor Voronovich, Belarus[/i]
Let $U$ be a random variable that is uniformly distributed on the interval $[0,1]$, and let \[S_n= 2\sum_{k=1}^n \sin(2kU\pi).\] Show that, as $n\to \infty$, the limit distribution of $S_n$ is the Cauchy distribution with density function $f(x)=\frac1{\pi(1+x^2)}$.
Prove that if $0<x<\frac{\pi}{2}$ and $n>m$, where $n$,$m$ are natural numbers, \[ 2 \left| \sin^n x - \cos^n x \right| \le 3 \left| \sin^m x - \cos^m x \right|.\]
Find all functions $ f:\mathbb{N}\longrightarrow\mathbb{N} $ that satisfy the following relation: $$ f(x)^2+y\vdots x^2+f(y) ,\quad\forall x,y\in\mathbb{N} . $$
Find all $f: R\rightarrow R$ such that (i) The set $\{\frac{f(x)}{x}| x\in R-\{0\}\}$ is finite (ii) $f(x-1-f(x)) = f(x)-1-x$ for all $x$