Skip to content

Instantly share code, notes, and snippets.

/index.html

Created November 19, 2016 17:53
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 1 You must be signed in to fork a gist
  • Save anonymous/ac5a4fc7b0b41df924d525c17fdbee67 to your computer and use it in GitHub Desktop.
Save anonymous/ac5a4fc7b0b41df924d525c17fdbee67 to your computer and use it in GitHub Desktop.
Download ZIP
JS Bin // source https://jsbin.com/rolawoc
Raw
index.html
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width">
<title>JS Bin</title>
</head>
<body>
<script id="jsbin-javascript">
let ultimatePrime = number => {
let sqrt = (Math.floor(Math.sqrt(number)));
for (let i = 2 ; i <= number/2; i++){
if(number % i === 0) {
return false;
}
}
return number > 1;
}
console.log(ultimatePrime(4))
let isPrime2 = number => {
if (number < 2) return false;
let sqrt = (Math.floor(Math.sqrt(number)));
for (let i = 2; i <= sqrt; i++){
if (number % i === 0) {
return false;
}
}
return true;
};
console.log(isPrime2(4));
function isPrime(value) {
for(var i = 2; i < value; i++) {
if(value % i === 0) {
return false;
}
}
return value > 1;
}
console.log(isPrime(4));
</script>
<script id="jsbin-source-javascript" type="text/javascript">let ultimatePrime = number => {
let sqrt = (Math.floor(Math.sqrt(number)));
for (let i = 2 ; i <= number/2; i++){
if(number % i === 0) {
return false;
}
}
return number > 1;
}
console.log(ultimatePrime(4))
let isPrime2 = number => {
if (number < 2) return false;
let sqrt = (Math.floor(Math.sqrt(number)));
for (let i = 2; i <= sqrt; i++){
if (number % i === 0) {
return false;
}
}
return true;
};
console.log(isPrime2(4));
function isPrime(value) {
for(var i = 2; i < value; i++) {
if(value % i === 0) {
return false;
}
}
return value > 1;
}
console.log(isPrime(4));
</script></body>
</html>
Raw
jsbin.rolawoc.js
let ultimatePrime = number => {
let sqrt = (Math.floor(Math.sqrt(number)));
for (let i = 2 ; i <= number/2; i++){
if(number % i === 0) {
return false;
}
}
return number > 1;
}
console.log(ultimatePrime(4))
let isPrime2 = number => {
if (number < 2) return false;
let sqrt = (Math.floor(Math.sqrt(number)));
for (let i = 2; i <= sqrt; i++){
if (number % i === 0) {
return false;
}
}
return true;
};
console.log(isPrime2(4));
function isPrime(value) {
for(var i = 2; i < value; i++) {
if(value % i === 0) {
return false;
}
}
return value > 1;
}
console.log(isPrime(4));
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment