Lets quickly run through the prime numbers and see what it is not divisible by
39 is not divisible by 2
39 IS divisible by 3
So lets stop right here.
What is 39 divided by 3? 13 !
And 13 is a prime number too!
So that is all we can do.
So prime factorization of 39 is <u>3 x 13</u><u><em /></u>
Problem A
Usually the number of bits in a byte is 8 or 16 or 32 and recently 64. You don't have to write a formula to restrict it to this number of bits. You are not asked to do so. The general formula is 2^n - 1 for the problem of Millie and her golden keys. Somehow the system can be made to choose the right number of bits. Apple IIe s for example, used 8 bits and there was a location that told the processor that fact.
2^n - 1 <<<<< Answer
Problem B
In this case n = 4
2^n - 1 = 2^4 - 1 = 16 - 1 = 15
Millie can collect 15 keys <<<<<< Answer
Answer:
241 tons
Step-by-step explanation:
312-170=142
142÷2=71
170+71=241
241+71=312
train B weighs 241 tons
Answer:
see explanation
Step-by-step explanation:
∠1 = 58° ( alternate angles )
∠1 and ∠2 form a straight angle and are supplementary, thus
∠2 = 180° - 58° = 122°
The answer a
Because that’s what I said
