Answer: -2
Step-by-step explanation:
Slope=rise/run
In this case we rise up 4
And we run 2 to the left which makes it a negative
So in this case the slope is -4/2
Which can be simplified to -2
3 7/8 because looking at the ruler, the line is 7 of the 8. hope that’s helps!
Good morning ☕️
Step-by-step explanation:
11+y is an expression that contains a variable ‘y’
then its value depends on ’y’
examples :
if y = 0 → 11+y = 11+0 = 11
if y = 1 → 11+y = 11+1 = 12
if y = 2 → 11+y = 11+2 = 13
and so on.
:)
8 - 2x + 6 = 24
(8 + 6) - 2x = 24
14 - 2x = 24 <em>subtract 14 from both sides</em>
-2x = 10 <em>divide both sides by (-2)</em>
<h3>
x = -5</h3>
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;
}
