LogFAQs > #986920280

LurkerFAQs, Active Database ( 12.01.2023-present ), DB1, DB2, DB3, DB4, DB5, DB6, DB7, DB8, DB9, DB10, DB11, DB12, Clear
Topic List
Page List: 1
TopicA divisibility by 11 problem you've probably never seen.
Giacomo_Hawkins
11/02/25 9:59:25 PM
#24:


PurestProdigy posted...
How the fuck do you figure this out without a calculator

The difference between s(1) and s(2) is 11, so the remainder from s(2) is the same as the remainder from s(1) (1 / 11). Between s(2) and s(3) is 111. That is one above a number divisible by 11 (110), so the remainder increments by 1 and is now (2 / 11).
1111 is divisible by 11 (1100 is divisible by 11, add 11 to that) so the remainder is the same as before.
11111 is 1 more than a number divisible by 11 (11110), so the remainder is now (3 / 11)

Work into the pattern the zeroes from s(10) and s(20) and you'll be able to work your way up to where the remainder is zero, giving you a whole number.

---
Will the little voice in the back of my mind screaming "This is a bad idea" please yield the floor. --Mikey
Chivalry be hanged, and so will you.
... Copied to Clipboard!
Topic List
Page List: 1