bbchallenge - #programming

Here's my result: ``` time python collatz/fast_6x2_mxdys_halt_cryptid.py 4 4 0.051816 9 2 1 0 0.051937 16 1 0 0 0.051971 4 56 0 0 0.051986 4 56 0.051998 6240 33 27 4 0.052102 4102261 12 16 4 0.052125 20767719 5 5 2 0.052151 46727374 3 2 1 0.052172 70091064 1 1 0 0.052189 4 210273200 0 0 0.052205 4 210273200 0.052217 10^11817285 ≡ 1 (mod 2) 109607968 105136599 26 31.131863 10^17725928 ≡ 1 (mod 2) 59275450 54803983 25 47.574713 10^20680249 ≡ 1 (mod 2) 34108424 29637724 24 55.897304 10^23634570 ≡ 0 (mod 2) 8944548 17054211 24 64.099425 10^24373150 ≡ 0 (mod 2) 2652454 4472273 22 66.462712 10^24557795 ≡ 0 (mod 2) 1080323 1326226 20 67.479099 10^24650118 ≡ 0 (mod 2) 293913 540161 19 68.322738 10^24673198 ≡ 1 (mod 2) 97433 146956 17 69.102849 10^24678968 ≡ 0 (mod 2) 48177 48716 15 69.309316 10^24681853 ≡ 0 (mod 2) 23608 24088 14 69.453753 10^24683296 ≡ 0 (mod 2) 11291 11803 13 69.561909 10^24684017 ≡ 1 (mod 2) 5146 5645 12 69.643165 10^24684378 ≡ 1 (mod 2) 2078 2572 11 69.706096 10^24684558 ≡ 1 (mod 2) 558 1038 10 69.753959 10^24684603 ≡ 1 (mod 2) 173 278 8 69.783598 10^24684615 ≡ 0 (mod 2) 75 86 6 70.593253 10^24684620 ≡ 1 (mod 2) 23 37 5 71.0047 10^24684622 ≡ 1 (mod 2) 10 11 3 71.118267 10^24684622 ≡ 0 (mod 2) 5 4 2 71.180459 10^24684623 ≡ 0 (mod 2) 1 2 1 71.218088 4 10^24684623 ≡ 0 (mod 2) 0 1 71.239488 4 10^24684623 ≡ 0 (mod 2) 71.248533 ... ValueError: pow() outrageous exponent python3 collatz/fast_6x2_mxdys_halt_cryptid.py 68.48s user 2.83s system 98% cpu 1:12.37 total ``` The final value before the latest reset is `N(10^~24684623 ≡ 0 (mod 2), 1)`

Here's the code I used. I did a small amount of validation, but love to see if I can validate against others results.

Notably, the reset values are: ``` N(4, 4) N(4, 56) N(4, 210273200) N(4, ~10^24684623) ```