Answer:
they have different answers
Step-by-step explanation:
X - 13 = 4 and 13 - X = 4
for x- 13 = 4
x=4+13=17
x=17
for 13 - x = 4
13-4-x=0
9-x=0
9=x
x=9
Answer: She needed 
to make a cup of jam .
Step-by-step explanation:
Since we have given that
Sarah used 
pound of blueberries to make 
cup of jam.
As we need to find the number of pounds of blueberries she would need to make a cup of jam.
So, we will use "Unitary Method":
Hence, She needed to make a cup of jam .
Answer:
m = 18
k = 4
g = 50
s = 18
y = 9
f = 19
Step-by-step explanation:
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;
}
Answer:
just remove the parentheses and add the numbers
Step-by-step explanation:
