# Difference between revisions of "Sieve of Sundaram"

m (→Generalization) |
m (→Generalization for r-almost prime finding) |
||

(10 intermediate revisions by the same user not shown) | |||

Line 75: | Line 75: | ||

==Optimization== | ==Optimization== | ||

− | The equivalent in Step 2 above, of the [[Sieve of Eratosthenes]] starting the at the next prime squared, is starting at <math> | + | The equivalent in Step 2 above, of the [[Sieve of Eratosthenes]] starting the at the next prime squared, is starting at <math>2f^2+2f</math> for next index <math>f</math> |

− | ==Generalization== | + | ==Generalization for prime finding== |

Looking close, if you know [[modular arithmetic]], you'll note the remainder 1 forms the modular multiplicative group modulo 2. This generalizes to the modular multiplicative group mod any natural number( with loss of factors in the prime list). This generalization either needs <math>\varphi(m)</math> copies of the same numbers ( one for each class), or <math>T_{\varphi(m)}</math> (triangle numbers) colors . The class of remainder 1, is the only class where variable must stay nonzero to introduce a nontrivial factor by default ( negative representatives increase variable value required by 1). Modulo 30 is sketched out below (8 classes): | Looking close, if you know [[modular arithmetic]], you'll note the remainder 1 forms the modular multiplicative group modulo 2. This generalizes to the modular multiplicative group mod any natural number( with loss of factors in the prime list). This generalization either needs <math>\varphi(m)</math> copies of the same numbers ( one for each class), or <math>T_{\varphi(m)}</math> (triangle numbers) colors . The class of remainder 1, is the only class where variable must stay nonzero to introduce a nontrivial factor by default ( negative representatives increase variable value required by 1). Modulo 30 is sketched out below (8 classes): | ||

− | <cmath> | + | <cmath>\begin{array}{ccccccccc} |

− | + | c\slash d&1&7&11&13&17&19&23&29\\ | |

− | + | 1&a+b&7a+b&11a+b&13a+b&17a+b&19a+b&23a+b&29a+b\\ | |

− | + | 7&a+7b&7(a+b)+1&11a+7b+2&13a+7b+3&17a+7b+3&19a+7+4&23a+7b+5&29a+7b+6\\ | |

− | + | 11&a+11b&7a+11b+2&11(a+b)+4&13a+11b+4&17a+11b+6&19a+11b+6&23a+11b+8&29a+11b+10\\ | |

− | + | 13&a+13b&7a+13b+3&11a+13b+4&13(a+b)+5&17a+13b+7&19a+13b+8&23a+13b+9&29a+13b+12\\ | |

− | + | 17&a+17b&7a+17b+3&11a+17b+6&13a+17b+7&17(a+b)+9&19a+17b+10&23a+17b+13&29a+17b+16\\ | |

− | + | 19&a+19b&7a+19b+4&11a+19b+6&13a+19b+8&17a+19b+10&19(a+b)+12&23a+19b+14&29a+19b+18\\ | |

− | + | 23&a+23b&7a+23b+13&11a+23b+8&13a+23b+9&17a+23b+13&19a+23a+14&23(a+b)+17&29a+23b+22\\ | |

− | + | 29&a+29b&7a+29b+6&11a+29b+10&13a+29b+12&17a+29b+16&19a+29b+18&23a+29b+22&29(a+b)+28\\ | |

− | + | \end{array}</cmath> | |

+ | The table leaves <math>30ab</math> off each to save space. the general rule, for modulus <math>m</math>, with remainders <math>c,d</math> is: <cmath>m(mab+da+cb+\lfloor {cd\over m}\rfloor)+(cd\bmod m)</cmath> in general. | ||

+ | ==Generalization for r-almost prime finding== | ||

+ | <math>r</math>-almost prime | ||

+ | : A natural number with <math>r</math> prime factors including repetitions. | ||

+ | The sieve can be recursed on arguments <math>a</math> and <math>b</math> to check <math>mb+d</math> or <math>ma+c</math> for primality, if both are, we have a semiprime. | ||

+ | |||

+ | On the chance we don't get back prime for more than one, we can test the components. This will find out if our original number had 3 prime factors. | ||

+ | |||

+ | In the case of neither of <math>a,b</math> get back prime we have at least 4 prime factors, and this can go to any depth you choose. | ||

+ | |||

+ | |||

+ | See Also: | ||

+ | |||

+ | [[Number Theory]] | ||

+ | [[Sieve of Eratosthenes]] | ||

[[Category:Algorithms]] | [[Category:Algorithms]] |

## Latest revision as of 18:10, 27 February 2020

## Contents

## Description

The **Sieve of Sundaram** is a sieve for a range of **odd** prime numbers.The sieve starts out listing the natural numbers to like the following example ()

### Step 2

Then it finds all numbers of form ( fancy way of saying start at and increase by , for each not already eliminated ) and eliminates them (empty cells):

### Step 3

Double each number and add one:

## Basis

The basis of the algorithm is that for (without loss of generality, as the form we double and add 1 to is made up of commutative operations); with both factors nontrivial.

## Optimization

The equivalent in Step 2 above, of the Sieve of Eratosthenes starting the at the next prime squared, is starting at for next index

## Generalization for prime finding

Looking close, if you know modular arithmetic, you'll note the remainder 1 forms the modular multiplicative group modulo 2. This generalizes to the modular multiplicative group mod any natural number( with loss of factors in the prime list). This generalization either needs copies of the same numbers ( one for each class), or (triangle numbers) colors . The class of remainder 1, is the only class where variable must stay nonzero to introduce a nontrivial factor by default ( negative representatives increase variable value required by 1). Modulo 30 is sketched out below (8 classes):

The table leaves off each to save space. the general rule, for modulus , with remainders is: in general.

## Generalization for r-almost prime finding

-almost prime

- A natural number with prime factors including repetitions.

The sieve can be recursed on arguments and to check or for primality, if both are, we have a semiprime.

On the chance we don't get back prime for more than one, we can test the components. This will find out if our original number had 3 prime factors.

In the case of neither of get back prime we have at least 4 prime factors, and this can go to any depth you choose.

See Also: