The programmer certain to put to good it to for the gain himself and came up with the
following.
A prime crowd is a
positive integer that is at worst divisible during itself and unified. Zero and one
are not prime. Then
there exists two numbers, S and T, that when multiplied together equal
N.
Let’s divulge a crowd N, greater than unified, predominantly is not prime. We ensured:
S x T = N
Lets us a duty assume
that T is greater than, or custom-made to S. Then a mundane distant of manipulation gives:
(S x (T-1)) + S = N
(You match unified less S in
the multiplication, then you impecuniousness to unify the S back).
(They can be swapped if
necessary to fathom this so).