Solution: It can be seen that at the back of the stone,

Switch is a tool to connect or disconnect the power supply. When mounted on a light switch, then the switch can turn on or turn off the lights. At home Sugeng, there are 30 lights are numbered from 1 to 30. To turn it on, Sugeng has a special switch, which switch is connected to more than one light. There are five switches, namely: fescinal Switch A, which is connected to the light switch numbered fescinal multiples of 2. Switch B, which is connected fescinal to the light switch numbered multiples of 3. Switch C, which is connected to the light switch numbered multiples of 5. Switch D, ie switch connected with lights numbered multiples of 7. switch E, which is connected to the light switch numbered multiples of 11. Keep in mind, if the lights are switched off, and the switch is connected to it is pressed, the lamp will be lit. Vice versa.
Solution: Lights are numbered 1 would not be able to light up as not connected with the switch at all. Another lamp will not light the lamp is prime greater than 11, ie 13,17,19,23,29. So the total light that can not be lit is 6, namely: fescinal 1,13,17,19,23, and 29.
3. How many ways to install a domino 1 2 in order to cover the entire board measuring 3 4? Domino can not be cut, or stacked with other dominoes. Besides all parts of dominoes must be inside the board. Each domino can be played / rotated.
Solution: fescinal Since only a small number, then this problem can be porters (Abandonment Solution). Dikuli If the answer is 11. (Sorry do less professional. _., If ditemuin logical way, then this blog will be updated again)
4. There is a frog who wanted to cross a river. In the river, there are two types of stream objects, which can be occupied stone frogs and leaf frogs that can not be occupied. A frog can jump right to object or to jump in front of him (in other words, occupy the second object in front of him). How many ways can be taken frog to cross the river safely (with no stepping on leaves) fescinal if the object in the stream configuration is as follows (frog crossing from left to right)
Solution: It can be seen that at the back of the stone, "OXOXO" there is only one way is to occupy two places in front of him. From the first place, the position of "Koox", there are two possibilities. fescinal As for "OOOO" there are three possibilities. So if there is a multiplied total of 6 chances.
5. Mr. Zaki has 12 pieces of candy that will be distributed to three grandchildren, namely Abi, Aunt, and Cibi. Distributed sweets are consumed. In the division there may be grandchildren who do not get candy at all. Of course, fescinal the candy can not be distributed to more than one person. Because Cibi is Mr. Zaki's favorite grandson, the Cibi always get more than 6 candy. How many ways Mr. Zaki distribute the candy to his grandson grandchildren? One way many sweets are considered different if one of the people who received different.
Solution: So that probably is a division of AB 7. Pair [a, b] which allows is [0,5], [1,4], [2,3], [3,2], [4,1], [ 5.0]. Total = 6 AB 8. Pair [a, b] which allows is [0.4], [1.3], [2.2], [3.1], [4.0]. Total = 5 AB 9. Pair [a, b] which allows is [0.3], [1.2], [2.1], [3.0]. Total = 4 AB 10. Pair [a, b] which allows is [0.2], [1.1], [2.0]. Total = 3 AB 11. Pair [a, b] which allows is [0,1], [1,0]. Total = 2 AB 12. Pair [a, b] which allows is [0,0]. Total = 1
6. A shop sells donuts with different flavors different. There are 4 types of flavors of donuts are sold, namely Strawberry, Chocolate, Vanilla, and cappuccino. Mr. Dengklek want to buy 4 pieces of donuts. How many chances Mr. Dengklek to buy the donuts donuts?
Solution: There were 200 people at this party. Then there will be a shake S199. With Sn = n + (n-1) + (n-2) + ... + 2 + 1. Shake There are as many as 19900. But remember, that there are 100 pairs of congratulation that does not happen that shake a married couple. Then the amount of shake that occurs is 19900 - 100 = 19800 shake
8. On a mysterious island, there are 2 kinds of people, soldiers and thieves. fescinal The soldier always tell the truth and the thief always tell lies. One day you meet three people who said as follows:
Solution: We tried all the options on this matter. Options A and C are only A or only C which is soldier it will lead to a contradiction in the statement B, which is "At least one of us is a soldier", fescinal the opposite fescinal is "None of us is a soldier". If only B is a warrior it will lead to a contradiction in the statement C. If only the soldier B, then C is a thief. If C Air