enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Problem set - Wikipedia

    en.wikipedia.org/wiki/Problem_set

    A problem set, sometimes shortened as pset, [1] is a teaching tool used by many universities. Most courses in physics, math, engineering, chemistry, and computer science will give problem sets on a regular basis. [2] They can also appear in other subjects, such as economics.

  3. Wason selection task - Wikipedia

    en.wikipedia.org/wiki/Wason_selection_task

    The Wason selection task (or four-card problem) is a logic puzzle devised by Peter Cathcart Wason in 1966. [1] [2] [3] It is one of the most famous tasks in the study of deductive reasoning. [4] An example of the puzzle is: You are shown a set of four cards placed on a table, each of which has a number on one side and a color on the other.

  4. Five-room puzzle - Wikipedia

    en.wikipedia.org/wiki/Five-room_puzzle

    Finally, it will come back into the room through the fourth wall and end. If the solution line starts somewhere else, the observer will see the solution line come into and leave his room exactly twice, passing through all four walls in some order. There is no problem with any of this. Consider, however, the observers in the remaining three rooms.

  5. Monty Hall problem - Wikipedia

    en.wikipedia.org/wiki/Monty_Hall_problem

    The game host then opens one of the other doors, say 3, to reveal a goat and offers to let the player switch from door 1 to door 2. The Monty Hall problem is a brain teaser, in the form of a probability puzzle, based nominally on the American television game show Let's Make a Deal and named after its original host, Monty Hall.

  6. Balance puzzle - Wikipedia

    en.wikipedia.org/wiki/Balance_puzzle

    b. The odd coin is among the population of 8 coins, proceed in the same way as in the 12 coins problem. 3) Test 2a, Test 3 of the coins from the group of 5 coins against any 3 coins from the population of 8 coins: a. If the 3 coins balance, then the odd coin is among the remaining population of 2 coins.

  7. No-three-in-line problem - Wikipedia

    en.wikipedia.org/wiki/No-three-in-line_problem

    Equivalently, this is the smallest set that could be produced by a greedy algorithm that tries to solve the no-three-in-line problem by placing points one at a time until it gets stuck. [3] If only axis-parallel and diagonal lines are considered, then every such set has at least n − 1 {\displaystyle n-1} points. [ 18 ]

  8. Hilbert's fifth problem - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_fifth_problem

    Hilbert's fifth problem is the fifth mathematical problem from the problem list publicized in 1900 by mathematician David Hilbert, and concerns the characterization of Lie groups. The theory of Lie groups describes continuous symmetry in mathematics; its importance there and in theoretical physics (for example quark theory ) grew steadily in ...

  9. Hilbert's problems - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_problems

    Problems 1, 2, 5, 6, [a] 9, 11, 12, 15, and 22 have solutions that have partial acceptance, but there exists some controversy as to whether they resolve the problems. That leaves 8 (the Riemann hypothesis), 13 and 16 [b] unresolved. Problems 4 and 23 are considered as too vague to ever be described as solved; the withdrawn 24 would also be in ...