[/quote]
,
be an integer. Ion draws a regular 
-
such that 
coprime, 
and 
.
be an acute-angled triangle and 
,
be the feet of the altitudes from 
,
,
,
,
,
respectively, lying outside of ![\[\frac{A_1A_2}{AA_1} = \frac{B_1B_2}{BB_1} = \frac{C_1C_2}{CC_1}.\]](http://latex.artofproblemsolving.com/d/f/a/dfa94e10638971d53066c20c4589a9c125059911.png)
If the intersections of 
and 
,
and 
,
and 
are 
,
respectively, prove that 
,
have a common point.
such that
,
,
,
denote the greatest common divisor of 
.
is an integer.
satisfying the equation![\[ 4x^2 - 3y^2 = 1 \]](http://latex.artofproblemsolving.com/d/2/8/d284c2c3a7d7fbe12a7988a4534df16e7adc8947.png)
such that 
.
and 
are standing in front of the room in which there is 
such that for any real value of 
we have:
be a triangle with incenter 
and circumcircle 
with circumcenter 
.
at 
respectively. 
is another intersection point of external bisector of 
with 
is 
incircle touch point to 
be points lie on 
intersect 
at 
. Assume that 
.
and 
are concyclic, and 
are concurrent.
are concurrent.
,
are concurrent.
be a real number. Gugu has a napkin with ten distinct real numbers written on it, and he writes the following three lines of real numbers on the blackboard:
,
,
,
are four (not necessarily distinct) numbers from the first line.
with integer coefficient that satisfy the following
for each 
,such that 
P
Y by nguyendangkhoa17112003, anantmudgal09, abdelkrim, Hexagrammum16, Plasma_Vortex, Seicchi28, The_Maitreyo1, Carpemath, sriraamster, SHREYAS333, TheMathLife, samuel, Vietjung, lifamily, AwesomeDude86, Toinfinity, OlympusHero, A-Thought-Of-God, L567, RudraRockstar, samrocksnature, Palindrome_, centslordm, megarnie, Math_Is_Fun_101, Lamboreghini, veirab, EpicBird08, Adventure10, deplasmanyollari, lian_the_noob12, ItsBesi, buddyram, MathIQ., Rounak_iitr, Akacool, cubres, NicoN9
Let 
be the set of integers. Determine all functions 
such that, for all integers 
and 
, 
Proposed by Liam Baker, South Africa
be the set of integers. Determine all functions 
such that, for all integers 
and 
, 
Proposed by Liam Baker, South AfricaThis post has been edited 2 times. Last edited by djmathman, Jul 18, 2019, 4:41 AM
and 
for some 
constant.
,
for all 
.
for this one, we quickly obtain that 
,
is linear. The rest is checking together with 
.
by symmetry and so the condition becomes 
It is equivalent to 
This means 
is linear on even numbers. Notice that 
,
,
,
for all 
for all 
(divide the case when 
is negative and when 
or 
for some constant 
gives 
, or for every 
in the image of 
.
A simple variable-switching and some translation gives the well-known Cauchy equation. Hence 
after we reach the last step in @above's solution. Cauchy ends it.
=>
(
(
and 
in (1) and use (2), we have 
,
an
,
.
.
.
to get 
,
.
this is just 
over integers implying 
and 
.
or 
and 
or 
for an arbitrary integer 
.
for some integer constant 
.
gives us that 
.![\[f(2a)+2f(b) = f(0) + 2f(a+b).\]](http://latex.artofproblemsolving.com/0/8/e/08e7f6e67090f29a533eafc1e0d7c4662cfa65df.png)
Setting 
in the equation above gives us that ![\[f(a)+f(b) = f(0) + f(a+b),\]](http://latex.artofproblemsolving.com/b/3/c/b3c727963078d956e469533f33d0d8f4ed6ba4fb.png)
which means that 
satisfies Cauchy's equation – therefore, 
is linear. Plugging this in gives us the claimed solutions.
for all positive integers 
be the assertion, then we take 
and subtract to get 
,
gives 
.
for 
,
. Thus 
gives 
,
,
.
denote assertion into the original equality.
we get that 
,
.
here, we get 
.
or 
.
(using the evaluations 
)
for all 
,
for any constant 
and 
,
for all 
.
.
yields 
,
yields 
,
for all 
are the only linear solutions. Compare 
to get that 
is constant and obviosly 
.
and 
.
to get 
.
to show that it is indeed linear which finishes.
while 
Therefore the assertion becomes 
so the function 
thus 
for integer constants 
Plugging this back into the assertion yields either 
for some constant 
These are the only solutions, and it is not hard to see that these work.
for any constant 
,
,![\[2 f(a) + 2 f(b) = f(f(a + b)) + f(0). \]](http://latex.artofproblemsolving.com/1/0/c/10cf4ab93a27cecdc6e0936399afb5c3ab8e1e40.png)
Now asserting 
gives us 
,
yields![\[ 2 f(x + 1) + 2f(-x) = 2 f(x + 1) - 2 f(x) + f(f(0)) + f(0) = f(f(1)) + f(0) \]](http://latex.artofproblemsolving.com/e/9/a/e9a0478988c22d6064309a9fd26072f3f9b47658.png)
![\[\implies f(x + 1) - f(x) = \dfrac{f(f(1)) - f(f(0))}{2}. \]](http://latex.artofproblemsolving.com/c/6/4/c64114b46552fc4ac82623f07954f3aef1b43812.png)
Since the RHS is constant, 
as our claimed solution set. We are done.
for any integer 
term. This motivates us to set 
.
.
we find that 
so 
.
.
we notice is always a constant, so this implies 
.
.
,
.
,
.
whose solution is only 
.
,
.
and 
gives 
.
gives 
gives 
Thus, 
implies the only solutions are 
where 
,
is any integer. It is straightforward to check that these functions are indeed solutions, so now we prove that they are the only ones. Let 
,
,
.
denote this assertion. By 
,
,
.
,![\[2k(a+b)+3\ell = k^2(a+b) + \ell(k+1).\]](http://latex.artofproblemsolving.com/c/2/7/c274150eb3948a4216e46476cf224840e624a3e2.png)
This implies 
and 
,
,
and thus we have that 
Plugging in 
we see that 
and thus our equation simplifies to 
The solution to this is all linear equations, 
.
and 
Let us shift things to the origin by defining a new function 
as,
This equation is quite easy to deal with and I can think of two ideas one could use
and 
Notice the above holds for positive integers but one can deal with negative integers in a similar manner. So clearly 
,
is constant.
.
.
.
.
.
,
.
.
.
or 
.
