In a multiplication table, the entry in the $i$-th row and the $j$-th column is the product $ij$ From an $m\times n$ subtable with both $m$ and $n$ odd, the interior $(m-2) (n-2)$ rectangle is removed, leaving behind a frame of width $1$. The squares of the frame are painted alternately black and white. Prove that the sum of the numbers in the black squares is equal to the sum of the numbers in the white squares.

All the positive divisors of a positive integer $n$ are stored into an increasing array. Mary is writing a programme which decides for an arbitrarily chosen divisor $d > 1$ whether it is a prime. Let $n$ have $k$ divisors not greater than $d$. Mary claims that it suffices to check divisibility of $d$ by the first $\left\lceil\frac{k}{2}\right\rceil$ divisors of $n$: $d$ is prime if and only if none of them but $1$ divides $d$. Is Mary right?

Solve in integers the equation : $x^2y+y^2=x^3$

We call a number [i]perfect[/i] if the sum of its positive integer divisors(including $1$ and $n$) equals $2n$. Determine all [i]perfect[/i] numbers $n$ for which $n-1$ and $n+1$ are prime numbers.

Find the greatest common divisor of all numbers of the form $(2^{a^2}\cdot 19^{b^2} \cdot 53^{c^2} + 8)^{16} - 1$ where $a,b,c$ are integers.

Let $ a $ and $ b $ be natural numbers with property $ gcd(a,b)=1 $ . Find the least natural number $ k $ such that for every natural number $ r \ge k $ , there exist natural numbers $ m,n >1 $ in such a way that the number $ m^a n^b $ has exactly $ r+1 $ positive divisors.

[b]p1.[/b] Find the number of ordered triples $(a, b, c)$ satisfying $\bullet$ $a, b, c$ are are single-digit positive integers, and $\bullet$ $a \cdot b + c = a + b \cdot c$. [b]p2.[/b] In their class Introduction to Ladders at Greendale Community College, Jan takes four tests. They realize that their test scores in chronological order form an increasing arithmetic progression with integer terms, and that the average of those scores is an integer greater than or equal to $94$. How many possible combinations of test scores could they have had? (Test scores at Greendale range between $0$ and $100$, inclusive.) [b]p3.[/b] Suppose that $a + \frac{1}{b} = 2$ and $b +\frac{1}{a} = 3$. If$ \frac{a}{b} + \frac{b}{a}$ can be expressed as $\frac{p}{q}$ in simplest terms, find $p + q$. [b]p4.[/b] Suppose that $A$ and $B$ are digits between $1$ and $9$ such that $$0.\overline{ABABAB...}+ B \cdot (0.\overline{AAA...}) = A \cdot (0.\overline{B_1B_1B_1...}) + 1$$ Find the sum of all possible values of $10A + B$. [b]p5.[/b] Let $ABC$ be an isosceles right triangle with $m\angle ABC = 90^o$. Let $D$ and $E$ lie on segments $AC$ and $BC$, respectively, such that triangles $\vartriangle ADB$ and $\vartriangle CDE$ are similar and $DE = EB$. If $\frac{AC}{AD} = 1 +\frac{\sqrt{a}}{b}$ with $a, b$ positive integers and a squarefree, then find $a + b$. [b]p6.[/b] Five bowling pins $P_1$, $P_2$,..., $P_5$ are lined up in a row. Each turn, Jemma picks a pin at random from the standing pins, and throws a bowling ball at that pin; that pin and each pin directly adjacent to it are knocked down. If the expected value of the number of turns Jemma will take to knock down all the pins is a b where a and b are relatively prime, find $a + b$. (Pins $P_i$ and $P_j$ are adjacent if and only if $|i -j| = 1$.) [b]p7.[/b] Let triangle $ABC$ have side lengths $AB = 10$, $BC = 24$, and $AC = 26$. Let $I$ be the incenter of $ABC$. If the maximum possible distance between $I$ and a point on the circumcircle of $ABC$ can be expressed as $a +\sqrt{b}$ for integers $a$ and $b$ with $b$ squarefree, find $a + b$. (The incenter of any triangle $XY Z$ is the intersection of the angle bisectors of $\angle Y XZ$, $\angle XZY$, and $\angle ZY X$.) [b]p8.[/b] How many terms in the expansion of $$(1 + x + x^2 + x^3 +... + x^{2021})(1 + x^2 + x^4 + x^6 + ... + x^{4042})$$ have coefficients equal to $1011$? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let be a natural number $ n. $ Calculate $$ \sum_{k=1}^{n^2}\#\left\{ d\in\mathbb{N}| 1\le d\le k\le d^2\le n^2\wedge k\equiv 0\pmod d \right\} . $$ Here, $ \# $ means cardinal.

For any natural $n$ , define $n!!=(n!)!$ e.g. $3!!=(3!)!=6!=720$. Let $a_1,a_2,...,a_n$ be a positive integer Prove that $$\frac{(a_1+a_2+\cdots+a_n)!!}{a_1!!a_2!!\cdots a_n!!}$$ is an integer. [i](nooonuii)[/i]

Which positive integers $m$ are such that $k^m - 1$ is divisible by $2^m$ for all odd numbers $k \ge 3$?

An unordered triple of numbers $(a,b,c)$ in one move you can change to either $(a,b,2a+2b-c)$, $(a,2a+2c-b,c)$ or $(2b+2c-a,b,c)$. Can you from the triple $(3,5,14)$ get the triple $(3,13,6)$ in finite amount of moves?

Let $n$ be an integer, $n \ge 2$. Find the remainder of the division of the number $n(n + 1)(n + 2)$ by $n - 1$.

Find all pairs $(m,n)$ of natural numbers with $m<n$ such that $m^2+1$ is a multiple of $n$ and $n^2+1$ is a multiple of $m$.

Denote by $s(n)$ the sum of all natural divisors of $n$ which are smaller than $n$. Does there exist a positive integer $a$ such that the equation $$s(n)=a+n$$ has infinitely many solutions in positive integers?

Let $a,b$ be coprime integers. Show that the equation $ax^2 + by^2 =z^3$ has an infinite set of solutions $(x,y,z)$ with $\{x,y,z\}\in\mathbb{Z}$ and each pair of $x,y$ mutually coprime.

Solve, in the positive integers, the equation $5^m + n^2 = 3^p$ .

The positive integer $ n$ has the following property: if the three last digits of $n$ are removed, the number $\sqrt[3]{n}$ remains. Find $n$.

For which positive integers $n$ is $231^n-222^n-8 ^n -1$ divisible by $2007$?

define $(a_n)_{n \in \mathbb{N}}$ such that $a_1=2$ and $$a_{n+1}=\left(1+\frac{1}{n}\right)^n \times a_{n}$$ Prove that there exists infinite number of $n$ such that $\frac{a_1a_2 \ldots a_n}{n+1}$ is a square of an integer.

Find all pairs of natural numbers $ (a, b)$ such that $ 7^a \minus{} 3^b$ divides $ a^4 \plus{} b^2$. [i]Author: Stephan Wagner, Austria[/i]

Determine all $f:\mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ such that $f(m)\geq m$ and $f(m+n) \mid f(m)+f(n)$ for all $m,n\in \mathbb{Z}^+$

Find all polynomials $ p$ of one variable with integer coefficients such that if $ a$ and $ b$ are natural numbers such that $ a \plus{} b$ is a perfect square, then $ p\left(a\right) \plus{} p\left(b\right)$ is also a perfect square.

Prove that for every positive integer $n$ there are positive integers $a$ and $b$ exist with $n | 4a^2 + 9b^2 -1$.

Denote by $\mathbb{Z}^{*}$ the set of all nonzero integers and denote by $\mathbb{N}_{0}$ the set of all nonnegative integers. Find all functions $f:\mathbb{Z}^{*} \rightarrow \mathbb{N}_{0}$ such that: $(1)$ For all $a,b \in \mathbb{Z}^{*}$ such that $a+b \in \mathbb{Z}^{*}$ we have $f(a+b) \geq $ [b]min[/b] $\left \{ f(a),f(b) \right \}$. $(2)$ For all $a, b \in \mathbb{Z}^{*}$ we have $f(ab) = f(a)+f(b)$.

We call a sequence of $m$ consecutive integers a [i]friendly[/i] sequence if its first term is divisible by $1$, the second by $2$, ..., the $(m-1)^{th}$ by $m-1$, and in addition, the last term is divisible by $m^2$ Does a friendly sequence exist for (a) $m=20$ and (b) $m=11$?