Re: Simple integer factorization algorithm
- From: Tim Smith <reply_in_group@xxxxxxxxxxxxxxxx>
- Date: Sun, 30 Nov 2008 00:39:24 -0800
In article <4931e437$0$3686$9b622d9e@xxxxxxxxxxxxxxx>,
Christian <fakemail@xxxxxx> wrote:
a^2 = (119)(10^2)^{-1} - 1 mod 11 = 8 mod 11,
119/100 -1 mod 11 = 1.19 - 1 mod 11 != 8 mod 11
I don't even understand your example...
The notation
a^{-1} mod n
means the inverse of a under multiplication, mod n, not 1/a. The
inverse of 100 mod 11 is 1, because 1*100 = 1 mod 11.
--
--Tim Smith
.
- References:
- Simple integer factorization algorithm
- From: JSH
- Re: Simple integer factorization algorithm
- From: Christian
- Simple integer factorization algorithm
- Prev by Date: Re: Netbeans failure mode
- Next by Date: Re: Netbeans failure mode
- Previous by thread: Re: Simple integer factorization algorithm
- Next by thread: Re: Simple integer factorization algorithm
- Index(es):