Home     Contact     Projects     Experiments     Circuits     Theory     BLOG     PIC Tutorials     Time for Science     RSS     Terms of services     Privacy policy  
 Home      Projects     Experiments     Circuits     Theory     BLOG     PIC Tutorials     Time for Science   

<< Back to INDEX

The riddle of the day #22 - The bald village
posted March 28 2013 21:48.38 by Giorgos Lazaridis

Here is the complete image {click to enlarge):

What a twisted scientist! Anyway, if you want to see the answer to this riddle, click on the following button:


You might also like...

Me...Fix... Photo #2 [4 Photos]

Resonance Experiment

Creativity and Imagination #6 [4 Photos]

Life Size Lego Car Powered by Air! [Crazy Project]

Coke cans VS Acid and Base Experiment [Chemistry]

A Remotely Programable Relay Controller [Project]

Catching neutrinos with Fermilab's massive next-generation detector [Science]

Manual voltage multiplier [Science]

<< Back to INDEX



  Email (shall not be published)


Notify me of new posts via email

Write your comments below:
BEFORE you post a comment:You are welcome to comment for corrections and suggestions on this page. But if you have questions please use the forum instead to post it. Thank you.


  • At 30 March 2013, 15:15:14 user Giorgos Lazaridis wrote:   [reply @ Giorgos Lazaridis]
    • @VikingKing say that there are 1001 people in the village. #3 states that no one can have more than 1001 hair. So he must have less than 1001.... This would violate #1 or #2

  • At 30 March 2013, 9:55:26 user VikingKing wrote:   [reply @ VikingKing]
    • There is a flaw in the riddle.
      The way it is stated, a man may have less then 999 hairs or more then 1000 hairs, but none as 1000. So somebody may have 100000 hairs and >1000 people my live in the village.

      The riddle should state that "No one has more then 999 hairs"

     Contact     Forum     Projects     Experiments     Circuits     Theory     BLOG     PIC Tutorials     Time for Science     RSS   

    Site design: Giorgos Lazaridis
    © Copyright 2008
    Please read the Terms of services and the Privacy policy