What is the smallest possible number of whole 2-by-3 non-overlapping rectangles needed to cover a square region exactly, without extra over-hangs and without gaps?

find the magnitude of the trig term  

csc

(

x

)

−

1

by taking the absolute value of the coefficient.

1

find the lower bound of the range.

tap for more

y

=

−

2

find the upper bound of the range.

tap for more

y

=

0

the range is  

y

≤

−

2

or  

y

≥

0

.

(

−

∞

,

−

2

]

∪

[

0

,

∞

)

{

y

|

y

≤

−

2

,

y

≥

0

}

step-by-step explanation:

ruth is 6 years old

step-by-step explanation:

6 + 24 = 30,   so 6/30 = .2  

if you do 1/5 it also equals .2, so that is the answer.

answer: options

step-by-step explanation: