"Professor Smullyan was a serious mathematician, with the publications and the doctorate to prove it. But his greatest legacy may be the devilishly clever logic puzzles that he devised, presenting them in numerous books or just in casual conversation." One of my friend drew my attention to this article on NY Times. The article contains 5 of his puzzles. https://www.nytimes.com/interactive/2017/02/11/obituaries/smullyan-logic-puzzles.html R.I.P Raymond Smullyan [02/06/17] #puz

In a rectangular dance hall, how do you place 10 chairs along the walls so that there are equal number of chairs alongside each wall? #puzzle #math #brainteaser

Here are a few solutions. Solution 1. Solution 2. Solution 3. When you remove 10 pieces and still keep each row and column even. #math #brainteaser #puzzle

KEEP IT EVEN ! Take 16 small objects (for example coins, magnets, pieces of paper, etc.) and put them in four rows of 4 as it shown on the right. Remove 6, leaving an even number of objects in each row and each column. Try to find as many solutions as many you can. After you get bored with removing 6 pieces, try to remove 10 pieces. #puzzle #math #brainteaser

V I + I V = X 6+4=10 #brainteaser #math #puzzle

Correct The Error ! With 12 matches form the "equation" shown bellow. V I - I V = I X The "equation" shows (with roman numerals) that 6-4=9 . Correct it by shifting just one match. The roman numeral table below is for your reference only. #puzzle #math #brainteaser

Place three piles of matches (coins, or something small, that you can group together easily) on the table. Make one pile with 11 matches, the second one with 7 matches, and the third one with 6 matches. You are to move matches so that each pile contains 8 matches. You can add to any pile only as many matches as it already contains, and all the matches must come from one other pile. For example: If a pile contains 3 matches, you can add 3 to it, no more no less. You have THREE

One possible solution. Original: Step one: Step two: Step three: #puzzle

Moving Checkers Place 6 checkers on a table in a row, alternating them black, white, black, white, and so on as shown. Leave a vacant place large enough for 4 checkers on the left. Move the checkers so that all the white ones will end on the left, followed by all the black ones. The checkers must be moved in pairs, taking 2 adjacent checkers at a time, withouth switching their order, and sliding them to a vacant place. To solve this problem, only 3 such moves are necessary. H