Hello Bri,
If you are talking about a boundary line on a coordinate plane, the best way to determine which side to shade is to start by selecting a coordinate point (x, y) that is not on the line.
Then, substitute those values into your inequality. Simplify the inequality. If the resulting statement is true, then shade the side with your point. If the resulting statement is false, then shade the other side.
Testing a point like this shows the side of the inequality that is the solution and needs to be shaded.
Good luck!
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:
Step-by-step explanation:
A perpendicular bisector is a special kind of segment, ray, or line that. (1) intersects a given segment at a 90° angle, and. (2) passes through the given segment's midpoint. Segment CD is the perpendicular bisector to segment AB. We derive two important theorems from the characteristics of perpendicular bisectors.
Answer:
a(n)=3+(n-1)2
Step-by-step explanation:
a(n)=3+(n-1)2
arithmetic sequence
Answer: 17
Step-by-step explanation:
If there are 5 cows and they add 12 then there are 17 cows in total
12+5=17
