Nice primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 1: / Line 1: @@
 {{Draft task}}
-::# &nbsp; Take an integer n, greater than zero.
+::# &nbsp; Take an positive integer &nbsp; '''n'''
-::# &nbsp; sumn is sum of n's digits
+::# &nbsp; '''sumn''' &nbsp; is the sum of the decimal digits of &nbsp; '''n'''
-::# &nbsp; If sumn's lenght greater than 1 repeat the (2) for n = sumn
+::# &nbsp; If &nbsp;'''sumn''''s&nbsp; length is greater than &nbsp; '''1''' &nbsp; (unity), &nbsp; repeat step 2 for &nbsp; '''n = sumn'''
-::# &nbsp; Stop when sumn's length equal to 1
+::# &nbsp; Stop when &nbsp;'''sumn''''s&nbsp; length is equal to &nbsp; '''1''' &nbsp; (unity)
-<br> If n and sumn are prime then n is Nice prime
-<br> Let 500 < n < 1000
+If &nbsp; '''n''' &nbsp; and &nbsp; '''sumn''' &nbsp; are prime, &nbsp; then &nbsp; '''n''' &nbsp; is a &nbsp; '''Nice prime'''
-<br>
+Let &nbsp; &nbsp; '''500 &nbsp; &lt; &nbsp; n &nbsp; &lt; &nbsp; 1000'''
 ;Example:
 <pre>
@@ Line 13: / Line 17: @@
 + 6 = 7 (prime)
 </pre>
+<br><br>
 =={{header|Factor}}==