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

Let $\mathbb{N}$ denote the set of all positive integers. An ordered pair $(a;b)$ of numbers $a,b\in\mathbb{N}$ is called [i]interesting[/i], if for any $n\in\mathbb{N}$ there exists $k\in\mathbb{N}$ such that the number $a^k+b$ is divisible by $2^n$. Find all [i]interesting[/i] ordered pairs of numbers.
If $ a,b,c $ are all in the interval $ (0,1) $ or all in the interval $ \left( 1,\infty \right), $ then $$ 1\le\sum_{\text{cyc}} \frac{\log_a^7 b\cdot \log_b^3c}{\log_c a +2\log_a b} . $$ [i]Gheorghe Duță[/i]
For a given positive integer $k$ denote the square of the sum of its digits by $f_{1}(k)$ and let $f_{n+1}(k)=f_{1}(f_{n}(k))$. Determine the value of $f_{1991}(2^{1990})$.
Let $P$ be the number of ways to partition $2013$ into an ordered tuple of prime numbers. What is $\log_2 (P)$? If your answer is $A$ and the correct answer is $C$, then your score on this problem will be $\left\lfloor\frac{125}2\left(\min\left(\frac CA,\frac AC\right)-\frac35\right)\right\rfloor$ or zero, whichever is larger.
Let $0<a<\frac {\pi}2.$ Find $\lim_{a\rightarrow +0} \frac{1}{a^3}\int_0^a \ln\ (1+\tan a\tan x)\ dx.$
For a constant $c$, a sequence $a_n$ is defined by $a_n=\int_c^1 nx^{n-1}\left(\ln \left(\frac{1}{x}\right)\right)^n dx\ (n=1,\ 2,\ 3,\ \cdots).$ Find $\lim_{n\to\infty} a_n$.
The logarithm of $.0625$ to the base $2$ is: $ \textbf{(A)}\ .025 \qquad\textbf{(B)}\ .25\qquad\textbf{(C)}\ 5\qquad\textbf{(D)}\ -4\qquad\textbf{(E)}\ -2 $
Calculate \[ \lim_{x \to 0^+} \left( x^{x^x} - x^x \right). \]
Prove that if $ a,x,y$ are $ p$-adic integers different from $ 0$ and $ p | x, pa | xy$, then \[ \frac 1y \frac{(1\plus{}x)^y\minus{}1}{x} \equiv \frac{\log (1\plus{}x)}{x} \;\;\;\; ( \textrm{mod} \; a\ ) \\\\ .\] [i]L. Redei[/i]
Let $d$ be a positive integer and let $\varepsilon$ be any positive real. Prove that for all sufficiently large primes $p$ with $\gcd(p-1,d) \neq 1$, there exists an positive integer less than $p^r$ which is not a $d$th power modulo $p$, where $r$ is defined by \[ \log r = \varepsilon - \frac{1}{\gcd(d,p-1)}. \][i]Proposed by Shashwat Kishore[/i]
Find the infinite integrals as follows. (1) 2013 Hiroshima City University entrance exam/Informatic Science $\int \frac{x^2}{2-x^2}dx$ (2) 2013 Kanseigakuin University entrance exam/Science and Technology $\int x^4\ln x\ dx$ (3) 2013 Shinsyu University entrance exam/Textile Science and Technology, Second-exam $\int \frac{\cos ^ 3 x}{\sin ^ 2 x}\ dx$
Suppose $x$ is a random real number between $1$ and $4$, and $y$ is a random real number between $1$ and $9$. If the expected value of \[ \left\lceil \log_2 x \right\rceil - \left\lfloor \log_3 y \right\rfloor \] can be expressed as $\frac mn$ where $m$ and $n$ are relatively prime positive integers, compute $100m + n$. [i]Proposed by Lewis Chen[/i]
If one uses only the tabular information $10^3=1000$, $10^4=10,000$, $2^{10}=1024$, $2^{11}=2048$, $2^{12}=4096$, $2^{13}=8192$, then the strongest statement one can make for $\log_{10}{2}$ is that it lies between: $\textbf{(A)}\ \frac{3}{10} \; \text{and} \; \frac{4}{11}\qquad \textbf{(B)}\ \frac{3}{10} \; \text{and} \; \frac{4}{12}\qquad \textbf{(C)}\ \frac{3}{10} \; \text{and} \; \frac{4}{13}\qquad \textbf{(D)}\ \frac{3}{10} \; \text{and} \; \frac{40}{132}\qquad \textbf{(E)}\ \frac{3}{11} \; \text{and} \; \frac{40}{132}$
Let $ 1<a_1<a_2< \ldots <a_n<x$ be positive integers such that $ \sum_{i\equal{}1}^n 1/a_i \leq 1$. Let $ y$ denote the number of positive integers smaller that $ x$ not divisible by any of the $ a_i$. Prove that \[ y > \frac{cx}{\log x}\] with a suitable positive constant $ c$ (independent of $ x$ and the numbers $ a_i$). [i]I. Z. Ruzsa[/i]
Prove the following inequality: \[\int_1^e \frac{(\ln x)^{2009}}{x^2}dx>\frac{1}{2010\cdot 2011\cdot2012}\] created by kunny
$b_0, b_1, b_2, \dots$ is a sequence of positive reals such that the sequence $b_0,c b_1, c^2b_2,c^3b_3,\dots$ is convex for all $c > 0$. (A sequence is convex if each term is at most the arithmetic mean of its two neighbors.) Show that $\ln b_0, \ln b_1, \ln b_2, \dots$ is convex.
Let $m>1$ and $n>1$ be integers. Suppose that the product of the solutions for $x$ of the equation \[8(\log_n x)(\log_m x) - 7 \log_n x - 6 \log_m x - 2013 = 0\] is the smallest possible integer. What is $m+n$? ${ \textbf{(A)}\ 12\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 24\qquad\textbf{(D}}\ 48\qquad\textbf{(E)}\ 272 $
Evaluate ${ \int_0^{\frac{\pi}{8}}\frac{\cos x}{\cos (x-\frac{\pi}{8}})}\ dx$.
Define $ f: \mathbb{R}\to\mathbb{R}$ by \[ f(x)\equal{}\begin{cases}x&\text{if }x\le e\\ xf(\ln x)&\text{if }x>e\end{cases}\] Does $ \displaystyle\sum_{n\equal{}1}^{\infty}\frac1{f(n)}$ converge?
For a positive integer $n$, two payers $A$ and $B$ play the following game: Given a pile of $s$ stones, the players take turn alternatively with $A$ going first. On each turn the player is allowed to take either one stone, or a prime number of stones, or a positive multiple of $n$ stones. The winner is the one who takes the last stone. Assuming both $A$ and $B$ play perfectly, for how many values of $s$ the player $A$ cannot win?
The set of $ x$-values satisfying the equation $ x^{\log_{10} x} \equal{} \frac{x^3}{100}$ consists of: $ \textbf{(A)}\ \frac{1}{10} \qquad \textbf{(B)}\ \text{10, only} \qquad \textbf{(C)}\ \text{100, only} \qquad \textbf{(D)}\ \text{10 or 100, only} \qquad \textbf{(E)}\ \text{more than two real numbers.}$
A plane curve is parameterized by $x(t)=\displaystyle\int_{t}^{\infty} \dfrac {\cos u}{u} \, \mathrm{d}u $ and $ y(t) = \displaystyle\int_{t}^{\infty} \dfrac {\sin u}{u} \, \mathrm{d}u $ for $ 1 \le t \le 2 $. What is the length of the curve?
For a positive integer $n$, an [i]$n$-branch[/i] $B$ is an ordered tuple $(S_1, S_2, \dots, S_m)$ of nonempty sets (where $m$ is any positive integer) satisfying $S_1 \subset S_2 \subset \dots \subset S_m \subseteq \{1,2,\dots,n\}$. An integer $x$ is said to [i]appear[/i] in $B$ if it is an element of the last set $S_m$. Define an [i]$n$-plant[/i] to be an (unordered) set of $n$-branches $\{ B_1, B_2, \dots, B_k\}$, and call it [i]perfect[/i] if each of $1$, $2$, \dots, $n$ appears in exactly one of its branches. Let $T_n$ be the number of distinct perfect $n$-plants (where $T_0=1$), and suppose that for some positive real number $x$ we have the convergence \[ \ln \left( \sum_{n \ge 0} T_n \cdot \frac{\left( \ln x \right)^n}{n!} \right) = \frac{6}{29}. \] If $x = \tfrac mn$ for relatively prime positive integers $m$ and $n$, compute $m+n$. [i]Proposed by Yang Liu[/i]
Let $m$ and $n$ be positive integers. Show that $\frac{(m+n)!}{(m+n)^{m+n}} < \frac{m!}{m^m}\cdot\frac{n!}{n^n}$
If $ y \equal{} \log_{a}{x}$, $ a > 1$, which of the following statements is incorrect? $\textbf{(A)}\ \text{If }x=1,y=0 \qquad\\ \textbf{(B)}\ \text{If }x=a,y=1 \qquad\\ \textbf{(C)}\ \text{If }x=-1,y\text{ is imaginary (complex)} \qquad\\ \textbf{(D)}\ \text{If }0<x<z,y\text{ is always less than 0 and decreases without limit as }x\text{ approaches zero} \qquad\\ \textbf{(E)}\ \text{Only some of the above statements are correct}$