I'm sorry just realized... This construction only encompasses Fermats and Mersennes...
The number 23=11*2+1 examplifies this... it looks like a Mersenne ( is not ) in my definition u*2^1+1 but in structure looks lika a Fermat ( all sequences ends with 1) A Mersenne 2^n-1=(2^(n-1)-1)*2+1 will give a odd u=2^(n-1)-1 obviously... And the same for Fermat numbers 2^2^n+1 has a u=1 so it only gives a wider definition somehow... Sincerely Jesse 2008/1/11, Jesse Homonnay <[EMAIL PROTECTED]>: > > when in this construction : p = u*2^k+1 > > u is exaktly one its a fermat number > > if k is exaktly 1 its a mersenne number > > for fermat numbers the only loop number is 1 and all other modular > connections > will fall to it. > > For Mersenne numbers we can say there is only one level of non loop > numbers > > hope this explains more... > > J > > 2008/1/8, Jesse Homonnay < [EMAIL PROTECTED]>: > > > > Thx for this enlightning answer... > > > > Something new? > > > > Perhaphs... have to study the paper first... > > > > Anyway i thought the idea of this pattern was interesting since its > > intuitive and have connections to nonlinear dynamical systems... > > > > But mainly because most fundamental results come together in an ( how to > > express? ) coherent environment... > > > > Many thx > > > > Jesse > > > > 2008/1/7, Max Alekseyev < [EMAIL PROTECTED]>: > > > > > > Jesse, > > > > > > Quadratic map x -> x^2 over finite fields was studied in the paper > > > > > > "On the iteration of certain quadratic maps over GF(p)" by T.Vasiga > > > and J.Shallit > > > http://citeseer.ist.psu.edu/629149.html > > > > > > Have you got anything new, compared to what is described in this > > > paper? > > > > > > Regards, > > > Max > > > > > > On Jan 7, 2008 11:00 AM, Jesse Homonnay <[EMAIL PROTECTED]> > > > wrote: > > > > I understand: > > > > > > > > X|n+1 = X|n^2 mod p > > > > > > > > Write the pattern connecting each X|n from the set {1,2,...,p-1} > > > then the > > > > loops of the set i.e those numbers > > > > connecting a ring will be described by p=u*2^k+1 where u is the > > > number of > > > > elements in all rings of this structure. > > > > > > > > example: 13=3*2^2+1 and 1 connects itself obviously and 3 connects 9 > > > wich > > > > reconnects to 3 since > > > > 3^2mod13=9 and 9^2mod13=3 etc... > > > > > > > > hope this clarifies a little... > > > > > > > > 2008/1/7, Mike McCarty <[EMAIL PROTECTED]>: > > > > > > > > > > > > > > Jesse Homonnay wrote: > > > > > > 2002 i found studying at university of Lund Sweden > > > > > > > > > > > > X^2=mod N > > > > > > > > > > This modular equivalence is incomplete. > > > > > > > > > > > where N chosen as prime written out as a whole generative > > > pattern > > > > > actually > > > > > > describes the prime numbers as a generative dynamical system > > > pattern. > > > > > > > > > > I can't put any meaning to this. If you mean that when N is a > > > prime, > > > > > then X^2 has certain properties as a polynomial in the ring of > > > integers > > > > > modulo N, then certainly that's true. It doesn't help much in > > > finding > > > > > primes. > > > > > > > > > > > Mersenne primes are a simple symmetry case ( as well as Fermat > > > primes ) > > > > > > > > > > > > All general identities proven hereby. > > > > > > > > > > This statement seems, erm, somewhat inflated. > > > > > > > > > > > I think this is important > > > > > > > > > > I'm sure you do. However, I don't think you have managed to > > > > > convey what it is to anyone yet. > > > > > > > > > > Mike > > > > > -- > > > > > p="p=%c%s%c;main(){printf(p,34,p,34);}";main(){printf(p,34,p,34);} > > > > > Oppose globalization and One World Governments like the UN. > > > > > This message made from 100% recycled bits. > > > > > You have found the bank of Larn. > > > > > I can explain it for you, but I can't understand it for you. > > > > > I speak only for myself, and I am unanimous in that! > > > > > _______________________________________________ > > > > > Prime mailing list > > > > > [email protected] > > > > > http://hogranch.com/mailman/listinfo/prime > > > > > > > > > _______________________________________________ > > > > Prime mailing list > > > > [email protected] > > > > http://hogranch.com/mailman/listinfo/prime > > > > > > > _______________________________________________ > > > Prime mailing list > > > [email protected] > > > http://hogranch.com/mailman/listinfo/prime > > > > > > > > _______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
