Smith numbers

From Rosetta Code
Revision as of 04:59, 9 April 2016 by rosettacode>Paulo Jorente (Created page with "{{draft task}} Smith numbers are numbers that the sum of the integers that make up that number is the same as the sum of its prime factors. Example: 166...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Smith numbers is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.

Smith numbers are numbers that the sum of the integers that make up that number is the same as the sum of its prime factors.

Example: 166 => 2 x 83 => 2 + 8 + 3 = 1 + 6 + 6 = 13.

The task: write a program to find all Smith numbers below 100_000_000.

Retrieved from "https://rosettacode.org/wiki/Smith_numbers?oldid=266991"