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

fix typo again

Browse Source
This commit is contained in:
Stefan Feješ
2017-12-19 22:22:15 +01:00
parent 43ac1da49f
commit 152d684005
3 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -1219,7 +1219,7 @@ const isEven = num => num % 2 === 0;
### isPrime ### isPrime
Checks if the provided intiger is prime number. Checks if the provided integer is a prime number.
Returns `false` if the provided number has positive divisors other than 1 and itself or if the number itself is less than 2. Returns `false` if the provided number has positive divisors other than 1 and itself or if the number itself is less than 2.

2
docs/index.html
View File

@ -763,7 +763,7 @@ Returns <code>true</code> if the number is even, <code>false</code> if the numbe
// isEven(3) -&gt; false // isEven(3) -&gt; false
</code></pre> </code></pre>
</div></div><br/><div class="card fluid"><div class="section double-padded"><h3 id="isprime">isPrime</h3></div><div class="section double-padded"> </div></div><br/><div class="card fluid"><div class="section double-padded"><h3 id="isprime">isPrime</h3></div><div class="section double-padded">
<p>Checks if the provided intiger is 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 &lt; num; i++) if (num % i == 0) return false;

2
snippets/isPrime.md
View File

@ -1,6 +1,6 @@
### isPrime ### isPrime
Checks if the provided intiger is prime number. Checks if the provided integer is a prime number.
Returns `false` if the provided number has positive divisors other than 1 and itself or if the number itself is less than 2. Returns `false` if the provided number has positive divisors other than 1 and itself or if the number itself is less than 2.