How many different codes of 6 digits are possible if the first digit must be 3, 4, 5, or 6 and if the code may not end in 0? Hint: think of positions.

360000 possible codes

Step-by-step explanation:

The first digit can only be one of four things and the last digit can't be zero.

4*10*10*10*10*9=360000

yes

step-by-step explanation:

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: