Forum: Software
2006-12-31, 15:03
|
|
Replies: 1
Views: 2,338
GWNUM as DLL?
Is there GWNUM as precompiled DLL, just to easy call fast multiplication and squaring?
I have tested new version of PRP.EXE (24.14) and found that it incredibly, fantastically fast, 20 times...
|
|
Forum: Math
2004-05-15, 07:51
|
|
Replies: 23
Views: 3,033
|
|
Forum: Math
2004-05-14, 14:47
|
|
Replies: 23
Views: 3,033
I use the GMP-Routine to perform the modular...
I use the GMP-Routine to perform the modular power calculation.
This is pretty fast. It takes about 5 to 10 seconds on a Pentium III machine (666 Mhz) for a number which is about 3000 digits long. ...
|
|
Forum: Math
2004-05-14, 04:45
|
|
Replies: 23
Views: 3,033
You have not said the main thing!
How long...
You have not said the main thing!
How long prime are you looking for?
How fast is your Modular Power?
Is it as fast as mine (if you downloaded my prog),
or it is as fast as PRP.EXE, or you don't...
|
|
Forum: Math
2004-05-13, 13:28
|
|
Replies: 23
Views: 2,829
(10^p)-1 is never prime
You are right... ...
(10^p)-1 is never prime
You are right... :spam:
But we are talking about primes (10^p-1)/9, i.e. about numbers which
have only 111111... in their decimal representation.
It is 2 units(...
|
|
Forum: Math
2004-05-13, 10:32
|
|
Replies: 23
Views: 2,829
Finally, your use of the term "Generalized...
Finally, your use of the term "Generalized Mersenne Prime" is a mis-nomer.
Mathematicians have used the term for years, but it means something
entirely different. Note that a Mersenne prime is a...
|
|
Forum: Math
2004-05-13, 10:24
|
|
Replies: 23
Views: 3,033
|
|
Forum: Hardware
2004-05-09, 06:01
|
|
Replies: 4
Views: 1,670
ASM Optimization
I have downloaded Intel Manual - Pentium Instruction Set vol.2A-2B,
files 25366613.pdf and 25366713.pdf
How can I find info about number of ticks (or tacts) for every ASM instruction?
One my...
|
|
Forum: Miscellaneous Math
2004-05-08, 05:10
|
|
Replies: 29
Views: 4,370
I see what you want to say:
Instead...
I see what you want to say:
Instead (x*x*x*x*x*x*...*x) mod y it is possible do not calculate
the whole huge product of x, and one should take modulo after every mult,
((((x*x) mod y) *x) mod y)...
|
|
Forum: Math
2004-05-05, 15:32
|
|
Replies: 23
Views: 3,033
|
|
Forum: Math
2004-05-04, 14:41
|
|
Replies: 23
Views: 3,033
|
|
Forum: Math
2004-05-03, 16:35
|
|
Replies: 23
Views: 3,033
It doesn't need to be totally accurate.
You...
It doesn't need to be totally accurate.
You need not primality test. You need a "compositeness" test, i.e. kinda
test which never miss if it says "composite". It can say "dont' knoff" but if it...
|
|
Forum: Math
2004-05-01, 14:39
|
|
Replies: 23
Views: 3,033
|
|
Forum: Math
2004-05-01, 05:23
|
|
Replies: 23
Views: 3,033
I have already asked about it:
"Is there kind...
I have already asked about it:
"Is there kind of "middle" test, much slower than trial division on 3,5,7 but still much faster then Rabin??? I want to embed it before Rabin-test."
But I didn't...
|
|
Forum: Math
2004-04-24, 18:00
|
|
Replies: 7
Views: 6,501
|
|
Forum: Math
2004-04-24, 11:56
|
|
Replies: 28
Views: 5,403
|
|
Forum: Hardware
2004-04-24, 11:00
|
|
Replies: 11
Views: 1,826
|
|
Forum: Math
2004-04-24, 10:29
|
|
Replies: 7
Views: 6,501
Here you are, Bob Silverman!!!
Nice to hear...
Here you are, Bob Silverman!!!
Nice to hear you, an angry man, an implacable enemy of bullshit, a preceptor of erringers.
Are you one of a couple of tens so called GIMPS experts?
That is an...
|
|
Forum: Hardware
2004-04-23, 16:04
|
|
Replies: 11
Views: 1,826
|
|
Forum: Math
2004-04-23, 05:04
|
|
Replies: 7
Views: 6,501
Why so complex?
You need a 10 million digit...
Why so complex?
You need a 10 million digit prime?
It is easy.
Let's N=k*2^33,000,000+1
Then choose small k and a for which a^[(N-1)/2]=-1 mod N
Thats all falks.
And it is easier than...
|
|
Forum: Hardware
2004-04-22, 13:02
|
|
Replies: 11
Views: 1,826
That is an impressive accomplishment for high...
That is an impressive accomplishment for high level language programming.
The secret is that I call fftw3.dll from fftw.org, and after performing an inverse FFT all I need is to take care about...
|
|
Forum: Hardware
2004-04-21, 15:51
|
|
Replies: 11
Views: 1,826
|
|
Forum: Math
2004-04-20, 04:54
|
|
Replies: 1
Views: 1,186
Sorry, I have noticed a pun...
JacobiSymbol =...
Sorry, I have noticed a pun...
JacobiSymbol = -1 does not mean "quadratic non-residue".
But I'm right, there is a super-extended Proth theorem:
for integer _a_ with Jacobi(a,N)=-1 (or for odd _a_...
|
|
Forum: Math
2004-04-19, 12:35
|
|
Replies: 1
Views: 1,186
Extended Proth Theorem
I am writing a Proth prime generator (yet another... ;-)
The Proth theorem says:
"Let n > 1, k < 2^n and N = k*2^n + 1 be a quadratic non-residue (mod a) for some odd prime a. Then the necessary...
|
|
Forum: Miscellaneous Math
2004-04-16, 14:21
|
|
Replies: 17
Views: 5,131
the L-L primality test that works for Mersenne...
the L-L primality test that works for Mersenne numbers is much faster than tests that work for GF numbers.
I dont' think so. I believe that all classical N +/- 1 tests have the same laboriousness....
|
