Tagged Questions
1
vote
1answer
66 views
Sieve higher powers with logarithmic optimization
I am factoring number $N = 90283$ using quadratic sieve. Bound is $B = 44$. I find factor base to be $\{2, 3, 7, 17, 23, 29, 37, 41\}$. I have $50$ element sieving interval:
$\{318, 921, 1526, ...
11
votes
1answer
361 views
Quadratic sieve algorithm
I am stuck with the sieving stage of Quadratic Sieve algorithm. I've read lots of papers to this point but I can't find any guidlines how to choose sieving interval or how sieving is actually done ...
3
votes
4answers
161 views
Prime factorization, Composite integers.
Describe how to find a prime factor of 1742399 using at most 441 integer divisions and one square root.
So far I have only square rooted 1742399 to get 1319.9996. I have also tried to find a prime ...
4
votes
0answers
478 views
Obtain a contradiction
Motivation :
The motivation is to show that the equation $x^{2b}.x^{2a} +(3-x^{2b}) x^{a} + (1-s^2)=0 $ has no solutions in integers for any values of $x,b,a,s$ ( choosen as per the constraints ...
1
vote
0answers
49 views
lower bounds for maximum computing times for integer factorisation
Supposing that n were known to have two prime factors, and that the computer had a database of all the primes $<\sqrt{n}$. Then, unless n is square, one factor would be $<\sqrt{n}$. If an ...
2
votes
1answer
87 views
Factoring short intervals
There are algorithms (e.g., SIQS) that factor individual numbers. For large ranges of numbers, sieving is more efficient: for example, $(x^2,x^2+x)$ can be factored in time roughly linear in $x$.
...
