Forum: Factoring
2020-06-14, 11:05
|
Replies: 22
Views: 9,513
|
Forum: Factoring
2020-06-13, 22:46
|
Replies: 22
Views: 9,513
This is very interesting, thank you for...
This is very interesting, thank you for explaining it. I’ll implement this approach tomorrow and see how it performs. Do you divide by powers of primes? I currently use a while loop, so while the...
|
Forum: Factoring
2020-06-12, 18:43
|
Replies: 22
Views: 9,513
|
Forum: Factoring
2020-06-11, 22:52
|
Replies: 22
Views: 9,513
|
Forum: Factoring
2020-06-11, 19:38
|
Replies: 22
Views: 9,513
|
Forum: Factoring
2020-06-11, 15:38
|
Replies: 22
Views: 9,513
|
Forum: Factoring
2020-06-09, 21:38
|
Replies: 13
Views: 6,454
|
Forum: Factoring
2020-06-09, 11:56
|
Replies: 13
Views: 6,454
This is weird, I could have sworn I got 79 a...
This is weird, I could have sworn I got 79 a bunch of times using the calculator that comes with windows, but now I'm getting 26, maybe I imagined it, maybe I was temporarily teleported to an...
|
Forum: Factoring
2020-06-09, 10:11
|
Replies: 13
Views: 6,454
Thank you very much for your response, I'm...
Thank you very much for your response, I'm looking at things a lot closer and I have a specific example to show:
N = 523022617466601111760007224100074291200000001
A = 539044587247440481
B =...
|
Forum: Factoring
2020-06-08, 21:50
|
Replies: 13
Views: 6,454
MPQS Trial Division Optimisation
I've been adding debugging statements to my MPQS implementation and I can't figure out why this is happening:
I'm currently trial dividing by every prime in the factor base, and as far as I...
|
Forum: Factoring
2020-06-07, 15:58
|
Replies: 2
Views: 3,488
|
Forum: Factoring
2020-06-07, 08:44
|
Replies: 2
Views: 3,488
How to combine relations for MPQS?
I am attempting to combine two relations for MPQS but I'm having trouble with the mathematics behind it:
I have:
x1 = ((-4102948192782457639498)^2 - N) / 425579045527454809
x2 =...
|
Forum: Factoring
2016-12-02, 19:01
|
Replies: 0
Views: 794
Are these polynomials being generated correctly?
I'm just double checking that the polynomials in my upcoming implementation of the MPQS are being generated correctly:
n = 1287871475892167
First prime is near sqrt(sqrt(2*N)/M), where M is the...
|
Forum: Factoring
2016-11-28, 15:13
|
Replies: 1
Views: 1,265
Bypass Sieving Stage?
I had an idea but I thought I would ask here as to not waste time. After the first pass of the sieving algorithm, there will be a set of indices which have accumulated a value higher than some...
|
Forum: jasong
2013-02-08, 11:10
|
Replies: 30
Views: 2,342
|
Forum: Miscellaneous Math
2013-02-07, 11:53
|
Replies: 4
Views: 1,610
Depending on the complexity of the maths...
Depending on the complexity of the maths involved, I might be able to write my own sieve.
The way I'm searching is fixing k and incrementing n.
The limit for k is the same as the limit for an...
|
Forum: Miscellaneous Math
2013-02-07, 11:35
|
Replies: 4
Views: 1,610
|
Forum: Miscellaneous Math
2013-02-07, 10:36
|
Replies: 4
Views: 1,610
Fun Sequence
I've started searching this sequence for prime numbers:
((n+1)\mathrm{!}\ - \ n\mathrm{!})k + 1
I like this sequence because N-1 is easy to factor so proving primality is straight forward.
Are...
|
Forum: Programming
2013-01-25, 16:50
|
Replies: 4
Views: 1,337
|
Forum: Programming
2013-01-25, 11:41
|
Replies: 4
Views: 1,337
Modular Inversion Bottleneck
I finally got my MPQS code working, it's much faster than my QS implementation, but it's still pretty slow once the numbers get up to around 70 digits.
I have experimented with smaller blocks...
|
Forum: Programming
2013-01-21, 14:23
|
Replies: 18
Views: 1,519
|
Forum: Programming
2013-01-20, 08:30
|
Replies: 18
Views: 1,519
|
Forum: Programming
2013-01-20, 01:23
|
Replies: 18
Views: 1,519
I've been assuming that when you have a sieve...
I've been assuming that when you have a sieve array from [-M, M], it is indexed as follows:
Say M = 15, so the array runs from -15 to 15, and contains 31 elements. Element 0 would be -15, element...
|
Forum: Programming
2013-01-19, 01:53
|
Replies: 18
Views: 1,519
Of course I could test it, I just thought it...
Of course I could test it, I just thought it would be worth asking since it may not necessarily speed up the sieving by much, and I still have the linear algebra phase to code, and I need to fix this...
|
Forum: Programming
2013-01-18, 23:27
|
Replies: 18
Views: 1,519
|