Jump to content


HPR - HPR1292: Doomsday Remainders

  • Please log in to reply
No replies to this topic



    I make newbies cry!

  • Members
  • 2,980 posts

Posted 15 July 2013 - 07:00 PM

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

BinRev is hosted by the great people at Lunarpages!