Skip to content

Assignment #10

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ElaineChoo wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Assignment #10

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
9de6ff3
complete
ElaineChoo Feb 27, 2018
e9e36ee
complete
ElaineChoo Feb 27, 2018
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 9 additions & 0 deletions js/index.html
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
<!DOCTYPE html>
<html>
<head>
<title>This is the Title</title>
</head>
<body>
<script src="letterCount.js"></script>
</body>
</html>
22 changes: 22 additions & 0 deletions js/isPrime.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
function isPrime(n) {
// prime numbers must be greater than 1
if (n < 2)
return false;

//total number of loop run to test on each number
let maxIteration = Math.ceil(Math.sqrt(n));

//number to test starting from 2
for (var i = 2; i <= maxIteration; i++) {
if (n == 2)
// 2 is a prime number
return true;
else if (n % i == 0)
//if number is divisible, number is not prime
return false;
}
//if number is NOT divisible by any number, number is prime
return true;
}

console.log(isPrime(n));
36 changes: 36 additions & 0 deletions js/primes.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
let n;
function isPrime(n) {
// prime numbers must be greater than 1
if (n < 2)
return false;

//total number of loop run to test on each number
let maxIteration = Math.ceil(Math.sqrt(n));

//number to test starting from 2
for (var i = 2; i <= maxIteration; i++) {
if (n == 2)
// 2 is a prime number
return true;
else if (n % i == 0)
//if number is divisible, number is not prime
return false;
}
//if number is NOT divisible by any number, number is prime
return true;
}

// max number to test
let maxNumber = 50;
//set a variable array
let numberArray = [];
//if number is prime, push number to array
//function prime(n) {
for(n = 0; n <= maxNumber; n++) {
let result = isPrime(n);
if (result === true) {
numberArray.push(n);
}
}
//print array of prime numbers
console.log(numberArray);