Write the test cases on prime number with result ?
- Let the prime number be n.
- Divide the number n by 1 remainder=0 pass.
- Divide the number n by n remainder=0 pass.
- Divide the number n by 2 remainder!=0 pass.
- Divide the number n by up to n-1 and if remainder not equal zero, then it is a prime number.
Prime Number Algorithm
Example
function primeTester (n) {
//take out edge case 0 and 1
if(n<=1)
return false;
//go from 3 since 2 is a prime number
for(var i=3; i<n; i++){
//check if n is divisible by i
if(n%i ===0 )
return false
}
//if passed all out test
return true;
}Categorized in:
Tagged in:
Accenture interview questions and answers, algorithm and flowchart to find prime number, algorithm to find prime numbers from 1 to n, Applied Materials interview questions and answers, AVEVA Software interview questions and answers, best algorithm to find prime numbers, c program to find prime factors of a number using function, calculate prime numbers, Capgemini interview questions and answers, CASTING NETWORKS INDIA PVT LIMITED interview questions and answers, CGI Group Inc interview questions and answers, check if a number is prime, check if binary number is prime, Collabera Technologies interview questions and answers, CSG International interview questions and answers, Dell International Services India Pvt Ltd interview questions and answers, efficient prime number program, FIS Global Business Solutions India Pvt Ltd interview questions and answers, HealthAsyst Pvt Ltd interview questions and answers, how to find prime numbers, how to find prime numbers algorithm, how to find prime numbers easily, how to find prime numbers from 1 to 100, how to find prime numbers in clist of prime numbers, how to tell if a large number is prime, IBM interview questions and answers, Indecomm Global Services interview questions and answers, Infogain interview questions and answers, Infosys Technologies interview questions and answers, know how to test if a number up to 150 is prime, L&T Infotech interview questions and answers, Mavenir interview questions and answers, Mindtree interview questions and answers, Newt Global interview questions and answers, Oracle Corporation interview questions and answers, PeopleStrong interview questions and answers, Persistent Systems interview questions and answers, prime number algorithm, prime number algorithm c++, prime number algorithm in c, prime number algorithm java, prime number algorithm python, prime number program in c, prime numbers upto n, print all prime numbers, R Systems interview questions and answers, SAP Labs India Pvt Ltd interview questions and answers, shortcut to find prime numbers, Tech Mahindra interview questions and answers, tricks to find prime numbers, Trigent Software interview questions and answers, UnitedHealth Group interview questions and answers, ValueLabs interview questions and answers, Virtusa Consulting Services Pvt Ltd interview questions and answers, write an algorithm to find a number is prime or not, zycus infotech interview questions and answers