Last active
June 18, 2017 08:33
-
-
Save gabrieleromanato/5463b21ca49dde73714b3b86ba721786 to your computer and use it in GitHub Desktop.
numeri-primi
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
"use strict"; | |
(function() { | |
const isPrimeNumber = number => { | |
if ( number == 1 || number == 2 ) { | |
return true; | |
} | |
for ( var i = 2; i < number; i++ ) { | |
if ( number % i == 0 ) { | |
return false; | |
} | |
} | |
return true; | |
}; | |
const unique = arr => { | |
return arr.reduce(( p, c ) => { | |
if ( p.indexOf( c ) < 0 ) { | |
p.push( c ); | |
} | |
return p; | |
}, []); | |
}; | |
const nextPrime = number => { | |
var n; | |
if( number % 2 == 0 ) { | |
number++; | |
} | |
for( n = number; !isPrimeNumber( n ); n += 2 ) { | |
} | |
return n; | |
}; | |
document.addEventListener( "DOMContentLoaded", () => { | |
let form = document.querySelector( "#prime" ), | |
output = document.querySelector( "#output" ); | |
form.addEventListener( "submit", e => { | |
e.preventDefault(); | |
let n = document.querySelector( "#number" ).value; | |
let text = []; | |
for( var i = 0; i < n; ++i ) { | |
text.push( nextPrime( i ) ); | |
} | |
output.innerHTML = unique( text ).join( " " ); | |
}, false); | |
}); | |
})(); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment