andre/30-seconds-of-code
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Travis build: 69

Browse Source
This commit is contained in:
Pl4gue
2017-12-21 22:33:38 +00:00
parent 0b90492a41
commit ac1a10f039
2 changed files with 23 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@ -1386,10 +1386,9 @@ Returns `false` if the provided number has positive divisors other than 1 and it
const isPrime = num => { const isPrime = num => {
for (var i = 2; i * i <= num; i++) if (num % i == 0) return false; for (var i = 2; i * i <= num; i++) if (num % i == 0) return false;
return num >= 2; return num >= 2;
} };
// isPrime(11) -> true // isPrime(11) -> true
// isPrime(12) -> false // isPrime(12) -> false
// isPrime(1) -> false
``` ```
[⬆ back to top](#table-of-contents) [⬆ back to top](#table-of-contents)
@ -2184,3 +2183,4 @@ const validateNumber = n => !isNaN(parseFloat(n)) && isFinite(n) && Number(n) ==
## Credits ## Credits
*Icons made by [Smashicons](https://www.flaticon.com/authors/smashicons) from [www.flaticon.com](https://www.flaticon.com/) is licensed by [CC 3.0 BY](http://creativecommons.org/licenses/by/3.0/).* *Icons made by [Smashicons](https://www.flaticon.com/authors/smashicons) from [www.flaticon.com](https://www.flaticon.com/) is licensed by [CC 3.0 BY](http://creativecommons.org/licenses/by/3.0/).*

5
docs/index.html
View File

@ -868,12 +868,11 @@ Returns <code>true</code> if the number is even, <code>false</code> if the numbe
<p>Checks if the provided integer is a prime number.</p> <p>Checks if the provided integer is a prime number.</p>
<p>Returns <code>false</code> if the provided number has positive divisors other than 1 and itself or if the number itself is less than 2.</p> <p>Returns <code>false</code> if the provided number has positive divisors other than 1 and itself or if the number itself is less than 2.</p>
<pre><code class="language-js">const isPrime = num =&gt; { <pre><code class="language-js">const isPrime = num =&gt; {
for (var i = 2; i &lt; num; i++) if (num % i == 0) return false; for (var i = 2; i * i &lt;= num; i++) if (num % i == 0) return false;
return num &gt;= 2; return num &gt;= 2;
} };
// isPrime(11) -&gt; true // isPrime(11) -&gt; true
// isPrime(12) -&gt; false // isPrime(12) -&gt; false
// isPrime(1) -&gt; false
</code></pre> </code></pre>
</div></div><br/><div class="card fluid"><div class="section double-padded"><h3 id="lcm">lcm</h3></div><div class="section double-padded"> </div></div><br/><div class="card fluid"><div class="section double-padded"><h3 id="lcm">lcm</h3></div><div class="section double-padded">
<p>Returns the least common multiple of two numbers.</p> <p>Returns the least common multiple of two numbers.</p>