Let's say I have a list of random numbers, all very big;
I want to be able to divide each and every number with another number, let's call it a divider, which will be unique for each number, however, I would like to find the biggest "divider" which will divide a number without leaving fractions.
How can I go about doing this in an efficient manner without trying every possible combination of random numbers???
to make it less complicated I'm making the "divider" at least $\frac 13$ as long as the number that's being divided by it.
Is this possible at all?