Sign in to follow this  
Followers 0

HPR - HPR1292: Doomsday Remainders

1 post in this topic

Last Episode on Conway's Doomsday Rule ends with teaser on MOD(), a"remainder" function defined for integer values (whole numbers): MOD(K, m) = remainder when K is divided by "modulus" m. Examples: a. MOD(207, 7) = MOD(207 - 140, 7) = MOD(67, 7) = 4 b. MOD(1234567, 2) = 1 because the number is odd MOD() function found in most spreadsheet programs, but it also shows upas an operator in some programming languages: (a % B), or (a mod B).Other functions referenced: DIV(K, m) = quotient in integer division where K = m * quotient + remainder (not returned) 0

Go to this episode


Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  
Followers 0