Positive integers whose Euler function is a power of their kernel function (Q2477811): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982430004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On numbers \(n\) for which the prime factors of \(\sigma(n)\) are among the prime factors on \(n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841598 / rank
 
Normal rank

Latest revision as of 18:34, 27 June 2024

scientific article
Language Label Description Also known as
English
Positive integers whose Euler function is a power of their kernel function
scientific article

    Statements

    Positive integers whose Euler function is a power of their kernel function (English)
    0 references
    0 references
    0 references
    14 March 2008
    0 references
    Let \(\gamma(n)= \prod_{p|n} p\), \(\sigma\) be the sum of divisors function and \(\varphi\) be Euler's function. The first author asked for the set of positive integers \(n\) satisfyng \(f(n)=\gamma(n)^2\) when \(f=\sigma\) or \(\varphi\). This problem was investigated for \(f=\sigma\) by the second author in [Result. Math. 45, No. 1--2, 79--87 (2004; Zbl 1195.11133)] but it is not known whether the number of solutions is finite or infinite. The six solutions in the case \(f=\varphi\) are found in the current paper, and a more general problem is investigated. Let \(N_k\) denote the number of positive integers \(n\) such that \((*)\) \(\varphi(n)= \gamma(n)^k\), where \(k\geq 1\). The authors study the size of \(N_k\) in terms of \(k\); more precisely it is shown that there exist computable constants \(c_1\) and \(c_2\) such that for all \(k\geq 1\) \[ \exp(c_1 k\log k)< N_k< \exp(c_2 k^2). \] They also obtain the upper bound \(3^{(k+1)^{k+2}}\) for the largest solution \(n\) of equation \((*)\). The arguments are combinatorial in nature and intricate, with the establishment of the lower bound for \(N_k\) requiring the more complicated proof. The set of solutions of \((*)\) when \(k=1,2,3\) are calculated, and \texttt{MATHEMATICA} is used to compute the 85 integers \(n\) satisfying \((*)\) when \(k= 4\) and to show that \(N_5= 969\).
    0 references
    Euler's function
    0 references
    squarefree kernel of an integer
    0 references
    solutions of equation involving arithmetic functions
    0 references

    Identifiers