Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
[Collatz] Tommy's collatz lemma
#1
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
Reply


Possibly Related Threads...
Thread Author Replies Views Last Post
  Tommy's Gaussian method. tommy1729 20 1,539 08/19/2021, 09:40 PM
Last Post: tommy1729
  " tommy quaternion " tommy1729 13 3,619 03/23/2021, 01:21 PM
Last Post: tommy1729
  tommy's simple solution ln^[n](2sinh^[n+x](z)) tommy1729 1 4,751 01/17/2017, 07:21 AM
Last Post: sheldonison
  Tommy's matrix method for superlogarithm. tommy1729 0 3,137 05/07/2016, 12:28 PM
Last Post: tommy1729
  Dangerous limits ... Tommy's limit paradox tommy1729 0 3,280 11/27/2015, 12:36 AM
Last Post: tommy1729
  Tommy's Gamma trick ? tommy1729 7 11,613 11/07/2015, 01:02 PM
Last Post: tommy1729
  Tommy triangles tommy1729 1 3,820 11/04/2015, 01:17 PM
Last Post: tommy1729
  Tommy-Gottfried divisions. tommy1729 0 2,908 10/09/2015, 07:39 AM
Last Post: tommy1729
  Tommy's hyperlog tommy1729 0 3,041 06/11/2015, 08:23 AM
Last Post: tommy1729
Sad Tommy-Mandelbrot function tommy1729 0 3,395 04/21/2015, 01:02 PM
Last Post: tommy1729



Users browsing this thread: 1 Guest(s)