What is the least possible sum of two positive integers and where
Notation ! is a factorial symbol; for example,
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 0 ! = 1 ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 3 ∗ 3 ∗ 3 ∗ 3 ∗ 5 ∗ 7 ∗ 1 0
All of these prime factors must be placed in the problem's two factors a , b .
Starting from the most unbalanced placement, a trend is visible:
1 + 2 ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 3 ∗ 3 ∗ 3 ∗ 3 ∗ 5 ∗ 7 ∗ 1 0 = 3 6 2 8 8 0 1
1 ∗ 2 + 2 ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 3 ∗ 3 ∗ 3 ∗ 3 ∗ 5 ∗ 7 ∗ 1 0 = 1 8 1 4 4 0 2
1 ∗ 2 ∗ 2 + 2 ∗ 2 ∗ 2 ∗ 2 ∗ 2 ∗ 3 ∗ 3 ∗ 3 ∗ 3 ∗ 5 ∗ 7 ∗ 1 0 = 9 0 7 2 0 4
1 ∗ 2 ∗ 2 ∗ 2 + 2 ∗ 2 ∗ 2 ∗ 2 ∗ 3 ∗ 3 ∗ 3 ∗ 3 ∗ 5 ∗ 7 ∗ 1 0 = 4 5 3 6 0 8
A perfect balance is given by the square root operation: n = n ∗ n .
But 1 0 ! = 1 9 0 4 . 9 4 1 isn't whole. The nearest whole number factor pair is 1 8 9 0 ∗ 1 9 2 0 . And they sum to 3 8 1 0 .