mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 69
Search took 0.02 seconds.
Search: Posts Made By: trilliwig
Forum: Lounge 2006-01-16, 16:42
Replies: 61
Views: 2,920
Posted By trilliwig
I would be interested... my M41 poster is getting...

I would be interested... my M41 poster is getting a little old. :D

Hm, if PerfSci would be willing to ship one of those watchmaker's loupes with the order as well, I'd like one of those. The $3...
Forum: Factoring 2006-01-15, 08:34
Replies: 100
Views: 5,324
Posted By trilliwig
The default parameters assume a polynomial degree...

The default parameters assume a polynomial degree of 5. If the polynomial degree is not 5, more generous parameters usually perform significantly better.
Forum: Factoring 2005-12-21, 16:19
Replies: 100
Views: 5,324
Posted By trilliwig
1 is a factor of all positive integers. :) But...

1 is a factor of all positive integers. :) But yes, it's not a prime factor. You should expect a sqrt run to turn up the trivial factorization 1*N about half the time. Still, with 32 dependencies,...
Forum: Factoring 2005-12-09, 21:03
Replies: 100
Views: 5,324
Posted By trilliwig
Y1 and Y0 must be capitalized, and the value of m...

Y1 and Y0 must be capitalized, and the value of m is wrong. It should be -Y0/Y1 (mod n). Since Y1 and Y0 are supplied, GGNFS can figure out the correct value of m on its own and you can leave it...
Forum: Factoring 2005-12-09, 03:35
Replies: 100
Views: 5,324
Posted By trilliwig
If you want to adjust alim or q0, you should add...

If you want to adjust alim or q0, you should add the setting to your .poly file. The .job file is automatically generated and the Perl script won't notice any changes to it.
Forum: Factoring 2005-11-23, 22:12
Replies: 100
Views: 5,324
Posted By trilliwig
At this point all I can offer is voodoo. Try...

At this point all I can offer is voodoo. Try raising your alim by 100 in your .poly file and rerun factLat.pl to force a relation dump and reprocessing. Maybe matbuild/matsolve will do something...
Forum: Factoring 2005-11-22, 22:29
Replies: 100
Views: 5,324
Posted By trilliwig
Not sure what Chris Monico's up to these days. I...

Not sure what Chris Monico's up to these days. I haven't heard from him in a while. He's still teaching at TTU tho, if his course information is accurate.



I doubt that would help this...
Forum: Factoring 2005-11-22, 18:14
Replies: 100
Views: 5,324
Posted By trilliwig
It's probably this bug...

It's probably this bug (http://sourceforge.net/tracker/index.php?func=detail&aid=1233206&group_id=140917&atid=747800), which is still to be fixed and affects all 0.77.1 versions. I think it's one of...
Forum: Factoring 2005-11-10, 23:59
Replies: 14
Views: 1,163
Posted By trilliwig
Nice catch, congratulations!

Nice catch, congratulations!
Forum: Cunningham Tables 2005-10-17, 21:33
Replies: 277
Views: 23,557
Posted By trilliwig
RP Brent's paper is On computing factors of...

RP Brent's paper is On computing factors of cyclotomic polynomials, Mathematics of Computation 61 (1993) (http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pub/pub135.html).

Andrey Kulsha of the...
Forum: Cunningham Tables 2005-10-13, 00:52
Replies: 295
Sticky: 2LM Table
Views: 40,226
Posted By trilliwig
For 2,1402L, 300 curves @B1=11M and 1500 curves...

For 2,1402L, 300 curves @B1=11M and 1500 curves @B1=43M with GMP-ECM 6.0.1, no factor found. Could someone tell me how these newfangled probability sums work?

(Edit: Added to table - Alex)
Forum: NFSNET Discussion 2005-10-06, 01:17
Replies: 4
Views: 1,030
Posted By trilliwig
Nice-sized split, congratulations!

Nice-sized split, congratulations!
Forum: Programming 2005-10-01, 10:48
Replies: 18
Views: 2,412
Posted By trilliwig
http://primes.utm.edu/notes/faq/one.html does a...

http://primes.utm.edu/notes/faq/one.html does a pretty good job of explaining why it is useful to consider 1 as a member of a separate category.


Or indeed, the difference of any permutation of...
Forum: Factoring 2005-09-29, 19:02
Replies: 7
Views: 3,575
Posted By trilliwig
Yup, the Franke/Kleinjung lattice siever does not...

Yup, the Franke/Kleinjung lattice siever does not allow you to use special qs within the factor base (it errors out if q0 < rlim or alim, whichever is applicable). But you can circumvent this by...
Forum: GMP-ECM 2005-09-28, 06:32
Replies: 4
Views: 1,840
Posted By trilliwig
Have you tried running ECM with the -v parameter?...

Have you tried running ECM with the -v parameter? It won't give you a really low-level operation count, but it will give you timings for the different parts of Stage 2. It'd be interesting to see...
Forum: Math 2005-09-23, 06:16
Replies: 8
Views: 479
Posted By trilliwig
Compare Theorem 1 here...

Compare Theorem 1 here (http://primes.utm.edu/prove/prove3_1.html) with Theorem 4 there (http://primes.utm.edu/prove/prove3_2.html).

--
Sam
Forum: NFSNET Discussion 2005-09-15, 06:46
Replies: 13
Views: 2,735
Posted By trilliwig
Hm, I can get close, but no cigar. ?...

Hm, I can get close, but no cigar.

? Nfull=2^1378+1
? L=2^689-2^345+1
? M=2^689+2^345+1
? flist=factor(2^26*x^52+1)
%4 =
[2*x^2 - 2*x + 1 1]

[2*x^2 + 2*x + 1 1]
Forum: NFSNET Discussion 2005-09-14, 01:26
Replies: 13
Views: 2,735
Posted By trilliwig
X^{26}-1 factors as you say, but X^{26}+1 leaves...

X^{26}-1 factors as you say, but X^{26}+1 leaves a 24th degree polynomial expressible as a 12th degree in X^2. You can then use the substitution Z = X^2 + X^{-2} to get it down to a 6th degree...
Forum: Miscellaneous Math 2005-09-12, 22:05
Replies: 8
Views: 10,142
Posted By trilliwig
Heh, the Intel x87 FPU supported loading and...

Heh, the Intel x87 FPU supported loading and storing an 80-bit packed decimal format (10-byte, 1 sign byte and 18 digits with the remaining 9 bytes), and consequently to this day so does any modern...
Forum: Math 2005-09-07, 01:22
Replies: 48
Views: 2,153
Posted By trilliwig
http://en.wikipedia.org/wiki/Lucas_sequence ...

http://en.wikipedia.org/wiki/Lucas_sequence

S_k = V_{2^k}(P=4, Q=1)

Deriving the relationships are a fun exercise in induction.
Forum: Miscellaneous Math 2005-09-04, 03:37
Replies: 23
Views: 2,413
Posted By trilliwig
Ah, ok. Apology accepted; we all have moments of...

Ah, ok. Apology accepted; we all have moments of confusion. Wouldn't do to have disagreements on key points of computational theory. Gotta keep a united front against the darkness after all. ...
Forum: Math 2005-09-04, 03:26
Replies: 48
Views: 2,153
Posted By trilliwig
Try googling for Lucas sequences...

Try googling for Lucas sequences (http://www.google.com/search?hl=en&q=Lucas+sequences&btnG=Google+Search). :innocent:

--
Sam
Forum: Miscellaneous Math 2005-09-04, 00:26
Replies: 23
Views: 2,413
Posted By trilliwig
Erm, I thought I made it clear that it has no...

Erm, I thought I made it clear that it has no bearing, because 400 is not the number of bits, but the number of bits in the number of bits. At least, that's what I spent 3 paragraphs attempting to...
Forum: Miscellaneous Math 2005-09-02, 23:42
Replies: 23
Views: 2,413
Posted By trilliwig
Heh, yes. And oh by the way, it has no relevance...

Heh, yes. And oh by the way, it has no relevance to the problem at hand. In other words, it doesn't matter.

You're saying the number of bits in the number of bits of S(n) is a manageable number....
Forum: Math 2005-09-02, 20:25
Replies: 48
Views: 2,153
Posted By trilliwig
http://www.mersenneforum.org/showpost.php?p=45301&...

http://www.mersenneforum.org/showpost.php?p=45301&postcount=2

To understand it though, you'll need to know what a group (http://mathworld.wolfram.com/Group.html) and subgroup...
Showing results 1 to 25 of 69

 
All times are UTC. The time now is 05:57.

Fri Dec 4 05:57:53 UTC 2020 up 1 day, 2:09, 0 users, load averages: 0.96, 1.05, 1.05

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.