Answer:
2x+2x+2=4x+2
4x+2=4x+2
Step-by-step explanation:
Answer:
Any equation with the slope -3 and a y intercept that does not equal 5
Step-by-step explanation:
a line is parallel if the line have the same slope, and different y intercepts
3x+y=5
in slope intercept form is
y=-3x+5
slope : -3
y intercept 5
Answer:
x
Step-by-step explanation:
7x+18−6(x+1)−12
start out with distributive property
7x+18+(-6x)+(-6)+(-12)
then add the common things together
x+0
answer is just x, or infine answers, you could put in anything for x
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:
The first one and the last one
mark brainliest pls
