Sieve needed for k*b1^m*b2^n+1

[R.D. Silverman]

Originally Posted by geoff

Some people seem to have missed the part of the original message where it was stated that k is the sieving variable. In k*b1^m*b2^n, b1, b2, m, n are all fixed.

.

But now the sieve becomes TRIVIAL; you are sieving over an
arithmetic progression 1 + k * r, with r fixed for k = 0,1,2,3,.......

And even if k and r are multi-precision, the only MP code one
needs is to compute r mod p_i for each p_i in your sieve. This
is to initialize the sieve. One can even speed this sieve by using some
variant of Brent's sub-linear sieve. (but this takes a bit more MP code
to implement).

[samphagan]

Originally Posted by R.D. Silverman

But now the sieve becomes TRIVIAL; you are sieving over an
arithmetic progression 1 + k * r, with r fixed for k = 0,1,2,3,.......

And even if k and r are multi-precision, the only MP code one
needs is to compute r mod p_i for each p_i in your sieve. This
is to initialize the sieve. One can even speed this sieve by using some
variant of Brent's sub-linear sieve. (but this takes a bit more MP code
to implement).

Have you ever once considered that someone might live with disabilities and still have talent so they may know bits and pieces of high level knowledge of abstract mathematical concepts without knowing the full picture? Have you ever once considered sympathy or empathy?... Or is that not a commonly used process in high mathematics?

[Batalov]

You have patiently waited for 13 years to post this?
And you didn't notice that R.D. Silverman answered geoff's message, not 'beyastard's?

[samphagan]

Originally Posted by Batalov

You have patiently waited for 13 years to post this?
And you didn't notice that R.D. Silverman answered geoff's message, not 'beyastard's?

sorry my bad i wasn't seeing clearly