Answer:
yes
Step-by-step explanation:
it's right i think i hel8
Answer:
Using the Angle Addition Postulate, 20 + m∠DBC = 80. So, m∠DBC = 60° using the subtraction property of equality.
Step-by-step explanation:
If point D is the interior of angle ABC, then the angle addition postulate theory states that the sum of angle ABD and angle DBC is equals to angle ABC. The angle addition postulate is used to measure the resulting angle from two angles placed side by side.
From the attached image, ∠ABD and ∠DBC are placed side by side to form ∠ABC. Given that m∠ABD = 20° and m∠ABC = 80°
Hence, using angle addition postulate:
m∠ABD + m∠DBC = m∠ABC
20 + m∠DBC = 80
subtracting 20 from both sides (subtraction property of equality)
m∠DBC = 80 - 20
m∠DBC = 60°
Answer:
Im sorry im not sure how to do this either lol :/
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;
}
Answer:
25
Step-by-step explanation:
Note x^2y + xy^2 = xy(x+y)
We know xy = 5 and x+y = 5, so
5*5=25
