A method for Number Native MooTools, using sieve of Eratosthenes, identifies all prime numbers up to a given number n.
PHP JavaScript
Latest commit fc060fa Oct 30, 2010 @thinkphp speed structure for
Failed to load latest commit information.
Docs docs updated Oct 30, 2010
Source speed structure for little Oct 30, 2010
test speed structure for Oct 30, 2010
README.md modified description Oct 30, 2010
package.yml change path demo Oct 30, 2010



A prime number is a natural number greater than 1 that can be divided without remainder only by itself and by 1. Natural numbers n that can be divided by a number less than n and greater than 1 are composite numbers. Sieve of Eratosthenes identifies all prime numbers up to a given number n. The algorithm works as follows: write the numbers 1, 2, 3,4 ,..., n and will eliminate composites by marking them (initially all numbers are unmarked). This is exactly what the method does using bitwise operations.


How to use

First you must to include the JS files in the head of your HTML document.

<script type="text/javascript" src="mootools.js"></script>
<script type="text/javascript" src="number.toEratosthenes.js"></script>

In your JavaScript code.

        $('f').addEvent('submit', function(e){
            if(e) {e.stop();}
            var n = $('n').get('value').toInt(); 
            if(!n) {return false;}
               var vec = [];
                   vec = (n).toEratosthenes(); 
               var s = ''; 
                   for(var i=0;i<vec.length;i++) {
                       s += vec[i] + ', ';

In your HTML code.

<form id="f" name="f">
<label for="n">N = </label><input type="text" id="n" value="100"/><input type="submit" value="go">
<div id="primenumbers"></div>