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

Home > Logic
Covert Quantity V (Posted on 2022-01-16) Difficulty: 3 of 5
+--------------+
| 2 6 5 7 | RR |
+--------------+
| 4 2 6 8 | #  |
+--------------+
| 0 4 1 5 | R  |
+---------------
| 1 7 4 9 | BB |
+---------------
Each of the rows in the table given above indicates an attempt to find out the secret number. Each try has, in the column to the right, the letters R and B and the hashtag(#) symbol.

Each R indicates that this digit has one digit common with the secret number, but in a different position.

Each B indicates that this number has one digit common with the secret number in the same position.

A single hash (#) indicates that none of the digits are correct.

Determine the secret number.

*** The four digits of the secret number are different.

See The Solution Submitted by K Sengupta    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution | Comment 1 of 3
From the second line, none of 2, 4, 6, and 8 appear in the number. 

Thus, from the first line, two of the digits in the number are 5 and 7.

Looking next at the third line, we know that the number contains a 5, therefore the R must correspond to the 5 and neither 0 nor 1 are included in the number. Since all of the digits of the number are different, this means that the number is comprised of the digits 3, 5, 7, and 9.

Moving to the last line then, the Bs must correspond to the 7 and the 9, so the number is of the form x7x9. Since we know from the first line that the 5 is not in the 3rd position, the number must be 5739.

  Posted by H M on 2022-01-16 09:56:43
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 (24)
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