For this case we must factor the following expression:
To factor, we must find two numbers that when added together give -7 and when multiplied by -10.
It is observed that there are not two whole numbers that comply with the aforementioned.
Thus, the following equation applies:
Where:
We replace:
So, the roots are:
Answer:
Answer:
See explanation.
Step-by-step explanation:
Graph the quadrilateral. By inspection, you can tell where the midpoint is. (see attachment 1)
Now, I'll draw a line through it. (see attachment 2)
To reflect across a line, think about the points traveling across the line the same number of spaces the point is from the line. For example, point A is three away from the line. So, A' will be 3 away from the other side. The coordinates will be at (-3,2). (see attachment 3).
Do the same for the other points, and you'll have your image.
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;
}
Please check the attached images for the answer. Answer with full explanation is screenshoted. Plz refer.
Thanks ☺️
Hope it helps you.
Answer:
neither of them are
Step-by-step explanation:
