Retired
Prime numbers are Prime! (retired)
543Tizoy
Description:
Write a function that checks whether a number is prime or not (should return true or false). A prime number is any natural number that is greater than 1 and is divisible only by itself and 1.
Examples:
PrimeTest(13); //should return true.
PrimeTest(18); //should return false (18 can be devided by 2;9).
PrimeTest(-7); //should return false (-7 can be devided by -1).
Fundamentals
Algebra
Mathematics
Algorithms
Logic
Loops
Control Flow
Basic Language Features
Numbers
Data Types
Similar Kata:
Stats:
| Created | Feb 28, 2015 |
| Warriors Trained | 1024 |
| Total Skips | 170 |
| Total Code Submissions | 1902 |
| Total Times Completed | 543 |
| JavaScript Completions | 543 |
| Total Stars | 10 |
| % of votes with a positive feedback rating | 100% of 3 |
| Total "Very Satisfied" Votes | 56 |
| Total "Somewhat Satisfied" Votes | 2 |
| Total "Not Satisfied" Votes | 8 |
| Total Rank Assessments | 62 |
| Average Assessed Rank | 6 kyu |
| Highest Assessed Rank | 2 kyu |
| Lowest Assessed Rank | 8 kyu |
