Prime Factor Testing- A Method

z a factorization method was to be understood as allowed.


given p as p = prime 1* prime 2;

Denote a floor as the integer divisor. Allow a loop to exit as the
solved division fails. So real answer simply begs how to prime test
any integer.

Test number z = z+1, divide and if integer solves apply test for a
prime? NO only one test was to be devised. A valid integer as given p
and z. Fast divisor means no divison as a real.. SO all integer as
solvable was to be:

single character naming convention will mean analogy.

char[z] an array of z size a division meant the place. So sort
char[p] as a relative list.

place char[z] a place was to be searched to find z. given a set p
find a z. ANy z. So take the set p and sort such that z exists.


for a= 1 to A loop
for z= 1 to Z loop
if z a=a+1; /*the inner loop increment the outer answer loop
/*a prime test is conducted each incremeent of a*/
if a*z <p then exit inner loop
/*if z increments and is not a prime,exit the inner loop immediately.
z=z+1;
end loop
end loop

Integer multiplication as a rule is fast and loop outer or a appears
the smaller prime to be found.

The advantage was a simple single fast multiplication.

How does this idea look?

Douglas Eagleson
Gaithersburg, MD USA
.

Relevant Pages

  • RE: Is there an etc. command in perl?
    ... but to stop when it finds a modulus. ... In this case you can either use a whileloop ... (loop while the divisor is smaller than the sqrt(x) ... divide the tested number) and increment the divisor in the body or ...
    (perl.beginners)
  • RE: Is there an etc. command in perl?
    ... but to stop when it finds a modulus. ... In this case you can either use a whileloop ... (loop while the divisor is smaller than the sqrt(x) ... divide the tested number) and increment the divisor in the body or ...
    (perl.beginners)
  • Re: 32bits division
    ... If your DSP doesn't have a hardware division operation, ... Can the operands be scaled so that the divisor can be a power of 2, ... Now I know that this can be done in one cycle by a DSP, ... be faster than a loop. ...
    (comp.dsp)
  • Re: 32bits division
    ... If your DSP doesn't have a hardware division operation, ... Can the operands be scaled so that the divisor can be a power of 2, ... Created a reciprocal lookup table with enough resolution for my ... be faster than a loop. ...
    (comp.dsp)
  • Re: Can PLL Freq Error be zero?
    ... >Oh, so S is the number by which things are divided, the divisor, and has ... Well, I did specify that Somethingorother was the divider in the loop, ... I never use that Laplace stuff. ...
    (sci.electronics.design)