MHB Integer Factorization: Help with Pollards P-1 & Quadratic Sieve

behnazbarzi
Messages
1
Reaction score
0
hey guys, I wonder if you could help me... i cannot factor the integer 2896753 by pollards p-1 method and the quadratic sieve .
 
Physics news on Phys.org
What factor base are you using for Pollard's p - 1? It will work, though you need a fairly large factor base for such a small input number (primes up to 31) unless you are using the two-step variant.

As for the quadratic sieve, it pretty much always works for sufficiently large numbers (including yours) so obviously the implementation you are using is broken. How are you carrying out the quadratic sieve?

To be fair though for a number of this size I'd start by carrying out trial division up to the first ten thousand primes (which would factor it) and then directly moving on to ECM.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...

Similar threads

Back
Top