A dreidel is a top with 4 faces, with a distinct Hebrew alphabet written on each face.
We are given 13 different colors, and want to color each face and each alphabet on the dreidel such that
In how many ways can we color the dreidel?
Notation: P k r denotes k -permutation of r . Mathematically, P k r = ( r − k ) ! r ! .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
How many Hebrew alphabets are there?
Log in to reply
Hehe. 4 Hebrew alphabets. I edit the problem, so viewers can understand it.
Too early for Hanukkah, but I posted the problem for fun. Wish I can speak, read or write Hebrew. :)
The problem statement has been edited. I hope it doesn't change the original meaning?
Log in to reply
It changes the original meaning a bit. I mean to say that there are 12 choices of colors and possible choice of leaving the feature unpainted. However, I don't think that is the big issue.
Log in to reply
That's the issue we had, where it wasn't obvious that one could leave the side unpainted as an option. Hence it was much better to say that there are 13 colors to choose from, where unpainted is treated as a color.
The problem shouldn't be tricky because "haha you didn't know the side could be unpainted" or "haha you didn't know what a dreidel is". Such problems result in a low attempt and correct rate.
Log in to reply
@Calvin Lin – Thanks for the response! I understand your point.
@Calvin Lin – Thanks for the edits. Wasn't happy to attempt it before! (-:
Problem Loading...
Note Loading...
Set Loading...
Note that there are 1 2 + 1 = 1 3 different possibilities. 1 comes from leaving the portion unpainted, whereas 1 2 comes from choosing a color. Because there is an option to leave any indicated feature unpainted, the number of possibilities is not 1 2 . This is valid if every indicated feature is painted.
If there are 1 3 colors to choose from, the problem is very easy to look at, which involves the same reasoning for setting up the number.
Since all 4 distinct alphabets have different colors, we have ( 1 3 − 4 ) ! 1 3 ! = P 4 1 3 possibilities. Then, since each of the 4 faces of the dreidel cannot display the same color as its alphabet, this implies there are ( 1 3 − 1 ) 4 = 1 2 4 ways to color the faces. Therefore, the answer is P 4 1 3 ⋅ 1 2 4 .