For how many ordered triplets of three positive integers is it true that their product is four more than twice their sum?

The number $1- \frac12 +\frac13-\frac14+...+\frac{1}{2n-1}-\frac{1}{2n}$ is represented as an irreducible fraction. If $3n+1$ is a prime number, prove that the numerator of this fraction is a multiple of $3n + 1$.

Let $ f, g$ and $ a$ be polynomials with real coefficients, $ f$ and $ g$ in one variable and $ a$ in two variables. Suppose \[ f(x) \minus{} f(y) \equal{} a(x, y)(g(x) \minus{} g(y)) \forall x,y \in \mathbb{R}\] Prove that there exists a polynomial $ h$ with $ f(x) \equal{} h(g(x)) \text{ } \forall x \in \mathbb{R}.$

There are given $1000$ integers $a_1,... , a_{1000}$. Their squares $a^2_1, . . . , a^2_{1000}$ are written in a circle. It so happened that the sum of any $41$ consecutive numbers on this circle is a multiple of $41^2$. Is it necessarily true that every integer $a_1,... , a_{1000}$ is a multiple of $41$? (Boris Frenkin)

Let $a$ and $b$ be randomly selected three-digit integers and suppose $a > b$. We say that $a$ is [i]clearly bigger[/i] than $b$ if each digit of $a$ is larger than the corresponding digit of $b$. If the probability that $a$ is clearly bigger than $b$ is $\tfrac mn$, where $m$ and $n$ are relatively prime integers, compute $m+n$. [i]Proposed by Evan Chen[/i]

Determine $n \in \Bbb{N}$ such that $n^2 + 2$ divides $2 + 2001n.$

Solve in integer:$x^6+x^2y=y^3+2y^2$

Find the largest integer $k$ such that $k$ divides $n^{55} - n$ for all integer $n$.

How many ordered pairs $\left(a,b\right)$ of positive integers are there such that \[\gcd\left(a,b\right)^3=\mathrm{lcm}\left(a,b\right)^2=4^6\] is true? [i]2019 CCA Math Bonanza Individual Round #4[/i]

Find all pairs of positive integers $m$, $n$ such that the $(m+n)$-digit number \[\underbrace{33\ldots3}_{m}\underbrace{66\ldots 6}_{n}\] is a perfect square.

[b]p1.[/b] The number $2020$ is very special: the sum of its digits is equal to the product of its nonzero digits. How many such four digit numbers are there? (Numbers with only one nonzero digit, like $3000$, also count) [b]p2.[/b] A locker has a combination which is a sequence of three integers between $ 0$ and $49$, inclusive. It is known that all of the numbers in the combination are even. Let the total of a lock combination be the sum of the three numbers. Given that the product of the numbers in the combination is $12160$, what is the sum of all possible totals of the locker combination? [b]p3.[/b] Given points $A = (0, 0)$ and $B = (0, 1)$ in the plane, the set of all points P in the plane such that triangle $ABP$ is isosceles partitions the plane into $k$ regions. The sum of the areas of those regions that are bounded is $s$. Find $ks$. [b]p4.[/b] Three families sit down around a circular table, each person choosing their seat at random. One family has two members, while the other two families have three members. What is the probability that every person sits next to at least one person from a different family? [b]p5.[/b] Jacob and Alexander are walking up an escalator in the airport. Jacob walks twice as fast as Alexander, who takes $18$ steps to arrive at the top. Jacob, however, takes $27$ steps to arrive at the top. How many of the upward moving escalator steps are visible at any point in time? [b]p6.[/b] Points $A, B, C, D, E$ lie in that order on a circle such that $AB = BC = 5$, $CD = DE = 8$, and $\angle BCD = 150^o$ . Let $AD$ and $BE$ intersect at $P$. Find the area of quadrilateral $PBCD$. [b]p7.[/b] Ivan has a triangle of integers with one number in the first row, two numbers in the second row, and continues up to eight numbers in the eighth row. He starts with the first $8$ primes, $2$ through $19$, in the bottom row. Each subsequent row is filled in by writing the least common multiple of two adjacent numbers in the row directly below. For example, the second last row starts with$ 6, 15, 35$, etc. Let P be the product of all the numbers in this triangle. Suppose that P is a multiple of $a/b$, where $a$ and $b$ are positive integers and $a > 1$. Given that $b$ is maximized, and for this value of $b, a$ is also maximized, find $a + b$. [b]p8.[/b] Let $ABCD$ be a cyclic quadrilateral. Given that triangle $ABD$ is equilateral, $\angle CBD = 15^o$, and $AC = 1$, what is the area of $ABCD$? [b]p9.[/b] Let $S$ be the set of all integers greater than $ 1$. The function f is defined on $S$ and each value of $f$ is in $S$. Given that $f$ is nondecreasing and $f(f(x)) = 2x$ for all $x$ in $S$, find $f(100)$. [b]p10.[/b] An [i]origin-symmetric[/i] parallelogram $P$ (that is, if $(x, y)$ is in $P$, then so is $(-x, -y)$) lies in the coordinate plane. It is given that P has two horizontal sides, with a distance of $2020$ between them, and that there is no point with integer coordinates except the origin inside $P$. Also, $P$ has the maximum possible area satisfying the above conditions. The coordinates of the four vertices of P are $(a, 1010)$, $(b, 1010)$, $(-a, -1010)$, $(-b, -1010)$, where a, b are positive real numbers with $a < b$. What is $b$? [b]p11.[/b] What is the remainder when $5^{200} + 5^{50} + 2$ is divided by $(5 + 1)(5^2 + 1)(5^4 + 1)$? [b]p12.[/b] Let $f(n) = n^2 - 4096n - 2045$. What is the remainder when $f(f(f(... f(2046)...)))$ is divided by $2047$, where the function $f$ is applied $47$ times? [b]p13.[/b] What is the largest possible area of a triangle that lies completely within a $97$-dimensional hypercube of side length $1$, where its vertices are three of the vertices of the hypercube? [b]p14.[/b] Let $N = \left \lfloor \frac{1}{61} \right \rfloor + \left \lfloor\frac{3}{61} \right \rfloor+\left \lfloor \frac{3^2}{61} \right \rfloor+... +\left \lfloor\frac{3^{2019}}{61} \right \rfloor$. Given that $122N$ can be expressed as $3^a - b$, where $a, b$ are positive integers and $a$ is as large as possible, find $a + b$. Note: $\lfloor x \rfloor$ is defined as the greatest integer less than or equal to $x$. [b]p15.[/b] Among all ordered triples of integers $(x, y, z)$ that satisfy $x + y + z = 8$ and $x^3 + y^3 + z^3 = 134$, what is the maximum possible value of $|x| + |y| + |z|$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Denote by $a \bmod b$ the remainder of the euclidean division of $a$ by $b$. Determine all pairs of positive integers $(a,p)$ such that $p$ is prime and \[ a \bmod p + a\bmod 2p + a\bmod 3p + a\bmod 4p = a + p. \]

Determine all positive integers $n$ for which there exists an integer $m$ such that $2^{n}-1$ divides $m^{2}+9$.

$ p(x)$ is a polynomial in $ \mathbb{Z}[x]$ such that for each $ m,n\in \mathbb{N}$ there is an integer $ a$ such that $ n\mid p(a^m)$. Prove that $0$ or $1$ is a root of $ p(x)$.

Given a prime $p$, consider integers $0<a<b<c<d<p$ such that $a^4\equiv b^4\equiv c^4\equiv d^4\pmod{p}$. Show that \[a+b+c+d\mid a^{2013}+b^{2013}+c^{2013}+d^{2013}\]

Let $M(n)=\{n,n+1,n+2,n+3,n+4,n+5\}$ be a set of 6 consecutive integers. Let's take all values of the form \[\frac{a}{b}+\frac{c}{d}+\frac{e}{f}\] with the set $\{a,b,c,d,e,f\}=M(n)$. Let \[\frac{x}{u}+\frac{y}{v}+\frac{z}{w}=\frac{xvw+yuw+zuv}{uvw}\] be the greatest of all these values. a) show: for all odd $n$ hold: $\gcd (xvw+yuw+zuv, uvw)=1$ iff $\gcd (x,u)=\gcd (y,v)=\gcd (z,w)=1$. b) for which positive integers $n$ hold $\gcd (xvw+yuw+zuv, uvw)=1$?

Given a natural number $n$, prove that the number $M(n)$ of points with integer coordinates inside the circle $(O(0, 0),\sqrt{n})$ satisfies \[\pi n - 5\sqrt{n} + 1<M(n) < \pi n+ 4\sqrt{n} + 1\]

Find all positive integers $p,q,r,s>1$ such that $$p!+q!+r!=2^s.$$

For a positive integer \( n \geq 2 \), does there exist positive integer solutions to the following system of equations? \[ \begin{cases} a^n - 2b^n = 1, \\ b^n - 2c^n = 1. \end{cases} \]

Find all polynomials $P(x)$ of odd degree $d$ and with integer coefficients satisfying the following property: for each positive integer $n$, there exists $n$ positive integers $x_1, x_2, \ldots, x_n$ such that $\frac12 < \frac{P(x_i)}{P(x_j)} < 2$ and $\frac{P(x_i)}{P(x_j)}$ is the $d$-th power of a rational number for every pair of indices $i$ and $j$ with $1 \leq i, j \leq n$.

Consider the set $E = \{5, 6, 7, 8, 9\}$. For any partition ${A, B}$ of $E$, with both $A$ and $B$ non-empty, consider the number obtained by adding the product of elements of $A$ to the product of elements of $B$. Let $N$ be the largest prime number amonh these numbers. Find the sum of the digits of $N$.

Dragos, the early ruler of Moldavia, and Maria the Oracle play the following game. Firstly, Maria chooses a set $S$ of prime numbers. Then Dragos gives an infinite sequence $x_1, x_2, ...$ of distinct positive integers. Then Maria picks a positive integer $M$ and a prime number $p$ from her set $S$. Finally, Dragos picks a positive integer $N$ and the game ends. Dragos wins if and only if for all integers $n \ge N$ the number $x_n$ is divisible by $p^M$; otherwise, Maria wins. Who has a winning strategy if the set S must be: $\hspace{5px}$a) finite; $\hspace{5px}$b) infinite? Proposed by [i]Boris Stanković, Bosnia and Herzegovina[/i]

$19.$ The digits of a positive integer $n$ are four consecutive integers in decreasing order when read from left to right. What is the sum of the possible remainders when $n$ is divided by $37 ?$

A three-digit $\overline{abc}$ number is called [i]Ecuadorian [/i] if it meets the following conditions: $\bullet$ $\overline{abc}$ does not end in $0$. $\bullet$ $\overline{abc}$ is a multiple of $36$. $\bullet$ $\overline{abc} - \overline{cba}$ is positive and a multiple of $36$. Determine all the Ecuadorian numbers.

Let $p$ be a prime number and let $\mathbb{F}_p$ be the finite field with $p$ elements. Consider an automorphism $\tau$ of the polynomial ring $\mathbb{F}_p[x]$ given by \[\tau(f)(x)=f(x+1).\] Let $R$ denote the subring of $\mathbb{F}_p[x]$ consisting of those polynomials $f$ with $\tau(f)=f$. Find a polynomial $g \in \mathbb{F}_p[x]$ such that $\mathbb{F}_p[x]$ is a free module over $R$ with basis $g,\tau(g),\dots,\tau^{p-1}(g)$.