2x2-5x-3=0
Two solutions were found :
x = -1/2 = -0.500
x = 3
Step by step solution :
Step 1 :
Equation at the end of step 1 :
(2x2 - 5x) - 3 = 0
Step 2 :
Trying to factor by splitting the middle term
2.1 Factoring 2x2-5x-3
The first term is, 2x2 its coefficient is 2 .
The middle term is, -5x its coefficient is -5 .
The last term, "the constant", is -3
Step-1 : Multiply the coefficient of the first term by the constant 2 • -3 = -6
Step-2 : Find two factors of -6 whose sum equals the coefficient of the middle term, which is -5 .
Answer:
Simplify the expression.
i could not type in exponent so just open the screen shot
Step-by-step explanation:
i Hope it works
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;
}
