In general 2^n is the number of pieces of information n bits can store.
(a) Antonio can use the formula 2^n-1 to indicate the maximum size of numbers an n-bit word can store.
(b) for a 16-bit system, the maximum number of keys Millie can collect is 2^(16)-1 = 65536-1=65535
(c) For a 14 byte program, there are 14*8=112 bits.
800 * 100 = 80000
810 * 99 = 80190
900 * 90 = 81000
1000 * 80 = 80000
(800 + 10n) (100-1n)
=(800 +10(11)) (100 - 11)<span>
(910)(89) = 80990</span>
K.E=0.5mv^2
GPE=mgh
The child has both K.E and GPE
g is taken as 9.81
Answer:
Same to me he sent a link to like almost every question it didn't work for me
Step-by-step explanation:
