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:
We conclude that segment QR is the shortest.
Hence, option B is true.
Step-by-step explanation:
First, we need to determine the missing angle m∠R
Given the triangle Δ∠PQR
m∠P = 48°
m∠Q = 83°
m∠R = ?
We know the sum of angles of a triangle is 180°.
m∠P+m∠Q+m∠R = 180°
48°+83°+m∠R=180°
m∠R = 180° - 48° - 83°
m∠R = 49°
Thus, the value of m∠R = 49°
We know that the longest side in a triangle is opposite the largest angle, and the shortest side is opposite the smallest angle.
Here,
m∠P = 48° is the shortest angle.
As the side QR segment is opposite the smallest angle i.e. m∠P = 48°
Therefore, we conclude that segment QR is the shortest.
Hence, option B is true.
<h3>
Answer: True</h3>
Explanation:
Technically you could isolate any variable you wanted, from either equation. However, convention is to pick the variable in which isolating it is easiest, and most efficient.
The key thing to look for is if there's a coefficient of 1. This is found in the second equation for the y term. Think of -4x+y = -13 as -4x+1y = -13. Due to the coefficient of 1, when solving for y we won't involve messy fractions.
If you were to solve for y, then you'd get y = 4x-13, which is then plugged in (aka substituted) into the first equation. That allows you to solve for x. Once you know x, you can determine y.
Answer: C
Step-by-step explanation:
We know that 
, and thus by the exterior angle theorem,
Thus, 
Answer:
Step-by-step explanation:
how many weeks are they doing this for?
