on pose n=4m ( n>2 )
L(n)
=sum( k=1 à 2m-1, pgcd( k,4m) = 1 ) k
=sum( k=1 à 2m-1, pgcd( k,2m) = 1 ) k car pgcd( k,4m) = 1<==> pgcd( k,2m) = 1
=sum( k=1 à 2m-1, pgcd( 2m-k,2m) = 1 ) k car pgcd( k,2m) = 1<==> pgcd( 2m-k,2m) = 1
=sum( k=1 à 2m-1, pgcd( 2m-k,2m) = 1 ) (2m-k)
==> 2 L(n)= sum( k=1 à 2m-1, pgcd( k,2m) = 1 ) 2m
U(n)
=sum( k=2m+1 à 4m-1, pgcd( k,2m) = 1 ) k
=sum( k=1 à 2m-1, pgcd( k+2m,2m) = 1 ) (k +2m)=3L(n)
=sum( k=1 à 2m-1, pgcd( k,2m) = 1 ) (k +2m)=3L(n)