Answer:
see below
Step-by-step explanation:
1.25 rounded to the nearest tenth : 1.3
2.784 rounded to the nearest hundredth : 2.78
Answer: There are 
ways of doing this
Hi!
To solve this problem we can think in term of binary numbers. Let's start with an example:
n=5, A = {1, 2 ,3}, B = {4,5}
We can think of A as 11100, number 1 meaning "this element is in A" and number 0 meaning "this element is not in A"
And we can think of B as 00011.
Thinking like this, the empty set is 00000, and [n] =11111 (this is the case A=empty set, B=[n])
This representation is a 5 digit binary number. There are 
of these numbers. Each one of this is a possible selection of A and B. But there are repetitions: 11100 is the same selection as 00011. So we have to divide by two. The total number of ways of selecting A and B is the 
.
This can be easily generalized to n bits.
Answer:
semiannually = $1609.77
monthly = $1128.71
Step-by-step explanation:
If you're trying to find the missing side of the "triangle" (the distance from the house to where the ladder touches the ground), you would use the pythagorean theorem, a²+b²=c². (c is always hypotenuse)
a²+b²=c²
12²+b²=15²
144+b²=225
b²=81
√b²=√81
b=9
Answer:
C
Step-by-step explanation:
Divide 62 by 4
