10001010111 you get this by: each digit in a binary number is a power of 2 kind of like in the number '100' you have your 1's column, your 10's and your 100's 2^10 2^9 2^8 2^7 2^6 2^5 2^4 2^3 2^2 2^1 2^0 1024 512 256 128 64 32 16 8 4 2 1 the highest power of 2 that can go into 1111 is 2^10 which is 1024 so you go from the highest column and write a 1 1 now 1111-1024 gives you 87 left over the next highest that can go into 87 is 64 or 2^6 so you write a '0' under any number that doesn't match and a 1 under the 64 and you get 1024 512 256 128 64 32 16 8 4 2 1 1--------0----0----0---1 87-64 gives you 23 so do the same thing and you get: 1024 512 256 128 64 32 16 8 4 2 1 1--------0----0----0---1--0 --1 23-16 = 7 so 1024 512 256 128 64 32 16 8 4 2 1 1--------0 ---0---- 0 -1 - 0 --1 0 1 7-4=3 1024 512 256 128 64 32 16 8 4 2 1 1---------0---0-----0--1--0---1-0 1 1 3-2=1 1024 512 256 128 64 32 16 8 4 2 1 1 -------0 ----0 ---0 --1- 0 --1- 0 1 1 1 end result: 10001010111
between 3 and 4 3 x 32 = 96 4 x 32 = 128 122/32 = 61/16 = 3.8125
A huge number. 0 + 1 + 2 = 3 0 + 2 + 1 = 3 1 + 0 + 2 = 3 1 + 2 + 0 = 3 2 + 0 + 1 = 3 2 + 1 + 0 = 3 -0 + 1 + 2 = 3 -0 + 2 + 1 = 3 1 - 0 + 2 = 31 + 2 - 0 = 32 - 0 + 1 = 32 + 1 - 0 = 3 0 - 1 + 3 = 2 0 + 3 - 1 = 2 -1 + 0 + 3 = 2 -1 + 3 + 0 = 2 3 + 0 - 1 = 2 3 - 1 + 0 = 2 -0 - 1 + 3 = 2-0 + 3 - 1 = 2-1 - 0 + 3 = 2-1 + 3 - 0 = 23 - 0 - 1 = 23 - 1 - 0 = 2 0 - 2 + 3 = 1 0 + 3 - 2 = 1 -2 + 0 + 3 = 1 -2 + 3 + 0 = 1 3 + 0 - 2 = 1 3 - 2 + 0 = 1 -0 - 2 + 3 = 1-0 + 3 - 2 = 1-2 - 0 + 3 = 1-2 + 3 - 0 = 13 - 0 - 2 = 13 - 2 - 0 = 1 1 + 2 - 3 = 0 1 - 3 + 2 = 0 2 + 1 - 3 = 0 2 - 3 + 1 = 0 -3 + 1 + 2 = 0 -3 + 2 + 1 = 0 For each of these equations there is a counterpart in which all signs have been switched. For example 0 + 1 + 2 = 3 gives -0 - 1 - 2 = -3and so on. Now, all of the above equations has three numbers on the left and one on the right. Each can be converted to others with two numbers on each side. For example:the equation 0 + 1 + 2 = 3 gives rise to0 + 1 = 3 - 20 + 1 = -2 + 30 + 2 = 3 - 10 + 2 = -1 + 31 + 2 = 3 - 01 + 2 = -0 + 3-0 + 1 = 3 - 2-0 + 1 = -2 + 3-0 + 2 = 3 - 1-0 + 2 = -1 + 31 + 2 = 3 + 01 + 2 = +0 + 3 As you can see, the number of equations is huge!
4
256
-526.
It is counting how many bits there are in a byte i think :D Example 1 2 4 8 16 32 64 128 256 1 = 1 (so here their is 1 bit) 1 2 4 8 16 32 64 128 256 2 = 0 1 (2 bits so you place a 1 under the 2 and a 0 under the 1) 1 2 4 8 16 32 64 128 256 3 = 1 1 (3 bits so you place a 1 under the 2 and a 1 under the 1. one 1 + one 2 = 3 ) 1 2 4 8 16 32 64 128 256 4 = 0 0 1 1 2 4 8 16 32 64 128 256 5 = 1 0 1 1 2 4 8 16 32 64 128 256 6 = 0 1 1 and so on :) i think that's answered your question :D
The answer is :- 11100001 give a binary equation is that each column represents either a 0 or 1, as in ten base each column is 0 1 2 3 4 5 6 7 8 9. So if 0 = 0 1= 1 10 = 2 11 =3 Then - 128 64 32 16 8 4 2 1 1 1 1 0 0 0 0 1 or 128 +64+32+1 = 225
128
The GCF of 96 and 128 is 32. The greatest common factor is the highest number that divides exactly into two or more numbers. 96: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 96 128: 1, 2, 4, 8, 16, 32, 64, 128 The GCF of 96 and 128 is 32.
10001010111 you get this by: each digit in a binary number is a power of 2 kind of like in the number '100' you have your 1's column, your 10's and your 100's 2^10 2^9 2^8 2^7 2^6 2^5 2^4 2^3 2^2 2^1 2^0 1024 512 256 128 64 32 16 8 4 2 1 the highest power of 2 that can go into 1111 is 2^10 which is 1024 so you go from the highest column and write a 1 1 now 1111-1024 gives you 87 left over the next highest that can go into 87 is 64 or 2^6 so you write a '0' under any number that doesn't match and a 1 under the 64 and you get 1024 512 256 128 64 32 16 8 4 2 1 1--------0----0----0---1 87-64 gives you 23 so do the same thing and you get: 1024 512 256 128 64 32 16 8 4 2 1 1--------0----0----0---1--0 --1 23-16 = 7 so 1024 512 256 128 64 32 16 8 4 2 1 1--------0 ---0---- 0 -1 - 0 --1 0 1 7-4=3 1024 512 256 128 64 32 16 8 4 2 1 1---------0---0-----0--1--0---1-0 1 1 3-2=1 1024 512 256 128 64 32 16 8 4 2 1 1 -------0 ----0 ---0 --1- 0 --1- 0 1 1 1 end result: 10001010111
A multiple of 32 is 32 multiplied by any integer: 0 x 32; 1 x 32; 2 x 32; -1 x 32; etc.
The same as we use in decimal, except instead of powers of 10 it's powers of 2. Working from the least-significant bit (from right to left), each bit is worth: 2^0 = 1 2^1 = 2 2^2 = 4 2^3 = 8 2^4 = 16 2^5 = 32 2^6 = 64 2^7 = 128 So if the octet is 10110101, then working from right to left we get: 1*1 = 1 0*2 = 0 1*4 = 4 0*8 = 0 1*16 = 16 1*32 = 32 0*64 = 0 1*128 = 128 If we add these values up we get 181. Thus 10110101 is the binary equivalent of 181 decimal.
Not sure what a gemetric sequence might be. 2 8 32 128 is the start of the geometric sequence defined by Un = 22n-1 for n = 1, 2, 3, ...
The factors of 96 are: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 96.The factors of 128 are: 1, 2, 4, 8, 16, 32, 64, 128.The common factors are: 1, 2, 4, 8, 16, 32.The Greatest Common Factor (GCF) is: 32
The factors of 128 are: 1, 2, 4, 8, 16, 32, 64, 128 The factors of 192 are: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 192 The common factors are: 1, 2, 4, 8, 16, 32, 64
43. Alternatively add and subtract, doubling the amount each time, starting with 1: 0 + 1 = 1 1 - 2 = -1 -1 + 4 = 3 3 - 8 = -5 -5 + 16 = 11 11 - 32 = -21 So add 64 for the next term: -21 + 64 = 43 (The next term would then be subtract 128: 43 - 128 = -85)