« first day (4427 days earlier)      last day (50 days later) » 

1:25 AM
 
 
4 hours later…
5:06 AM
 
5:44 AM
0
Q: Establishing better lower bounds for Non-trivial cycled collatz sequence by Congruence Classes (mod $2^k$)

Py PyLower bounds for non-trivial Collatz Cycle have been established. This is done by studying the proportion of odd elements in a cycled Collatz sequence. The derivation goes as follow (I got this from Eliahou's paper): Let $T: \mathbb{N} \rightarrow \mathbb{N}$ be the Collatz Map, $T(x) = \frac{3x+...

 
 
1 hour later…
7:00 AM
 
 
1 hour later…
8:17 AM
 
 
2 hours later…
10:12 AM
This is closed as a dup of this, but something fishy seems to have happened among the answers of the latter. Maybe the two should be merged?
 
 
2 hours later…
11:53 AM
 
 
2 hours later…
2:15 PM
@Ѕᴀᴀᴅ You can raise a custom moderator flag and suggest that the questions are merged. It sounds reasonable to me. But what do you think is “fishy” with the answers to the older thread?
 
 
2 hours later…
3:55 PM
 
 
1 hour later…
 
3 hours later…
8:14 PM
 
 
1 hour later…
9:18 PM
 
 
2 hours later…
11:17 PM
Dv/D PSQ & dupe of FAQ with link-only accepted answer posted by high rep user.
 

« first day (4427 days earlier)      last day (50 days later) »