On the Arithmetic Complexity of Euler Function

2011 ◽  
pp. 43-49 ◽  
Author(s):  
Manindra Agrawal
Keyword(s):  
Euler Function ◽  
Arithmetic Complexity

scholarly journals Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function

2006 ◽  
Vol 17 (4) ◽  
pp. 611-625 ◽  
Author(s):  
Florian Luca ◽  
Igor E. Shparlinski
Keyword(s):  
Fibonacci Sequence ◽  
Euler Function

On the sum of the first n values of the Euler function

2014 ◽  
Vol 163 (3) ◽  
pp. 199-201 ◽  
Author(s):  
R. Balasubramanian ◽  
Florian Luca ◽  
Dimbinaina Ralaivaosaona
Keyword(s):  
Euler Function

Carmichael Numbers with a Square Totient

2009 ◽  
Vol 52 (1) ◽  
pp. 3-8 ◽  
Author(s):  
W. D. Banks
Keyword(s):  
Euler Function ◽  
Carmichael Numbers

AbstractLet φ denote the Euler function. In this paper, we show that for all large x there are more than x0.33 Carmichael numbers n ⩽ x with the property that φ(n) is a perfect square. We also obtain similar results for higher powers.

Sign in / Sign up

Export Citation Format

Share Document