Let U={1,2,3,4,5,6,7,8}A={2,3,6}B={2,4,5,7}C={1,7,8}Find the following use the roster method to write method to write the set. E
Ipatiy [6.2K]
A U B = set of all elements that are in both A or B:
A U B = {2, 3, 4, 5, 6, 7}
Here is a picture to see our answer.
Answer:
A.) the SSS Postulate
Step-by-step explanation:
Two sides of each triangle are marked congruent, and the third side is shared by the triangles. Hence, all three sides are congruent, and the SSS Postulate applies.
Unit rate means how much does it cost for 1 unit
140 for 18ft^2
divide by 18
140/18=7.77777777777777
so the unit rate is $7.78 per square foot
Answer:
t = 7 + 3i
Step-by-step explanation:
(t-7)^2 + 18 = 9
(t-7)^2 = 9 - 18
(t-7)^2 = -9
(t-7) = sqrt(-9) = |3| sqrt(-1)
t = 7 + 3i
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;
}
