5,740,000( you have to make the number less than 10
5.740000 ( you put a decimal to make it less )
5.74e6 (you count how many times you skipped over to get at the decimal point , and that's your awnser .
Answer:
1716 ways
Step-by-step explanation:
Given that :
Number of entrants = 13
The number of ways of attaining first, second and third position :
The number of ways of attaining first ; only 1 person can be first ;
Using permutation :
nPr = n! ÷(n-r)!
13P1 = 13! ÷ 12! = 13
Second position :
We have 12 entrants left :
nPr = n! ÷(n-r)!
12P1 = 12! ÷ 11! = 12
Third position :
We have 11 entrants left :
nPr = n! ÷(n-r)!
11P1 = 11! ÷ 10! = 11
Hence, Number of ways = (13 * 12 * 11) = 1716 ways
Hi there! Use the following identities below to help with your problem.

What we know is our tangent value. We are going to use the tan²θ+1 = sec²θ to find the value of cosθ. Substitute tanθ = 4 in the second identity.

As we know, sec²θ = 1/cos²θ.

And thus,

Since the given domain is 180° < θ < 360°. Thus, the cosθ < 0.

Then use the Identity of sinθ = tanθcosθ to find the sinθ.

Answer
- sinθ = -4sqrt(17)/17 or A choice.
Answer:
x = 50, y = 10
Step-by-step explanation:

987,164.302
0: hundredths
1: hundreds
4: ones
3: tenths
6: tens
9: hundred thousand