• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 [Collatz] Tommy's collatz lemma tommy1729 Ultimate Fellow Posts: 1,358 Threads: 330 Joined: Feb 2009 09/11/2014, 08:48 AM Considering collatz and the idea of a nontrivial cycle of odd length L , I have this lemma : If a nontrivial collatz cycle of odd lenght L exists , one of its values must be representable by a mod p for some 0 =< a < p with p a prime , division by 2 is then given by multiplication by (1/2) mod p. multiplication by 3 is still the same ( reduced mod p ). And p is an odd prime divisor of L. regards tommy1729 « Next Oldest | Next Newest »

 Possibly Related Threads... Thread Author Replies Views Last Post tommy's simple solution ln^[n](2sinh^[n+x](z)) tommy1729 1 2,166 01/17/2017, 07:21 AM Last Post: sheldonison Tommy's matrix method for superlogarithm. tommy1729 0 1,442 05/07/2016, 12:28 PM Last Post: tommy1729 Dangerous limits ... Tommy's limit paradox tommy1729 0 1,695 11/27/2015, 12:36 AM Last Post: tommy1729 Tommy's Gamma trick ? tommy1729 7 5,510 11/07/2015, 01:02 PM Last Post: tommy1729 Tommy triangles tommy1729 1 1,816 11/04/2015, 01:17 PM Last Post: tommy1729 Tommy-Gottfried divisions. tommy1729 0 1,469 10/09/2015, 07:39 AM Last Post: tommy1729 Tommy's hyperlog tommy1729 0 1,536 06/11/2015, 08:23 AM Last Post: tommy1729 Tommy-Mandelbrot function tommy1729 0 1,752 04/21/2015, 01:02 PM Last Post: tommy1729 tommy equation tommy1729 3 3,553 03/18/2015, 08:52 AM Last Post: sheldonison Kouznetsov-Tommy-Cauchy method tommy1729 0 1,846 02/18/2015, 07:05 PM Last Post: tommy1729

Users browsing this thread: 1 Guest(s)