For this, we need to find the area of the larger rectangle (The room) and subtract from that the area of the smaller, shaded rectangle (The rug).
A=LW (L=Length, W=Width, A=Area)
The larger rectangle first:
A=(15)(10)
A=150 feet squared
Now the Rug:
A=(12)(7)
A=84 feet squared
Now to find the area that is NOT covered by the rug, we subtract:
150-84
= 66 feet squared will NOT be covered by the rug.
Hope this Helps!
-Sinnamin
Given:


To find:
The value of
.
Solution:
We have,


Using properties of log, we get
![\left[\because \log_a\dfrac{m}{n}=\log_am-\log_an\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbecause%20%5Clog_a%5Cdfrac%7Bm%7D%7Bn%7D%3D%5Clog_am-%5Clog_an%5Cright%5D)
![[\log x^n=n\log x]](https://tex.z-dn.net/?f=%5B%5Clog%20x%5En%3Dn%5Clog%20x%5D)
Substitute
and
.



Therefore, the value of
is
.
Now, the cosecant of θ is -6, or namely -6/1.
however, the cosecant is really the hypotenuse/opposite, but the hypotenuse is never negative, since is just a distance unit from the center of the circle, so in the fraction -6/1, the negative must be the 1, or 6/-1 then.
we know the cosine is positive, and we know the opposite side is -1, or negative, the only happens in the IV quadrant, so θ is in the IV quadrant, now

recall that

therefore, let's just plug that on the remaining ones,

now, let's rationalize the denominator on tangent and secant,
This is the easiest way to solve this problem:
Imagine this represents how many combinations you can have for each of the 4 wheels (each blank spot for one wheel): __ __ __ __
For the first situation it says how many combos can we make if no digits are repeated.
We have 10 digits to use for the first wheel so put a 10 in the first slot
10 __ __ __
Since no digit can be repeated we only have 9 options for the second slot
10 9_ __ __
Same for the third slot, so only 8 options
<u>10</u> <u> 9 </u> <u> 8 </u> __
4th can't be repeated so only 7 options left
<u>10</u> <u> 9 </u> <u> 8 </u> <u> 7
</u><u>
</u>Multiply the four numbers together: 10*9*8*7 = 5040 combinations
For the next two do the same process as the one above.
If digits can be repeated? You have ten options for every wheel so it would look like this: <u>10</u> <u>10</u> <u>10</u> <u>10
</u>
10*10*10*10 = 10,000 combinations
If successive digits bust be different?
We have 10 for the first wheel, but second wheel only has 9 options because 2nd number can't be same as first. The third and fourth wheels also has 9 options for the same reason.
<u>10</u> <u> 9</u><u> </u> <u> 9 </u> <u> 9 </u>
10*9*9*9 = 7290 combinations