Which is a winning combination of digits?
[1159] 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: 69 - The first user who solved this task is James Lillard
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: 69
The first user who solved this task is James Lillard.
#brainteasers #mastermind
Register with your Google Account and start collecting points.
Check your ranking on list.

A wife, being the romantic sor...

A wife, being the romantic sort, sent her husband a text:
"If you are sleeping, send me your dreams. If you are laughing, send me your smile. If you are eating, send me a bite. If you are drinking, send me a sip. If you are crying, send me your tears. I love you."
He replied, "I am in the bathroom. Please advise."
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...

Michael Hartley Freedman

Born 21 Apr 1951.American mathematician who was awarded the Fields Medal in 1986 for his proof of the conjecture in four dimensions (1982). The Poincaré conjecture, one of the famous problems of 20th-century mathematics, asserts that a simply connected closed 3-dimensional manifold is a 3-dimensional sphere. The higher dimensional Poincaré conjecture claims that any closed n-manifold which is homotopy equivalent to the n-sphere must be the n-sphere. For values of n at least 5, a solution was given by Smale in 1961. Two decades later, Freedman proved the conjecture for n = 4. However, the original conjecture for n=3 the remained open. Grigori Perelman gave a complete proof in 2003.«
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.