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

Evaluate $\int^\infty_0\frac{\operatorname{arctan}(\pi x)-\operatorname{arctan}(x)}xdx$ (where $0\le\operatorname{arctan}(x)<\frac\pi2$ for $0\le x<\infty$).
Given a triangle with $ \triangle ABC $, with: $ \angle C = 36^o$ and $ \angle A = \angle B $. Consider the points $ D $ on $ BC $, $ E $ on $ AD $, $ F $ on $ BE $, $ G $ on $ DF $ and $ H $ on $ EG $, so that the rays $ AD, BE, DF, EG, FH $ bisect the angles $ A, B, D, E, F $ respectively. It is known that $ FH = 1 $. Calculate $ AC$.
A cylindrical tank with radius $ 4$ feet and height $ 9$ feet is lying on its side. The tank is filled with water to a depth of $ 2$ feet. What is the volume of the water, in cubic feet? $ \textbf{(A)}\ 24\pi \minus{} 36 \sqrt {2} \qquad \textbf{(B)}\ 24\pi \minus{} 24 \sqrt {3} \qquad \textbf{(C)}\ 36\pi \minus{} 36 \sqrt {3} \qquad \textbf{(D)}\ 36\pi \minus{} 24 \sqrt {2} \\ \textbf{(E)}\ 48\pi \minus{} 36 \sqrt {3}$
Find the number of 4 digit positive integers '$n$' that follow these. 1) the number of digit $ \le $ 6 2) $ 3 \mid n$, but $ 6 \nmid n $
A four-term sequence is formed by adding each term of a four-term arithmetic sequence of positive integers to the corresponding term of a four-term geometric sequence of positive integers. The first three terms of the resulting four-term sequence are 57, 60, and 91. What is the fourth term of this sequence? $\textbf{(A) }190\qquad\textbf{(B) }194\qquad\textbf{(C) }198\qquad\textbf{(D) }202\qquad\textbf{(E) }206$
Let $f(x)$ be a real-valued function, defined for $-1<x<1$ for which $f'(0)$ exists. Let $(a_n) , (b_n)$ be two sequences such that $-1 <a_n <0 <b_n <1$ for all $n$ and $\lim_{n \to \infty } a_n = 0 =\lim_{n \to \infty} b_n.$ Prove that $$ \lim_{n \to \infty} \frac{ f(b_n )- f(a_n ) }{b_n -a_n} =f'(0).$$
In the round robin chess tournament organized in a school every two students played one match among themselves. Find the minimal possible number of students in the school if each girl student has at least 21 wins in matches against boy students and each boy student has at least 12 wins in matches against girl students.
A square's area is equal to the perimeter of a $15$ by $17$ rectangle. What is this square's perimeter? $\textbf{(A) }20\qquad\textbf{(B) }32\qquad\textbf{(C) }36\qquad\textbf{(D) }40\qquad\textbf{(E) }56$
For positive integers $a, b, c$ (not necessarily distinct), suppose that $a+bc, b+ac, c+ab$ are all perfect squares. Show that $$a^2(b+c)+b^2(a+c)+c^2(a+b)+2abc$$ can be written as sum of two squares.
Find all pairs of prime numbers $(p,q)$, such that $\frac{(2p^2-1)^q+1}{p+q}$ and $\frac{(2q^2-1)^p+1}{p+q}$ are both integers.
A positive integer $n$ is called [i]naughty[/i] if it can be written in the form $n=a^b+b$ with integers $a,b \geq 2$. Is there a sequence of $102$ consecutive positive integers such that exactly $100$ of those numbers are naughty?
If we divide $2020$ by a prime $p$, the remainder is $6$. Determine the largest possible value of $p$.
Welcome to the [b]USAYNO[/b], where each question has a yes/no answer. Choose any subset of the following six problems to answer. If you answer $n$ problems and get them [b]all[/b] correct, you will receive $\max(0, (n-1)(n-2))$ points. If any of them are wrong (or you leave them all blank), you will receive $0$ points. Your answer should be a six-character string containing 'Y' (for yes), 'N' (for no), or 'B' (for blank). For instance if you think 1, 2, and 6 are 'yes' and 3 and 4 are 'no', you should answer YYNNBY (and receive $12$ points if all five answers are correct, 0 points if any are wrong). (a) $a,b,c,d,A,B,C,$ and $D$ are positive real numbers such that $\frac{a}{b} > \frac{A}{B}$ and $\frac{c}{d} > \frac{C}{D}$. Is it necessarily true that $\frac{a+c}{b+d} > \frac{A+C}{B+D}$? (b) Do there exist irrational numbers $\alpha$ and $\beta$ such that the sequence $\lfloor\alpha\rfloor+\lfloor\beta\rfloor, \lfloor2\alpha\rfloor+\lfloor2\beta\rfloor, \lfloor3\alpha\rfloor+\lfloor3\beta\rfloor, \dots$ is arithmetic? (c) For any set of primes $\mathbb{P}$, let $S_\mathbb{P}$ denote the set of integers whose prime divisors all lie in $\mathbb{P}$. For instance $S_{\{2,3\}}=\{2^a3^b \; | \; a,b\ge 0\}=\{1,2,3,4,6,8,9,12,\dots\}$. Does there exist a finite set of primes $\mathbb{P}$ and integer polynomials $P$ and $Q$ such that $\gcd(P(x), Q(y))\in S_\mathbb{P}$ for all $x,y$? (d) A function $f$ is called [b]P-recursive[/b] if there exists a positive integer $m$ and real polynomials $p_0(n), p_1(n), \dots, p_m(n)$[color = red], not all zero,[/color] satisfying \[p_m(n)f(n+m)=p_{m-1}(n)f(n+m-1)+\dots+p_0(n)f(n)\] for all $n$. Does there exist a P-recursive function $f$ satisfying $\lim_{n\to\infty} \frac{f(n)}{n^{\sqrt{2}}}=1$? (e) Does there exist a [b]nonpolynomial[/b] function $f: \mathbb{Z}\to\mathbb{Z}$ such that $a-b$ divides $f(a)-f(b)$ for all integers $a\neq b$? (f) Do there exist periodic functions $f, g:\mathbb{R}\to\mathbb{R}$ such that $f(x)+g(x)=x$ for all $x$? [color = red]A clarification was issued for problem 33(d) during the test. I have included it above.[/color]
For how many values of $n$ will an $n$-sided regular polygon have interior angles with integral degree measures? $ \textbf{(A)}\ 16 \qquad\textbf{(B)}\ 18 \qquad\textbf{(C)}\ 20 \qquad\textbf{(D)}\ 22 \qquad\textbf{(E)}\ 24 $
Andy chooses not necessarily distinct digits $G$, $U$, $N$, and $A$ such that the $5$ digit number $GUNGA$ is divisible by $44$. Find the least possible value of $G+U+N+G+A$. [i]Proposed by Andy Xu[/i]
Find all $x, y, z \in \left (0, \frac{1}{2}\right )$ such that $$ \begin{cases} (3 x^{2}+y^{2}) \sqrt{1-4 z^{2}} \geq z; \\ (3 y^{2}+z^{2}) \sqrt{1-4 x^{2}} \geq x; \\ (3 z^{2}+x^{2}) \sqrt{1-4 y^{2}} \geq y. \end{cases} $$ [i]Proposed by Ngo Van Trang, Vietnam[/i]
Arutyun and Amayak show another effective trick. A spectator writes down on a board a sequence of $N$ (decimal) digits. Amayak closes two adjacent digits by a black disc. Then Arutyun comes and says both closed digits (and their order). For which minimal $N$ they may show such a trick? [i]K. Knop, O. Leontieva[/i]
We are given a row of $n\geq7$ tiles. In the leftmost 3 tiles, there is a white piece each, and in the rightmost 3 tiles, there is a black piece each. The white and black players play in turns (the white starts). In each move, a player may take a piece of their color, and move it to an adjacent tile, so long as it's not occupied by a piece of the [u]same color[/u]. If the new tile is empty, nothing happens. If the tile is occupied by a piece of the [u]opposite color[/u], both pieces are destroyed (both white and black). The player who destroys the last two pieces wins the game. Which player has a winning strategy, and what is it? (The answer may depend on $n$)
Let $ABC$ be a triangle with $AB = 5$, $BC = 6$, and $AC = 7$. Let its orthocenter be $H$ and the feet of the altitudes from $A, B, C$ to the opposite sides be $D, E, F$ respectively. Let the line $DF$ intersect the circumcircle of $AHF$ again at $X$. Find the length of $EX$.
The following figure is made up of $12$ segments and $8$ circles. As you can see, at the beginning all the circles are empty. In each operation an empty circle is chosen, it is painted red and inside it the number of red neighboring circles that the chosen circle has is written (in the first operation the chosen circle is painted red and the number $0$ is written). After $8$ operations all the circles are painted red and each one has a number written on it. Prove that, no matter how the operations are done, the sum of all the numbers at the end is the same. [img]https://cdn.artofproblemsolving.com/attachments/3/a/8cd74a0fdc7bb9bc5d1bc764e80ffb58159c0c.png[/img]
Prove that there are infinitely many positive integers $m$ such that the number of odd distinct prime factor of $m(m+3)$ is a multiple of $3$.
Many states use a sequence of three letters followed by a sequence of three digits as their standard license-plate pattern. Given that each three-letter three-digit arrangement is equally likely, the probability that such a license plate will contain at least one palindrome (a three-letter arrangement or a three-digit arrangement that reads the same left-to-right as it does right-to-left) is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.
In the equilateral triangle $ABC$ ($AB = 2$), cevians are drawn that do not intersect at one point. It turned out that the pairwise intersection points of these cevians lie on the inscribed circle of triangle $ABC$. Find the length of the cevian segment from the vertex of the triangle to the nearest point of intersection with the circle.
What is the maximal possible number of roots on the interval (0,1) for a polynomial of degree 2022 with integer coefficients and with the leading coefficient equal to 1?
The sides of a convex regular polygon of $L + M + N$ sides are to be given draw in three colors: $L$ of them with a red stroke, $M$ with a yellow stroke, and $N$ with a blue. Express, through inequalities, the necessary and sufficient conditions so that there is a solution (several, in general) to the problem of doing it without leaving two adjacent sides drawn with the same color.