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

 1-2-3 Remainder Resolution (Posted on 2016-02-16)
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.

 No Solution Yet Submitted by K Sengupta Rating: 4.5000 (2 votes)

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

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

 Search: Search body:
Forums (0)