mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Factoring (https://www.mersenneforum.org/forumdisplay.php?f=19)
-   -   Iteration of (sigma(n)+phi(n))/2 (https://www.mersenneforum.org/showthread.php?t=22577)

sean 2017-09-14 04:52

Iteration of (sigma(n)+phi(n))/2
 
In recent weeks there has been some interest on the seqfan mailing list about iterating the map (sigma(n)+phi(n))/2 (see for example [URL="https://oeis.org/A291790"]A291790[/URL]).

In many cases the map results in a fraction (i.e. odd/2) and the iteration finishes. However, there appears to be cases (perhaps a lot of cases for large n) where the iteration appears unbounded and continues indefinitely (not unlike certain aliquot sequences or home primes, etc.). It is not clear why this should be.

The smallest unresolved case is starting with n=270, which has now survived 515 iterations of the map. The unresolved cases for n<1000 are 270, 440, 496, 702, 737, 813, 828, 897, and 905. There are other values less than 1000 unresolved, but their trajectories converge with one of the nine listed. All of them have survived at least 400 iterations.

All the factorizations for the existing steps have been added to factordb.com. I'm not planning on taking these further myself, but there is plenty of scope for fairly easy factorization here. Some the composites are still down in 100 digit range and even the hardest (for the 270 trajectory) is only a C138.

science_man_88 2017-09-14 10:55

[QUOTE=sean;467755]In recent weeks there has been some interest on the seqfan mailing list about iterating the map (sigma(n)+phi(n))/2 (see for example [URL="https://oeis.org/A291790"]A291790[/URL]).

In many cases the map results in a fraction (i.e. odd/2) and the iteration finishes. However, there appears to be cases (perhaps a lot of cases for large n) where the iteration appears unbounded and continues indefinitely (not unlike certain aliquot sequences or home primes, etc.). It is not clear why this should be.

The smallest unresolved case is starting with n=270, which has now survived 515 iterations of the map. The unresolved cases for n<1000 are 270, 440, 496, 702, 737, 813, 828, 897, and 905. There are other values less than 1000 unresolved, but their trajectories converge with one of the nine listed. All of them have survived at least 400 iterations.

All the factorizations for the existing steps have been added to factordb.com. I'm not planning on taking these further myself, but there is plenty of scope for fairly easy factorization here. Some the composites are still down in 100 digit range and even the hardest (for the 270 trajectory) is only a C138.[/QUOTE]

if n is composite since both sigma(n) and phi(n) are multiplicative to some extent the sum is close ( but below at last check) to a multiplication of earlier terms ( not necessarily in the same iteration chain).

arbooker 2017-09-18 15:39

[QUOTE=sean;467755]In many cases the map results in a fraction (i.e. odd/2) and the iteration finishes. However, there appears to be cases (perhaps a lot of cases for large n) where the iteration appears unbounded and continues indefinitely (not unlike certain aliquot sequences or home primes, etc.). It is not clear why this should be.[/QUOTE]I would guess that asymptotically 100% of positive integers have unbounded trajectory, and it might be possible to prove something along those lines.

Note that [$](\sigma(n)+\varphi(n))/2[/$] is an integer unless [$]n[/$] is a square or twice a square, and those are very rare among large numbers. Further, if [$]n>1[/$] and [$](\sigma(n)+\varphi(n))/2[/$] is odd then [$]n[/$] must be of the form [$]pm^2[/$] or [$]2pm^2[/$] for an odd prime [$]p[/$]. Combining this with some sieve theory, one can show that the number of composite [$]n\le x[/$] with [$](\sigma(n)+\varphi(n))/2[/$] prime is [$]O(x/\log^2{x})[/$]. Since the map tends to increase geometrically and [$]\sum1/k^2[/$] converges, this suggests that a typical large composite has little chance of ever reaching a prime.


All times are UTC. The time now is 07:50.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.