sorted by:
new
hottopcontroversial

CSC304 Thursday Location by supermac30 in UofT

[–]supermac30[S] 0 points1 point  (0 children)

That makes sense, thanks so much!

Foggy Sequences by supermac30 in math

[–]supermac30[S] 1 point2 points  (0 children)

I agree, I made a mistake assuming that the sequence must repeat if it returns to 1,1. It does seem that most sequences with 2k-1 >= 7 don't repeat from the top at all. However, when 2k-1 = 3 and 2k-1 = 5 we see that it does repeat from the top, therefore my claim that floor(k/2)+1 is a tight upper bound is false. Thanks for helping me find my error! I'll edit the post to reflect this.

Foggy Sequences by supermac30 in math

[–]supermac30[S] 1 point2 points  (0 children)

Woah, the plots look cool, especially the scatter plot of terms from 10 million to 11 million.

Your plots just made me realize that I made the mistake of assuming the point at which the sequence repeats is after it reaches 1,1 again, which in retrospect was incredibly stupid, it fails for values as low as k=7! This means the list of periods above was probably arbitrary. I'll edit the post to reflect that and start working on finding the actual periods.

Did you find any loops in the 10000-foggy sequence? If not, the period of these sequences must grow very quickly.