On the distribution of some means concerning the Euler function (Q1038648): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2016061210 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON THE SUM OF THE FIRST n PRIMES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A remark on a paper of F. Luca and A. Sankaranarayanan / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the sum of the first \(n\) primes being a square / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On positive integers \(n\) such that \(\varphi(1)+\varphi(2)+\cdots+ \varphi(n)\) is a square / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:23, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the distribution of some means concerning the Euler function |
scientific article |
Statements
On the distribution of some means concerning the Euler function (English)
0 references
18 November 2009
0 references
A real sequence \(a_n\) is dense modulo one, if the set of fractional part of values of it becomes dense in the unit interval \([0,1]\). The aim of the paper under review is studying density of some sequences related by the well-known means of the values of Euler function \(\varphi\). The authors prove that the sequences with general terms \(a_n=\frac1n \sum_{m\leq n}\varphi(m)\), \(g_n=\left(\prod_{m\leq n}\varphi(m)\right)^{1/n}\), \(h_n=n/\sum_{m\leq n}\frac{1}{\varphi(m)}\) and \(s_n=\sqrt{na_n}\) all are dense modulo one. The key point of the proofs is considering the ratio \(\varphi(n+j)/(n+j)\) when \(j\) runs over a certain set of integers obtained by Chinese remainder theorem.
0 references
dense modulo 1
0 references
Euler function
0 references
arithmetic mean
0 references
geometric mean
0 references
harmonic mean
0 references
square root mean
0 references