Skip to content
Worked Examples · Example 2.14

Q.Convert (0.675)10 to binary.

Yanam CbseNCERTSubjective· 2mImportance★★★★★est
42% · 19/45 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Repeated multiplication by 2 gives the bits after the point (top-down) — but 0.675 never reduces to 0: its binary expansion is NON-TERMINATING, 0.101 followed by the block 0110 repeating.

Why this works. Each multiplication by 2 moves the binary point one place right; the digit entering the integer position is the next bit of the fraction. We stop either when the fraction hits 0 (terminating) or when a fraction value REPEATS (recurring expansion).

Working for (0.675)10:

StepMultiplicationInteger part (bit)Fractional part carried on
10.675 x 2 = 1.3510.35
20.35 x 2 = 0.7000.70
30.70 x 2 = 1.4010.40
40.40 x 2 = 0.8000.80
50.80 x 2 = 1.6010.60
60.60 x 2 = 1.2010.20
70.20 x 2 = 0.4000.40

At step 7 the carried fraction 0.40 is one we already had after step 3 — so steps 4-7 (bits 0, 1, 1, 0) repeat forever:

(0.675)10 = (0.101 0110 0110 0110 ...)2
          =  0.101 with the block 0110 recurring
          ~  (0.1010110)2 to 7 bits  (= 0.671875, error < 0.004)

Confirm the first bits in Python:

x, bits = 0.675, "" …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.