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

Home > Logic
1-2-3 Remainder Resolution (Posted on 2016-02-16) Difficulty: 3 of 5
Abe challenges Bee to determine a 3-digit positive integer N.
It is known that the number formed by the last two digits of N when divided by 9, yields a remainder of 3.

Abe makes the following statements, precisely one of which is false:
  1. N divided separately by each of 2, 4, 6, and 8 yields a remainder of 1.
  2. N divided separately by each of 5 and 7 yields a remainder of 2.
  3. N divided separately by each of 5 and 11 yields a remainder of 3.
Determine the value of N from the above statements and given clues.

See The Solution Submitted by K Sengupta    
Rating: 4.6667 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: my way - final answers | Comment 8 of 12 |
(In reply to my way - final answers by Ady TZIDON)

993 mod 6 = 3 -> Statement 1 is false

993 mod 5 = 3 -> Statement 2 is false and 3 is true
993 can't be a solution with the constraint that two of the statements are true.

  Posted by Brian Smith on 2016-02-16 12:51:18
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 (12)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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