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
