MathDB
Sum of residues

Source: IMAR 2017, problem 2

November 18, 2017
number theoryabstract algebra

Problem Statement

For every knk\leq n define rkr_k the residue of 2n2^n modulo kk. Prove that ri>nlog2(n3)2n\sum r_i> \frac{n*log_2(\frac{n}{3})}{2}-n, for any n2n\geq 2