Don't touch the center. It is already even.
Start anywhere by connecting a dotted line from one vertex to the next. To keep things so we know what we are talking about, go clockwise. Now you have 2 points that are Eulerized that were not before.
Skip and edge and do the same thing to the next two vertices. Those two become eulerized. Skip an edge and do the last 2.
Let's try to describe this better. Start at any vertex and number them 1 to 6 clockwise.
Join 1 to 2
Join 3 to 4
Join 5 to 6
I think 3 is the minimum.
3 <<<< answer
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
Answer:
-2, -4, -6, -8, -10......
Step-by-step explanation:
The sequence is in a decreasing order of -2 for the next sequence.
