proposed
approved
proposed
approved
editing
proposed
A. S. Karpenko A.S. 2006. , Lukasiewicz's Logics and Prime Numbers , (English translation), 2006. See Table 2 on p.125 ff.
A. S. Karpenko A.S. 2000. , Lukasiewicz's Logics and Prime Numbers , (Russian), 2000.
proposed
editing
editing
proposed
a(3) = 4 because x = { 5, 8, 10, 12 } are the 4 numbers from which the iteration x -> phi(x) + 1 terminates at prime(3) = 5.
a(4) = 8 because x = { 7, 9, 14, 15, 16, 18, 20, 24, 30 } are the 9 numbers from which the iteration x -> phi(x) + 1 terminates at prime(4) = 7.
reviewed
editing
proposed
reviewed
editing
proposed
Name clarified by Hugo Pfoertner, Sep 23 2017
proposed
editing
editing
proposed
aConjectured number of numbers for which the iteration x -> phi(x) + 1 terminates at prime(n) = cardinality . Cardinality of rooted tree T_p (where p is n-th prime) in Karpenko's book.
Also conjectured number of numbers for which the iteration x -> phi(x) + 1 terminates at prime(n). - Hugo Pfoertner, Sep 23 2017
proposed
editing