Home Competitions KöMaL 2015 A653
Let n ≥ 2 n\ge2 n ≥ 2 be an integer. Prove that there exist integers a 1 , … , a n − 1 a_1,\dots,a_{n-1} a 1 , … , a n − 1 such that a 1 arctg 1 + a 2 arctg 2 + … + a n − 1 arctg ( n − 1 ) = arctg n a_1 \arctg 1 + a_2 \arctg 2 +\ldots+ a_{n-1}\arctg(n-1) = \arctg n a 1 arctg 1 + a 2 arctg 2 + … + a n − 1 arctg ( n − 1 ) = arctg n if and only if n 2 + 1 n^2+1 n 2 + 1 divides ( 1 2 + 1 ) ( 2 2 + 1 ) … ( ( n − 1 ) 2 + 1 ) (1^2+1)(2^2+1)\ldots\big((n-1)^2+1\big) ( 1 2 + 1 ) ( 2 2 + 1 ) … ( ( n − 1 ) 2 + 1 ) .
Official text KöMaL . Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Add a solution
Similar problems
These problems have the most words in common with this statement.
Locator hu-komal/2015/a653 · Tag JDWGS371Y3 · Edit this page on GitHub · Keys: j next, k previous