3 ms·

https://github.com/blackburn32/serverlessIsEven https://github.com/blackburn32/serverlessIsEven "A serverless implementation of isEven. Now you can know if your

by mtmail 2y ago

https://github.com/blackburn32/serverlessIsEven https://github.com/blackburn32/serverlessIsEven "A serverless implementation of isEven. Now you can know if your numbers are even, even at mass scale."

TZubiri 2y ago
How about sending a packet back and forth to a server in another continent n times, and if it stops coming back, it was odd.
- MathMonkeyMan 2y ago
  Better to use TCP, but I like your approach.
  - belter 2y ago
    - Attempt to factor your integer n into primes... - Once you have the complete prime factorization, check whether 2 is among its prime factors... - If 2 is a factor, it’s even; if not, odd.
    - TZubiri 2y ago
      It's just 2 lines of code, therefore it's fast. Also I only use the step over command in the debugger