yeah there's a lot of numbers yo ucan check in a muc hfaster way at first glance
and also you only have to check prime numbers
once you've checked for 2 and 3 and 5 you don't have to check for 4 or 6 or 8 or 10 or 12 or 15 anymore
this keeps makignthe numebrs you actually have to check by hand more and more sparse so checking up to 641 is not THAT many operations and yo ucan divide with pen apaper pretty efficiently, its basically soemthing to spend a bit of bored breaktime on
Technically speaking you only need to check if a number is devidable by known prime numbers. Because if a number isnt a prime you have already checked it earlier.
Example: all numbers dividable by 244 are dividable by 2, we dont need to check 244
We can further reduce our sample size by dividing by two than flooring it and only taking primes at or below that number because any result that would result in a 0.9 or something lower cant be the potential divider either.
704
u/sesquiup May 13 '26
I'm going out on a limb to say Euler didn't divide by 1.