Irregular Webcomic!  Archive     Cast     Forum     RSS    
Podcast     Poll Results     FAQ     Search     News    
Facebook     Fan Art     More Stuff     Random     Support on
Patreon <   No. 1735   2007-10-27   >  Comic #1735  1 Monty:
You're living dangerously, invading the Vatican, Haken. 2 Haken:
Die Catholic Church will cower before die might of Nazi science!
3 Monty: I wouldn't bet on it. Just the other day they announced
a brand new algorithm to determine the greatest common divisor
of two numbers. 4 Haken: Bah! In this algorithm, how many
divisions does the Pope have?  First (1) | Previous (1734) |
Next (1736) || Latest Rerun (1088) | Latest New (3380) First 5 |
Previous 5 | Next 5 | Latest 5 This strip's permanent URL:
Annotations off: turn on Annotations on: turn off  The greatest
common divisor (GCD) of two integers is the largest integer that
divides into both of them with no remainder. For example, the
CGD of 28 and 36 is 4, because 4 divides evenly into 28 (7
times), and 36 (9 times), but no