My problem is, given 4 positive integers (single digits 0-9), is there a generic way to identify which combination of them will yield the largest product of a single multiplication?
So to clarify if my digits were:
I think the largest number I could make given a single multiplication would be
631 = 5048
or in generic terms, the largest single digit multiplied by a combination of the rest of the digits in a sequence of decreasing magnitude.
- is that correct?
- is there a way to formally state that? Sort of a proof.