Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
gayatri1
Group Title
stumbled upon the following problem:
a circular disk is cut into n distinct sectors each shaped like a piece of pie and all meeting at the center point of the disk.Each sector is to be painted red,green,yellow,or blue in such a way that no two adjacent sectors are painted the same color. Let Sn be the number of ways to paint the disk. Find a recurrence relation for Sk in terms of Sk1 and Sk2 for each integer k>=4.
Anybody can explain step by step how to solve this? any help appreciated stumbled upon the following problem:
a circular disk is cut into n distinct sectors each shaped like a pie
 one year ago
 one year ago
gayatri1 Group Title
stumbled upon the following problem: a circular disk is cut into n distinct sectors each shaped like a piece of pie and all meeting at the center point of the disk.Each sector is to be painted red,green,yellow,or blue in such a way that no two adjacent sectors are painted the same color. Let Sn be the number of ways to paint the disk. Find a recurrence relation for Sk in terms of Sk1 and Sk2 for each integer k>=4. Anybody can explain step by step how to solve this? any help appreciated stumbled upon the following problem: a circular disk is cut into n distinct sectors each shaped like a pie
 one year ago
 one year ago

This Question is Open

bwCA Group TitleBest ResponseYou've already chosen the best response.0
maybe a tree or graph problem  they lend them selves well to recursive solutions. each section has two neighbors. pick one section to be the root then its neighbors are the next 'level' then each neighbor has two neighbors ..... if you draw the diagrams, it might help to puzzle out the recurrence relationship.
 one year ago

bwCA Group TitleBest ResponseYou've already chosen the best response.0
graph i think rather than a tree
 one year ago

msmithhnova Group TitleBest ResponseYou've already chosen the best response.0
Also sounds a lot like CSP (Constraint Satisfaction Problem), one common example is the "map coloring problem" which is also associated with the "four color theorem". Here are a few links on this that you may or may not be interested in. http://www.cs.washington.edu/education/courses/cse473/10au/slides/chapter056pp.pdf http://www.dfki.unikl.de/~aabecker/Mosbach/suchfoliensocher.pdf http://en.wikipedia.org/wiki/Four_color_theorem
 one year ago

bwCA Group TitleBest ResponseYou've already chosen the best response.0
solving the problem computationally seems to be well documented with plenty of possible algorithms / models to start off with. but actually writing the recurrence relation as specified in the OP? was there more information? seems like the question is not asking for a recurrence relation for solving the problem but for defining different possible solutions  that almost sounds like the same thing but ..... if you can write the recurrence relation for all possible solutions then would you be able to use it to code a single solution?
 one year ago
See more questions >>>
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.