Let \(p,p_2,\dots,p_k\) be distinct primes and let \(a_2,a_3,\dots,a_k\) be nonnegative integers. Define \[ m \;=\; \frac12 \Bigl(\prod_{i=2}^k p_i^{a_i}\Bigr) \Bigl(\prod_{i=1}^k(p_i+1)\;+\;\sum_{i=1}^k(p_i-1)\Bigr), \] \[ n \;=\; \frac12 \Bigl(\prod_{i=2}^k p_i^{a_i}\Bigr) \Bigl(\prod_{i=1}^k(p_i+1)\;-\;\sum_{i=1}^k(p_i-1)\Bigr). \] Prove that \[ p^2-1 \;\bigm|\; p\,m \;-\; n. \]

Integer $n$ has $k$ different prime factors. Prove that $\sigma (n) \mid (2n-k)!$

Determine all 6-digit numbers $(abcdef)$ so that $(abcdef) = (def)^2$ where $\left( x_1x_2...x_n \right)$ is no multiplication but an n-digit number.

For positive integers $i$ and $j$, define $d(i,j)$ as follows: $d(1,j) = 1, d(i,1) = 1$ for all $i$ and $j$, and for $i, j > 1$, $d(i,j) = d(i-1,j) + d(i,j-1) + d(i-1,j-1)$. Compute the remainder when $d(3,2016)$ is divided by $1000$.

Let $n$ be a natural number. The set $A{}$ of natural numbers has the following property: for any natural number $m\leqslant n$ in the set $A{}$ there is a number divisible by $m{}$. What is the smallest value that the sum of all the elements of the set $A{}$ can take? [i]Proposed by A. Kuznetsov[/i]

[b]p33.[/b] Lines $\ell_1$ and $\ell_2$ have slopes $m_1$ and $m_2$ such that $0 < m_2 < m_1$. $\ell'_1$ and $\ell'_2$ are the reflections of $\ell_1$ and $\ell_2$ about the line $\ell_3$ defined by $y = x$. Let $A = \ell_1 \cap \ell_2 = (5, 4)$, $B = \ell_1 \cap \ell_3$, $C = \ell'_1 \cap \ell'_2$ and $D = \ell_2 \cap \ell_3$. If $\frac{4-5m_1}{-5-4m_1} = m_2$ and $\frac{(1+m^2_1)(1+m^2_2)}{(1-m_1)^2(1-m_2)^2} = 41$, compute the area of quadrilateral $ABCD$. [b]p34.[/b] Suppose $S(m, n) = \sum^m_{i=1}(-1)^ii^n$. Compute the remainder when $S(2020, 4)$ is divided by $S(1010, 2)$. [b]p35.[/b] Let $N$ be the number of ways to place the numbers $1, 2, ..., 12$ on a circle such that every pair of adjacent numbers has greatest common divisor $1$. What is $N/144$? (Arrangements that can be rotated to yield each other are the same). [b]p36.[/b] Compute the series $\sum_{n=1}^{\infty} \frac{(-1)^{n-1}}{{2n \choose 2}} =\frac{1}{{2 \choose 2}} - \frac{1}{{4 \choose 2}} +\frac{1}{{6 \choose 2}} -\frac{1}{{8 \choose 2}} -\frac{1}{{10 \choose 2}}+\frac{1}{{12 \choose 2}} +...$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

How many five digit numbers are divisible by $3$ and contain the digit $6$?

Let $\{a_n \}_{n=1}^{\infty}$ be a sequence such that $a_1=\frac 12$ and \[a_n=\biggl( \frac{2n-3}{2n} \biggr) a_{n-1} \qquad \forall n \geq 2.\] Prove that for every positive integer $n,$ we have $\sum_{k=1}^n a_k <1.$

Find the smallest positive integer that is a multiple of $18$ and whose digits can only be $4$ or $7$.

Is it possible to find $2008$ infinite arithmetical progressions such that there exist finitely many positive integers not in any of these progressions, no two progressions intersect and each progression contains a prime number bigger than $2008$?

Which positive integers $a$ have the property that \(n!-a\) is a perfect square for infinitely many positive integers \(n\)?

Let $S(n)$ be the sum of digits of $n$. Determine all the pairs $(a, b)$ of positive integers, such that the expression $S(an + b) - S(n)$ has a finite number of values, where $n$ is varying in the positive integers.

Let $n \ge 4$ be a natural number. Let $A_1A_2
\cdots
A_n$ be a regular polygon and $X = \{ 1,2,3....,n \} $. A subset $\{ i_1, i_2,\cdots, i_k \} $ of $X$, with $k \ge 3$ and $i_1 < i_2 <
\cdots < i_k$, is called a good subset if the angles of the polygon $A_{i_1}A_{i_2}\cdots
A_{i_k}$ , when arranged in the increasing order, are in an arithmetic progression. If $n$ is a prime, show that a proper good subset of $X$ contains exactly four elements.

Let us call "absolutely prime" the prime number, if having transposed its digits in an arbitrary order, we obtain prime number again. Prove that its notation cannot contain more than three different digits.

Determine all integers $n\geqslant 2$ with the following property: every $n$ pairwise distinct integers whose sum is not divisible by $n$ can be arranged in some order $a_1,a_2,\ldots, a_n$ so that $n$ divides $1\cdot a_1+2\cdot a_2+\cdots+n\cdot a_n.$ [i]Arsenii Nikolaiev, Anton Trygub, Oleksii Masalitin, and Fedir Yudin[/i]

Show that there exists a unique sequence of decimal digits $p_0=5,p_1,p_2,\ldots$ such that, for any $k$, the square of any positive integer ending with $\overline{p_kp_{k-1}\cdots p_0}$ ends with the same digits.

A set of five different positive integers is called [i]virtual[/i] if the greatest common divisor of any three of its elements is greater than $1$, but the greatest common divisor of any four of its elements is equal to $1$. Prove that, in any virtual set, the product of its elements has at least $2020$ distinct positive divisors. [i]Proposed by Víctor Almendra[/i]

p1. Find all real numbers $x$ that satisfy the inequality $$\frac{x^2-3}{x^2-1}+ \frac{x^2 + 5}{x^2 + 3} \ge \frac{x^2-5}{x^2-3}+\frac{x^2 + 3}{x^2 + 1}$$ p2. It is known that $m$ is a four-digit natural number with the same units and thousands digits. If $m$ is a square of an integer, find all possible numbers $m$. p3. In the following figure, $\vartriangle ABP$ is an isosceles triangle, with $AB = BP$ and point $C$ on $BP$. Calculate the volume of the object obtained by rotating $ \vartriangle ABC$ around the line $AP$ [img]https://cdn.artofproblemsolving.com/attachments/c/a/65157e2d49d0d4f0f087f3732c75d96a49036d.png[/img] p4. A class farewell event is attended by $10$ male students and $ 12$ female students. Homeroom teacher from the class provides six prizes to randomly selected students. Gifts that provided are one school bag, two novels, and three calculators. If the total students The number of male students who received prizes was equal to the total number of female students who received prizes. How many possible arrangements are there of the student who gets the prize? p5. It is known that $S =\{1945, 1946, 1947, ..., 2016, 2017\}$. If $A = \{a, b, c, d, e\}$ a subset of $S$ where $a + b + c + d + e$ is divisible by $5$, find the number of possible $A$'s.

Let $p$ be a prime number such that $\frac{28^p-1}{2p^2+2p+1}$ is an integer. Find all possible values of number of divisors of $2p^2+2p+1$.

Let there be $A=1^{a_1}2^{a_2}\dots100^{a_100}$ and $B=1^{b_1}2^{b_2}\dots100^{b_100}$ , where $a_i , b_i \in N$ , $a_i + b_i = 101 - i$ , ($i= 1,2,\dots,100$). Find the last 1124 digits of $P = A * B$.

Does there exist a natural number that can be represented as the product of two numeric palindromes in more than $100{}$ ways?

Let $S$ be a set of nonnegative integers such that [list] [*] there exist two elements $a$ and $b$ in $S$ such that $a,b>1$ and $\gcd(a,b)=1$; and [*] for any (not necessarily distinct) element $x$ and nonzero element $y$ in $S$, both $xy$ and the remainder when $x$ is divided by $y$ are in $S$. [/list] Prove that $S$ contains every nonnegative integer. [i]Jacob Paltrowitz[/i]

$n>2$ numbers, $ x_1, x_2, ..., x_n$ are odd . Prove that $4$ divides $$ x_1x_2+x_2x_3+...+x_{n-1}x_n+x_nx_1 -n.$$

Let $\{F_n\}^\infty_{n=1}$ be the Fibonacci sequence and let $f$ be a polynomial of degree $1006$ such that $f(k) = F_k$ for all $k \in \{1008, \dots , 2014\}$. Prove that $$233\mid f(2015)+1.$$ [i]Note: $F_1=F_2=1$ and $F_{n+2}=F_{n+1}+F_n$ for all $n\geq 1$.[/i]

Find all pairs $(x, y)$ of natural numbers such that $$x + y = a^n, x^2 + y^2 = a^m$$ for some natural $a, n, m$.