+0  
 
0
139
3
avatar

 

 

Lance has a regular heptagon (7-sided figure). How many distinct ways can he label the vertices of the heptagon with the letters in OCTAGON if the N cannot be next to an O? Rotations of the same labeling are considered equivalent.


I saw this question earlier, and I was reading the solution, and I didn't understand the middle part of the solution. The part before summing up all the numbers... Can someone help?

 

https://web2.0calc.com/questions/tricky-question_8

 

Edit: I'm wondering why there are so many N's, do the N's stand for an integer? Or the actual N in the word 'OCTAGON'?

 Jan 9, 2020
edited by Guest  Jan 9, 2020
 #3
avatar+108675 
+1

Pay no attention to guests nonsense answer. I will hide it as it adds to confussion.

 

I have answered this on the original thread. 

https://web2.0calc.com/questions/tricky-question_8#r3

 

Think about it hard but then if you have more questions you can ask.   cool

If I do not give a timely response it might be becasue i have not seen your question.

If you were a member you could send me a private message with a link.

But since you are not you might have to be more creative.

 Jan 10, 2020

16 Online Users

avatar