218.3 is the answer for this one
Answer:
a = 2
b = 3
c = 8
Step-by-step explanation:
First, let us look at the first two (far left) fractions to solve for a.
Since 
, nothing needs to change in the numerator. 4 = 
a = 2.
Next, we will look at the first and third fractions to solve for b.
= 32
32 / 4 = 8
= 8
b = 3
Lastly, we will solve for c.
All of these fractions simplify to 8 and are equal to each other.
c = 8
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:
Wonka bars=3 and Everlasting Gobstoppers=24
Step-by-step explanation:
let the wonka bars be X
and everlasting gobstoppers be Y
the objective is to
maximize 1.3x+3.2y=P
subject to constraints
natural sugar
4x+2y=60------1
sucrose
x+3y=75---------2
x>0, y>0
solving 1 and 2 simultaneously we have
4x+2y=60----1
x+3y=75------2
multiply equation 2 by 4 and equation 1 by 1 to eliminate x we have
4x+2y=60
4x+12y=300
-0-10y=-240
10y=240
y=240/10
y=24
put y=24 in equation 2 we have'
x+3y=75
x+3(24)=75
x+72=75
x=75-72
x=3
put x=3 and y=24 in the objective function we have
maximize 1.3x+3.2y=P
1.3(3)+3.2(24)=P
3.9+76.8=P
80.7=P
P=$80.9
Answer:
From least to greatest
23* 1/4, 23* 2/2, 23* 13/5
Explanation
In order to do this without multiplication, place the fractions in ascending order.
The denominators of these fractions have 20 as a common multiple.
2/2 • 10 = 20/20
1/4 • 5 = 5/20
13/5 • 4 = 52/20
From this it logically follows that the fractions in ascending order are:
1/4, 2/2, 13/5
Therefore the products in ascending order are:
23* 1/4, 23* 2/2, 23* 13/5
