Maths Olympiad Prep

Library / /57 of 151

, 2015

Number theory Difficulty 6.0 National Olympiad Prove it Hungary

Let n2n\ge2 be an integer. Prove that there exist integers a1,,an1a_1,\dots,a_{n-1} such that a1arctg1+a2arctg2++an1arctg(n1)=arctgna_1 \arctg 1 + a_2 \arctg 2 +\ldots+ a_{n-1}\arctg(n-1) = \arctg n if and only if n2+1n^2+1 divides (12+1)(22+1)((n1)2+1)(1^2+1)(2^2+1)\ldots\big((n-1)^2+1\big).
Based on a problem of IMC 2015, Blagoevgrad
(5 pont)

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.