Average Orders of the Euler Phi Function, The Dedekind Psi Function, The Sum of Divisors Function, And The Largest Integer Function

Abstract

Let x≥ 1 be a large number, let [x]=x-\x\ be the largest integer function, and let (n) be the Euler totient function. The result Σn≤ x([x/n])=(6/π2)x x+O ( x( x)2/3( x)1/3 ) was proved very recently. This note presents a short elementary proof, and sharpen the error term to Σn≤ x([x/n])=(6/π2)x x+O(x) . In addition, the first proofs of the asymptotics formulas for the finite sums Σn≤ x([x/n])=(15/π2)x x+O(x x) , and Σn≤ xσ([x/n])=(π2/6)x x+O(x x) are also evaluated here.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…