3
votes
1answer
74 views

Probability of an ECM factor

Suppose I have a composite number $N$ divisible by some prime $p\le x.$ What is the probability that one iteration of ECM finds $p$, given parameters B1 and B2? Usually people look for factors in ...
1
vote
1answer
64 views

probability of a number not having factors below n?

I want to know the probability that a number is not divisible by any prime smaller than or equal to n. ie, I find a big number, I trial division it up to 300000 and don't find any factors. I want to ...
3
votes
1answer
170 views

Dixon's random squares algorithm: a step in the proof of its subexp. running time

I am currently working to understand Dixon's running time proof of his subexp integer factorization algorithm (random squares). But unfortunately I can not follow him at a certain point in his work. ...