Old uni homework assignment, first day of aglorithmes class. The most efficient way I could think of for finding unique set of 3 factors for any giving number.
Write a number 476648468
['(1 x 1 x 476648468)', '(1 x 2 x 238324234)', '(1 x 4 x 119162117)', '(1 x 8293 x 57476)', '(1 x 14369 x 33172)', '(1 x 16586 x 28738)', '(2 x 2 x 119162117)', '(2 x 8293 x 28738)', '(2 x 14369 x 16586)', '(4 x 8293 x 14369)']
--- 0.11754131317138672 seconds ---