12 5/10 вecaυѕe ιғ yoυ тυrn тнe ғracтιon вacĸ тo a decιмal ιт woυld вe 5.0 dιvιded вy 10 woυld eqυal 12. 5
Answer:
Recursive
a(1) = 9 ; a(n+1) = 3 * a(n)
Explicit
a(n) = 9 * 3^(n-1)
Answer:
ur answer
and thank u for following me
Answer:
hmmm
Step-by-step explanation:
Answer: Hello!
Let's start with the word TRISKAIDEKAPHOBIA wich has 17 letters (some of them repeat, but it does not matter in this problem)
We want to know how many permutations we can do with 17 letters: then think this way, Lets compose a word. The first letter of this word has 17 options, the second letter of the word has 16 options (you already took one of the set) the third letter of the word has 15 options, and so on.
The total number of permutations is the product of the number of options that you have for each letter, this is:
17*16*15*14*....*3*2*1 = 17! = 3.6e+14
(b) FLOCCINAUCINIHILIPILIFICATION now we have 30 letters in total, using the same reasoning as before, here we have 30! permutations; this is
30! = 2.65e+32
(c) PNEUMONOULTRAMICROSCOPICSILICOVOLCANOCONIOSIS: now there are 47 letters.
then P = 47! = 2.59e+59
(d) DERMATOGLYPHICS: here are 18 letters, then:
p = 18! = 6.4e+15
