00:01
Okay, so in this question we want to show how octal expansions can be written as binary expansions.
00:08
So if we write this octal number in terms of decimal, so in base 10, we have h k times by eight or eight k plus by h k minus one, eight to the k minus one plus by so on so on plus by h1, 8 to the 1 plus by h 08 to the 0.
00:39
Okay, now each of these h's is between 0 is less than equal to h, i is less than equal to 7.
00:49
For i is equal to 0 ,1, 2, blah blah, blah to k.
00:58
Now because it's less than equal to 7, we could write this in terms of binary, in particular, we can write h i as being a to the three i plus by two times of two squared plus by a times by three i plus by one uh times by two times by two plus by a times by three i times by two to the zero so if you perform this step for all of these hks why you'll have is first n in base ten is going to be a times by 3k plus by 2, 2 squared, plus by a times by 3k, plus by 1, 2, plus by a times by 3k, and this will be times by 8k, okay, and you plus by blah, blah, blah, and then taking the last two terms, h1 would be a to the 3 times 1 gives you 3 plus 2.
02:08
2 gives you 5 times by 2 squared plus by a 4 times by 2 plus by a 3 and there's 8 here and finally plus by a 2 2 squared plus by a 1 2 plus a 0 so now these 8s can be written in 2 in terms of 2 to the power so in turn it's 2 to the 3 to the k so this is 2 to the 3k.
02:42
Same thing here.
02:43
This is just 2 thirds.
02:46
So now, if we push this number inside the brackets, what you'll see is that we have 2 to the 0, 2 to the 1, 2 to the 2.
02:54
Then this will give 2 to the 3...