Write a program to accomplish following task.

Your friend Jack enters bits of a binary number (unit bit then two's bit then four's bit then ...). He will terminate by entering a non binary digit (i. e. anything other than 0 and 1). Each time he enters digit, tell him whether number formed so far is divisible by 3 (i.e. \(11_2\)) or not.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestTake the difference between sums of alternate digits. If it is 0 or is divisible by 3, then the number is divisible by 3. I'll let you think, why so?

Log in to reply

Analogus to "divisibility test for \(11_{10}\)", isn't it? Can you solve this one and post your solution.

Log in to reply

The question to which you have linked. Is $B$ fixed? Then, $S$ contains $\le n$ nunbers or did you mean all such $2^n$ numbers?

Log in to reply

Log in to reply