Factorization of an integer in prime numbers 2,3,5
function prime235Factorization input Integer n; output Boolean success "= true, if factorization in 2,3,5 is possible"; output Integer e2 "n = 2^e2*3^e3*5^e5"; output Integer e3 "n = 2^e2*3^e3*5^e5"; output Integer e5 "n = 2^e2*3^e3*5^e5"; end prime235Factorization;
Date | Description |
---|---|
Nov. 29, 2015 |
Initial version implemented by
Martin R. Kuhn and Martin Otter
(DLR Institute of System Dynamics and Control) The research leading to these results has received funding from the European Union’s Seventh Framework Programme (FP7/2007-2016) for the Clean Sky Joint Technology Initiative under grant agreement no. CSJU-GAM-SGO-2008-001. |