Home/ Questions/Q 7647213
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-31T10:24:31+00:00

I would like an alogrithm that would use only shift, add or subtract operations

  • 0

I would like an alogrithm that would use only shift, add or subtract operations to find whether a number is a multiple of 6. So, basically just binary operations.

So far I think I should logical right shift the number twice to divide by 4 and then subtract 6 once from it. But I know something is wrong with my approach and cannot figure out what.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    how about keep subtracting the number by 6 until it reaches zero.
    If you get zero the number is divisible by 6 otherwise not.
    OR
    keep dividing the number by 2 (shift operation on binary) until the number is less than 12.
    then subtract 6 from it . If less than zero (not divisible )
    if zero divisible.
    if not subtract 3
    If less than zero (not divisible )
    if zero divisible.

    • 0