Answer:
You will need 3 cups peanut butter to make 36 dogs treats.
Peanut butter Cup : The dog treats made = 1: 12
Step-by-step explanation:
12 dog treats = 1 cup
So, by UNITARY METHOD
1 dog treat = (1/12) cup
So, 36 dog treats = 36 x (1/12) cup = 3 cups
So, you will need 3 cups peanut butter to make 36 dogs treats.
If 1 cup = 12 Dog Treats
then 1 x 3 cup = 12 x 3 dog treats
or, 3 Cups = 36 dog treats
The ratio of the Peanut butter cup : The dog treats made = 1: 12
Answer/Step-by-step explanation:
9-3= 6 units (since x coordinates are same). We can also show by manually counting the squares (1 square= 1 unit)
Yes, its greater. Distance from house to school is 6. Distance from school to grocery is 3-(-8)= 11. Thus, distance is 11+6= 17 units.
Distance from house to school is 6. Distance from school to community center is 1-(-4)=5. Thus, distance= 6+5=11 units.
Answer:
Algorithm
Start
Int n // To represent the number of array
Input n
Int countsearch = 0
float search
Float [] numbers // To represent an array of non decreasing number
// Input array elements but first Initialise a counter element
Int count = 0, digit
Do
// Check if element to be inserted is the first element
If(count == 0) Then
Input numbers[count]
Else
lbl: Input digit
If(digit > numbers[count-1]) then
numbers[count] = digit
Else
Output "Number must be greater than the previous number"
Goto lbl
Endif
Endif
count = count + 1
While(count<n)
count = 0
// Input element to count
input search
// Begin searching and counting
Do
if(numbers [count] == search)
countsearch = countsearch+1;
End if
While (count < n)
Output count
Program to illustrate the above
// Written in C++
// Comments are used for explanatory purpose
#include<iostream>
using namespace std;
int main()
{
// Variable declaration
float [] numbers;
int n, count;
float num, searchdigit;
cout<<"Number of array elements: ";
cin>> n;
// Enter array element
for(int I = 0; I<n;I++)
{
if(I == 0)
{
cin>>numbers [0]
}
else
{
lbl: cin>>num;
if(num >= numbers [I])
{
numbers [I] = num;
}
else
{
goto lbl;
}
}
// Search for a particular number
int search;
cin>>searchdigit;
for(int I = 0; I<n; I++)
{
if(numbers[I] == searchdigit
search++
}
}
// Print result
cout<<search;
return 0;
}
Here i how I would do it:<span>f(x)=−<span>x2</span>+8x+15</span>
set f(x) = 0 to find the points at which the graph crosses the x-axis. So<span>−<span>x2</span>+8x+15=0</span>
multiply through by -1<span><span>x2</span>−8x−15=0</span>
<span>(x−4<span>)2</span>−31=0</span>
<span>x=4±<span>31<span>−−</span>√</span></span>
So these are the points at which the graph crosses the x-axis. To find the point where it crosses the y-axis, set x=0 in your original equation to get 15. Now because of the negative on the x^2, your graph will be an upside down parabola, going through<span>(0,15),(4−<span>31<span>−−</span>√</span>,0)and(4+<span>31<span>−−</span>√</span>,0)</span>
To find the coordinates of the maximum (it is maximum) of the graph, you take a look at the completed square method above. Since we multiplied through by -1, we need to multiply through by it again to get:<span>f(x)=31−(x−4<span>)2</span></span><span>
Now this is maximal when x=4, because x=4 causes -(x-4)^2 to vanish. So the coordinates of the maximum are (4,y). To find the y, simply substitute x=4 into the equation f(x) to give y = 31. So it agrees with the mighty Satellite: (4,31) is the vertex.</span>
Formulas:
A= (b1+b2) /2 X h
A= (22.2+8.52) x 9.86
A=30.72x9.86
A= 302.90
