User Tools

Site Tools


prelude_to_factovisors

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

prelude_to_factovisors [2011/09/25 12:54]
jtkorb created
prelude_to_factovisors [2011/09/25 13:08] (current)
jtkorb
Line 10: Line 10:
  
 For each non-zero input value, ''​n'',​ determine find the prime factors. ​ Print all factors on a single line as a sequence of terms of the form ''​p^m'',​ indicating that prime ''​p''​ appears ''​m''​ times in ''​n''​. For each non-zero input value, ''​n'',​ determine find the prime factors. ​ Print all factors on a single line as a sequence of terms of the form ''​p^m'',​ indicating that prime ''​p''​ appears ''​m''​ times in ''​n''​.
 +
 +Print the primes in numerical order, lowest to highest. ​ Do not print any primes whose exponent is 0.
  
 ===== Sample Input ===== ===== Sample Input =====
prelude_to_factovisors.txt ยท Last modified: 2011/09/25 13:08 by jtkorb