Answer:
Use a formulae calculator on Google
Answer:
c=-2
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;
}
Sec(theta) = 1 / cos (theta) = hypotenuse / x -coordinate
hypotenuse = 1 (because it is the radius of the unit circle)
sec (theta) = 1 / (-3/5) = - 5/3
cot (theta) = 1 / tan(theta) = x-coordinate / y - coordinate
cot (theta) = -3/5 / y
y^2 + (-3/5)^2 = 1 => y^2 = 1 - 9/25 = 16/25 = y = +/- 4/5
Third quadrant => y = -4/5
=> cot (theta) = (-3/5) / (-4/5) = 3/4
Answer:
True: the leading coefficient in the monomial is -7
Step-by-step explanation:
Math
