To do Egyptian Multiplication, I have to make a table (like the one above). On the left side, I start with 1, and double each number until the number is just below 571 and it can no longer be doubled because if it is, it will be larger than 571 (in this case, 1024 > 571). On the right side, I start with 73 and double each number until the table is completely filled out and each number on the left has a corresponding number on the right.
After that, I have to determine which numbers on the left side of the table add up to 571 (the boxed numbers).
I choose:
512 + 32 + 16 + 8 + 2 + 1 = 571
Then, to determine what 571 x 53 is equal to, I add the numbers on the right side of the table that corresponds to the ones on the left that I chose: (For example, the number corresponding to 512 is 37376, and the number that corresponds to 32 is 2336, etc.)
37376 + 2336 + 1168 + 584 + 146 + 73 = 41,683
This number of 41,683 = 571 x 73.
To turn 41,683 into a binary number, I have to:
41683 / 2 = 20841 with a remainder of 1
20841 / 2 = 10420 with a remainder of 1
10420 / 2 = 5210 with a remainder of 0
5210 / 2 = 2605 with a remainder of 0
2605 / 2 = 1302 with a remainder of 1
1302 / 2 = 651 with a remainder of 0
651 / 2 = 325 with a remainder of 1
325 / 2 = 162 with a remainder of 1
162 / 2 = 81 with a remainder of 0
81 / 2 = 40 with a remainder of 1
40 / 2 = 20 with a remainder of 0
20 / 2 = 10 with a remainder of 0
10 /2 = 5 with a remainder of 0
5 / 2 = 2 with a remainder of 1
2 / 2 = 1 with a remainder of 0
1 /2 = 0 with a remainder of 1
Then, I read the sequence of remainders upwards to the top to determine the binary number. So, the binary number of 41,683 is: 1010001011010011.
No comments:
Post a Comment