enow.com Web Search

Search results

1. Results from the WOW.Com Content Network

2. Quinary - Wikipedia

   en.wikipedia.org/wiki/Quinary

   Quinary (base 5 or pental [1] [2] [3]) is a numeral system with five as the base. A possible origination of a quinary system is that there are five digits on either hand . In the quinary place system, five numerals, from 0 to 4 , are used to represent any real number .

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

4. List of undecidable problems - Wikipedia

   en.wikipedia.org/wiki/List_of_undecidable_problems

   For functions in certain classes, the problem of determining: whether two functions are equal, known as the zero-equivalence problem (see Richardson's theorem); [5] the zeroes of a function; whether the indefinite integral of a function is also in the class. [6] Of course, some subclasses of these problems are decidable.

5. Block-stacking problem - Wikipedia

   en.wikipedia.org/wiki/Block-stacking_problem

   The first nine blocks in the solution to the single-wide block-stacking problem with the overhangs indicated. In statics, the block-stacking problem (sometimes known as The Leaning Tower of Lire (Johnson 1955), also the book-stacking problem, or a number of other similar terms) is a puzzle concerning the stacking of blocks at the edge of a table.

6. How to Solve It - Wikipedia

   en.wikipedia.org/wiki/How_to_Solve_It

   Can you vary or change your problem to create a new problem (or set of problems) whose solution(s) will help you solve your original problem? Search: Auxiliary Problem: Can you find a subproblem or side problem whose solution will help you solve your problem? Subgoal: Here is a problem related to yours and solved before

7. 100 prisoners problem - Wikipedia

   en.wikipedia.org/wiki/100_prisoners_problem

   Prisoners 5 to 7 will also each find their numbers in a similar fashion. In this case, all prisoners find their numbers. This is, however, not always the case. For example, the small change to the numbers of swapping drawers 5 and 8 would cause prisoner 1 to fail after opening 1, 7, 5, and 2 (and not finding their own number):

8. Change-making problem - Wikipedia

   en.wikipedia.org/wiki/Change-making_problem

   The following is a dynamic programming implementation (with Python 3) which uses a matrix to keep track of the optimal solutions to sub-problems, and returns the minimum number of coins, or "Infinity" if there is no way to make change with the coins given. A second matrix may be used to obtain the set of coins for the optimal solution.

9. Smale's problems - Wikipedia

   en.wikipedia.org/wiki/Smale's_problems

   Smale's problems is a list of eighteen unsolved problems in mathematics proposed by Steve Smale in 1998 [1] and republished in 1999. [2] Smale composed this list in reply to a request from Vladimir Arnold, then vice-president of the International Mathematical Union, who asked several mathematicians to propose a list of problems for the 21st century.