All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info
Home
Welcome to perplexus.info, flooble's perplexing puzzle portal. Here, we collect all sorts of puzzles, from simple logic questions and word tricks to in-depth math problems like probability and geometry. Click around and see if your brain is up to the task! If you're new here, make sure you sign up so that you can leave comments and submit your own problems!
> Logic (1)> Probability> Shapes> General
> Numbers (1)> Games> Paradoxes> Riddles
> Just Math (1)> Science> Algorithms

The Duke of Densmore was killed by an explosion that damaged his castle. His testament, evidentally destroyed, was said to have displeased one of his 7 ex-wives. However, each of these women had come in the castle by invitation shortly before the crime. Each of the 7 ex-wifes swears that the invitation was the only time she went there. All of them could be guilty, but because of the careful preparation of the bomb, which was hidden and adjusted to fit in a knight's armor in the Duke's bedroom, the murderess must have come in the castle more than one time. So the guilty woman lied: she came in the castle several times. The women do not remember exactly the date when they went there, but they remember who they met:

Ann met Betty, Charlotte, Felicia, Georgia.
Betty met Ann, Charlotte, Edith, Felicia, Helen.
Charlotte met Ann, Betty, Edith.
Edith met Betty, Charlotte, Felicia.
Felicia met Ann, Betty, Edith, Helen.
Georgia met Ann, Helen.
Helen met Betty, Felicia, Georgia.

Which one was lying? Who is therefore the murderess? ________________________________________________

The original problem was posed in 1980 by the French mathematician Claude Berge (1926 - 2002) to demonstrate a solution by graph theory.

The puzzle is more a mathematical problem than a logical one. We can also see that every statement of an ex-wife confirms the other ones. (I put the problem in the category of 'logic' only because of its flavor.)

CLAUDE BERGE (1980):
"L'énigme policière", Regards sur la théorie des graphes,
Actes du Colloque de Cérisy, Presses polytechniques romandes, Lausanne.

CLAUDE BERGE (1994): "Qui a tué le duc de Densmore?",
Bibliothèque Oulipienne no. 67.

CLAUDE BERGE (2000): "Qui a tué le duc de Densmore?", Une nouvelle policière où le meurtrier est confondu grâce à l'utilisation d'un théorème de combinatoire.
(= Réédition du 1994 par Ed. Castor Astral)

The version of the problem given above is based on the following source:

http://mathafou.free.fr/pbm_en/pb205.html

(No Solution Yet, 0 Comments) Submitted on 2017-03-30 by ollie   
Difficulty: 4 of 5 Bonus: Self-limited sequence (in Sequences) Rating: 3.25
For a given sequence S=x1,x2,x3,.. of real numbers, x is called a subsequential limit of S, if x is the limit of a subsequence of S. For example, the sequence 1+2-1,2+2-1,1+2-2,2+2-2,.. has the subsequential limits 1 and 2.

Let S be a sequence so that the set of its subsequential limits is identical to the set of sequence elements. Prove that S contains a subsequence of the form x,x,x,...

(Solution Posted, 3 Comments) Submitted on 2006-12-14 by JLo   
Difficulty: 3 of 5Over 18 (in Sequences)
Posted on 2017-03-29 by Ady TZIDON (No Solution Yet, 3 Comments)
Difficulty: 1 of 5 QUICKIE X (in Just Math)
Posted on 2017-03-28 by Ady TZIDON (No Solution Yet, 3 Comments)
Difficulty: 2 of 5Why is it D2? (in Numbers)
Posted on 2017-03-27 by Ady TZIDON (No Solution Yet, 4 Comments)
Difficulty: 3 of 5Power partition procedure (in Numbers)
Posted on 2017-03-26 by Ady TZIDON (Solution Posted, 5 Comments)
Difficulty: 4 of 51 is one of them (in Numbers)
Posted on 2017-03-25 by Ady TZIDON (No Solution Yet, 2 Comments)
Difficulty: 3 of 5True for nine and up (in Numbers)
Posted on 2017-03-24 by Ady TZIDON (No Solution Yet, 3 Comments)
Difficulty: 2 of 5POPANASIS (in Word Problems)
Posted on 2017-03-23 by Ady TZIDON (No Solution Yet, 4 Comments)
Difficulty: 3 of 5Up and up (in Numbers) Rating: 5.00
Posted on 2017-03-22 by Ady TZIDON (No Solution Yet, 2 Comments)
Difficulty: 3 of 5 The sum of 2016 terms (in Sequences)
Posted on 2017-03-21 by Ady TZIDON (No Solution Yet, 1 Comments)
Difficulty: 2 of 5 Elongated Pentagonal Orthocupola's vertices (in Shapes)
Posted on 2017-03-20 by Ady TZIDON (No Solution Yet, 3 Comments)
Difficulty: 2 of 5Leave no stone unturned (in Logic) Rating: 4.00
Posted on 2017-03-19 by Ady TZIDON (Solution Posted, 5 Comments)
Difficulty: 4 of 5A rare palindrome (in Numbers)
Posted on 2017-03-18 by Ady TZIDON (No Solution Yet, 1 Comments)
Difficulty: 4 of 5Primes and factors (in Numbers)
Posted on 2017-03-17 by Ady TZIDON (Solution Posted, 2 Comments)
Difficulty: 3 of 5Same side story (in Probability)
Posted on 2017-03-16 by Ady TZIDON (No Solution Yet, 5 Comments)

Recently Posted Solutions:
Difficulty: 3 of 5Power partition procedure (in Numbers)
Submitted By Ady TZIDON. Solution posted on 2017-03-28 23:37:08
Difficulty: 2 of 5Leave no stone unturned (in Logic)
Submitted By Ady TZIDON. Solution posted on 2017-03-28 09:26:43
Difficulty: 2 of 5It's obvious, but needs proof (in Just Math)
Submitted By Ady TZIDON. Solution posted on 2017-03-28 09:19:36
Difficulty: 3 of 5Equality? Yes, but not exactly... (in Numbers)
Submitted By Ady TZIDON. Solution posted on 2017-03-28 09:17:25
Difficulty: 4 of 5Primes and factors (in Numbers)
Submitted By Ady TZIDON. Solution posted on 2017-03-27 07:52:13
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (1)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information