All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
Two Logicians Lockout (Posted on 2007-03-13) Difficulty: 3 of 5
Two different integers from 1 to N are chosen. Sam is given the sum and Pat is given the product. Sam and Pat take turns stating whether they can determine the numbers

Sam: I don't know the numbers.
Pat: I don't know the numbers.
Sam: I don't know the numbers.
Pat: I don't know the numbers.
.
.
.
.
Sam and Pat continue like this until one of them realizes that it is impossible for either of them to determine the numbers. What is the smallest possible N for which this can happen?

See The Solution Submitted by Brian Smith    
Rating: 4.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Questionwhat about 1Fox2007-03-27 01:53:19
Graphical interpretation (examples)Gamer2007-03-18 17:01:00
Graphical interpretation (word explanation)Gamer2007-03-18 16:46:56
Solutionre: ...Huh?Charlie2007-03-18 15:00:07
...Huh?George2007-03-18 11:44:30
Solutionreal computer solution -- disregard previousCharlie2007-03-14 09:40:21
Some Thoughtsre: computer solution -- moreCharlie2007-03-14 09:13:38
Some Thoughtscomputer solutionCharlie2007-03-14 09:04:00
Some ThoughtsMore than 30 seconds.Leming2007-03-14 07:25:20
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 (8)
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