The equation of a parabola whose vertex is (0, 0) and focus is (1 / 8, 0) is equal to x = 2 · y².
<h3>How to derive the equation of the parabola from the locations of the vertex and focus</h3>
Herein we have the case of a parabola whose axis of symmetry is parallel to the x-axis. The <em>standard</em> form of the equation of this parabola is shown below:
(x - h) = [1 / (4 · p)] · (y - k)² (1)
Where:
- (h, k) - Coordinates of the vertex.
- p - Distance from the vertex to the focus.
The distance from the vertex to the focus is 1 / 8. If we know that the location of the vertex is (0, 0), then the <em>standard</em> form of the equation of the parabola is:
x = 2 · y² (1)
The equation of a parabola whose vertex is (0, 0) and focus is (1 / 8, 0) is equal to x = 2 · y².
To learn more on parabolae: brainly.com/question/4074088
#SPJ1
Answer:
Number of cookies sold by the Yummy Company = 32.
Step-by-step explanation:
Let the number of cookies sold by the yummy company be x.
Then the number of pies sold by The Chipper Bakery is 3/4 x.
When they have 16, more we have:
Number sold by the Yummy company is x + 16 and the number sold by the Bakery is 5/6 (x + 16)
So x + 3/4x + 2(16) = x + 16 + 5/6(x + 16)
= 7/4 x + 32 = 11/6 x + 16 + 80/6
7/4 x - 11/6x = 16 + 80/6 - 32
-1/12 x = -2 2/3
x = -8/3 * -12
x = 32.
Answer:
34 hours
Step-by-step explanation:
Lets call M the number of hours that Maddie volunteered. Ryan volunteered 1 + 3×M hours, and altogether they volunteered 45 hours, so:
1 + 3×M + M = 45
1 + 4M = 45 Subtract 1 in both sides
4M = 44 Divide both sides by 4
M = 11 hours
So Maddie volunteered 11 hours, and Ryan volunteered
1 + 3×11 = 34 hours
Answer: 23
Step-by-step explanation:
Answer:
The output for NAND gate is false if all the inputs are true. it is true if either A or B is False.
Step-by-step explanation:
Step1
NAND operator:
NAND is a logic or Boolean expression and is a combination of NOT and AND Gate.
NAND gate is built using various junction diodes and transistors.
Step2
The output of NAND can be 0 or 1. Here, LOW (0) and HIGH (1). 0 or 1 is commonly named as FALSE or TRUE respectively.
It is basically the complement of AND gate. If all its inputs are True or 1, then the output is False or 0 else if either A or B is 0 or 1 then it will give the output as TRUE.
Step3
Here, A and B are 2 inputs used to make the truth table for NAND.
In 1st row, when A and B are both 0, the output for NAND is 1.
Likewise, in 2st row and 3rd row, when either A or B is 0 or 1, the output for NAND is 1 that is TRUE.
But in last row, when both inputs A and B are true, then the output for NAND gate is FALSE or 0.
The diagram and truth table for NAND is shown below.
