Revision as of 21:27, 14 December 2019 (view source) rosettacode>Paddy3118 m (→‎Python: Tabulated: English) ← Older edit		Revision as of 21:36, 14 December 2019 (view source) rosettacode>Paddy3118 m (sp.) Newer edit →
Line 5: Given: * A starting, positive integer (greater than one), N. * A selection of possible integer perfect ~~devisors~~divisors, D. * And a selection of possible subtractors, S. The goal is find the minimum number of steps necessary to reduce N down to one.

Minimal steps down to 1: Difference between revisions

Minimal steps down to 1 (view source)