BBC Russian

Revision History for A003434

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A003434

Number of iterations of phi(x) at n needed to reach 1.
(history; published version)

#82 by Andrew Howroyd at Mon Feb 28 12:19:51 EST 2022

STATUS

proposed

approved

#81 by Michel Marcus at Mon Feb 28 12:11:16 EST 2022

STATUS

editing

proposed

#80 by Michel Marcus at Mon Feb 28 12:11:08 EST 2022

FORMULA

Pillai proved that log(n/2)/log(3) + 1 <= a(n) <= log(n)/log(2) + 1. - Charles R Greathouse IV, Mar 22, 2012

STATUS

approved

editing

#79 by Michel Marcus at Mon Nov 15 01:15:55 EST 2021

STATUS

reviewed

approved

#78 by Michael De Vlieger at Sun Nov 14 22:35:21 EST 2021

STATUS

proposed

reviewed

#77 by Chai Wah Wu at Sun Nov 14 22:12:36 EST 2021

STATUS

editing

proposed

#76 by Chai Wah Wu at Sun Nov 14 22:11:55 EST 2021

PROG

(Python)

from sympy import totient

STATUS

proposed

editing

Discussion

Sun Nov 14

22:12

Chai Wah Wu: Michael, you are right. I added the missing lines.

#75 by Chai Wah Wu at Sun Nov 14 18:31:36 EST 2021

STATUS

editing

proposed

Discussion

Sun Nov 14

21:27

Michael De Vlieger: Is this Python, and are we missing sympi? (Maybe I am wrong).

#74 by Chai Wah Wu at Sun Nov 14 18:31:33 EST 2021

PROG

return c # Chai Wah Wu, Nov 14 2021

#73 by Chai Wah Wu at Sun Nov 14 18:31:21 EST 2021

PROG

def A003434(n):

c, m = 0, n

while m > 1:

c += 1

m = totient(m)

return c # Chai Wah Wu, Nov 14 2021

STATUS

approved

editing