[/quote]
,
positive integers 
such that for every index 
,
,
is a multiple of 
.
and 
be positive integers satisfying the equation ![$(a, b) + [a, b]=2021^c$](http://latex.artofproblemsolving.com/2/4/6/246ccbb22acecb7adc72219afb8afb34c9b05101.png)
.
is a prime number, prove that the number 
is composite.
be the set of real numbers. Determine all functions 
such that ![\[ f(x^2 - y^2) = x f(x) - y f(y) \]](http://latex.artofproblemsolving.com/6/8/f/68f78e0df627f6ac04052433c01627bf16f0af8e.png)
for all pairs of real numbers 
and 
.
into 
or 
can sometimes be quite complex. That's why I’ve written a program to assist with this process.
be real numbers such that 
Prove that 
Where 
with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of 
Prove that 
,
,
,
can be expressed by a sum of positive integers 
'![\[n=a_1+a_2+\dots+a_m,\]](http://latex.artofproblemsolving.com/6/c/2/6c2a979a5ff6c40bf2d7152c8c32088fc36f848b.png)
where 
,
,
,
and 
.
equally spaced points on a circular track 
of circumference 
in some order, each label used once. Initially, Bunbun the Bunny begins at 
.
,
,
,
to 
,
of 
is a diameter of 
with the property that ![\[f(x-f(y))=f(f(x))-f(y)-1\]](http://latex.artofproblemsolving.com/f/2/5/f25cc1e8ae0be1fd02b347fd94be4fab88af1d46.png)
holds for all 
.
be the set of positive integers. Find all functions 
such that![\[ m^2 + f(n) \mid mf(m) +n \]](http://latex.artofproblemsolving.com/2/f/4/2f409d1de993f1af8fd839bb8e9f87a57e1b8608.png)
and 
Y by
Tony writes 
consecutive natural numbers starting from 
on whiteboard. Every minutes, he will erase 
numbers (not necessary different), in the form of 
and write 
numbers back on the whiteboard in the form of 
. Tony will stop whenever he cannot erase any 4 numbers that satisfy the condition anymore. If let's say, Tony starts at 
(8 AM), prove that Tony will stop before 
(4.30 PM)
consecutive natural numbers starting from 
on whiteboard. Every minutes, he will erase 
numbers (not necessary different), in the form of 
and write 
numbers back on the whiteboard in the form of 
. Tony will stop whenever he cannot erase any 4 numbers that satisfy the condition anymore. If let's say, Tony starts at 
(8 AM), prove that Tony will stop before 
(4.30 PM)
