Which is a winning combination of digits?
[7772] Which is a winning combination of digits? - The computer chose a secret code (sequence of 4 digits from 1 to 6). Your goal is to find that code. Black circles indicate the number of hits on the right spot. White circles indicate the number of hits on the wrong spot. - #brainteasers #mastermind - Correct Answers: 3
BRAIN TEASERS
enter your answer and press button OK

Which is a winning combination of digits?

The computer chose a secret code (sequence of 4 digits from 1 to 6). Your goal is to find that code. Black circles indicate the number of hits on the right spot. White circles indicate the number of hits on the wrong spot.
Correct answers: 3
#brainteasers #mastermind
Register with your Google Account and start collecting points.
Check your ranking on list.

Play hide and go seek

Einstein, Newton and Pascal are playing hide and go seek.

It's Einstein's turn to count so he covers his eyes and starts counting to ten.

Pascal runs off and hides.

Newton draws a one metre by one metre square on the ground in front of Einstein and stands in the middle of it.

Einstein reaches ten and uncovers his eyes.

He sees Newton immediately and exclaims, "Newton! I found you! You're it!"

Newton smiles and says, "you didn't find me, you found a Newton over a square metre. You found Pascal!"

Jokes of the day - Daily updated jokes. New jokes every day.
Follow Brain Teasers on social networks

Brain Teasers

puzzles, riddles, mathematical problems, mastermind, cinemania...

Efim Isaakovich Zelmanov

Born 7 Sep 1955.Russian mathematician who was awarded the 1994 Fields Medal for his work on combinatorial problems in nonassociative algebra and group theory and particularly his solution of the Restricted Burnside problem. His Ph.D. (1980) Ph.D. thesis was on nonassociative algebra, wherein his treatment extending results from the classical theory of finite dimensional Jordan algebras to infinite dimensional Jordan algebras. In 1887, he showed that the Engel identity for Lie algebras implies nilpotence, in the previously unsolved case of infinite dimensions. The Restricted Burnside problem that he solved was a narrower condition arising out of Burnside's 1902 question whether a finitely generated group in which every element has finite order, is finite.«
This site uses cookies to store information on your computer. Some are essential to help the site properly. Others give us insight into how the site is used and help us to optimize the user experience. See our privacy policy.