enow.com Web Search

Search results

1. Results from the WOW.Com Content Network

2. Word problem (mathematics education) - Wikipedia

   en.wikipedia.org/wiki/Word_problem_(mathematics...

   Word problem from the Līlāvatī (12th century), with its English translation and solution. In science education, a word problem is a mathematical exercise (such as in a textbook, worksheet, or exam) where significant background information on the problem is presented in ordinary language rather than in mathematical notation.

3. Non-decimal currency - Wikipedia

   en.wikipedia.org/wiki/Non-decimal_currency

   A British gold sovereign with a face value of £1. Prior to decimalisation on 15 February 1971, £1 was made up of 240 pence.. A non-decimal currency is a currency that has sub-units that are a non-decimal fraction of the main unit, i.e. the number of sub-units in a main unit is not a power of 10.

4. Word problem - Wikipedia

   en.wikipedia.org/wiki/Word_problem

   Word problem (mathematics education), a type of textbook exercise or exam question to have students apply abstract mathematical concepts to real-world situations; Word problem (mathematics), a decision problem for algebraic identities in mathematics and computer science; Word problem for groups, the problem of recognizing the identity element ...

5. History of money - Wikipedia

   en.wikipedia.org/wiki/History_of_money

   The Marteau Early 18th-Century Currency Converter A Platform of Research in Economic History. Historical Currency Conversion Page by Harold Marcuse. Focuses on converting German marks to US dollars since 1871 and inflating them to values today, but has much additional information on the history of currency exchange. Gold in US Geological Survey

6. Coin problem - Wikipedia

   en.wikipedia.org/wiki/Coin_problem

   Frobenius coin problem with 2-pence and 5-pence coins visualised as graphs: Sloping lines denote graphs of 2x+5y=n where n is the total in pence, and x and y are the non-negative number of 2p and 5p coins, respectively.

7. Change-making problem - Wikipedia

   en.wikipedia.org/wiki/Change-making_problem

   One variation of this problem assumes that the people making change will use the "greedy algorithm" for making change, even when that requires more than the minimum number of coins. Most current currencies use a 1-2-5 series , but some other set of denominations would require fewer denominations of coins or a smaller average number of coins to ...