enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Archimedes's cattle problem - Wikipedia

    en.wikipedia.org/wiki/Archimedes's_cattle_problem

    Archimedes's cattle problem (or the problema bovinum or problema Archimedis) is a problem in Diophantine analysis, the study of polynomial equations with integer solutions. Attributed to Archimedes , the problem involves computing the number of cattle in a herd of the sun god from a given set of restrictions.

  3. Einstellung effect - Wikipedia

    en.wikipedia.org/wiki/Einstellung_effect

    The extinction problem was a problem that could not be solved using the previous solution B − A − 2C. In order to answer the extinction problem correctly, one had to solve the problem directly and generate a novel solution. An incorrect solution to the extinction problem indicated the presence of the Einstellung effect. The problems after ...

  4. Art gallery problem - Wikipedia

    en.wikipedia.org/wiki/Art_gallery_problem

    In decision problem versions of the art gallery problem, one is given as input both a polygon and a number k, and must determine whether the polygon can be guarded with k or fewer guards. This problem is -complete, as is the version where the guards are restricted to the edges of the polygon. [10]

  5. How to Solve It - Wikipedia

    en.wikipedia.org/wiki/How_to_Solve_It

    First, you have to understand the problem. [2] After understanding, make a plan. [3] Carry out the plan. [4] Look back on your work. [5] How could it be better? If this technique fails, Pólya advises: [6] "If you cannot solve the proposed problem, try to solve first some related problem. Could you imagine a more accessible related problem?"

  6. 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.

  7. Two Generals' Problem - Wikipedia

    en.wikipedia.org/wiki/Two_Generals'_Problem

    A key concept in epistemic logic, this problem highlights the importance of common knowledge. Some authors also refer to this as the Two Generals' Paradox, the Two Armies Problem, or the Coordinated Attack Problem. [1] [2] The Two Generals' Problem was the first computer communication problem to be proven to be unsolvable. [3]

  8. Thomson problem - Wikipedia

    en.wikipedia.org/wiki/Thomson_problem

    Schematic geometric solutions of the mathematical Thomson Problem for up to N = 5 electrons. Mathematically exact minimum energy configurations have been rigorously identified in only a handful of cases. For N = 1, the solution is trivial. The single electron may reside at any point on the surface of the unit sphere.

  9. Feynman sprinkler - Wikipedia

    en.wikipedia.org/wiki/Feynman_sprinkler

    The experiment ended with the explosion of the glass carboy that he was using as part of his setup. In 1966, Feynman turned down an offer from the editor of Physics Teacher to discuss the problem in print and objected to it being called "Feynman's problem," pointing instead to the discussion of it in Mach's textbook. [3]