When.com Web Search

  1. Ads

    related to: roll and solve multiplication problems

Search results

  1. Results From The WOW.Com Content Network
  2. Ancient Egyptian mathematics - Wikipedia

    en.wikipedia.org/wiki/Ancient_Egyptian_mathematics

    The ancient Egyptians utilized a numeral system for counting and solving written mathematical problems, often involving multiplication and fractions. Evidence for Egyptian mathematics is limited to a scarce amount of surviving sources written on papyrus.

  3. Rhind Mathematical Papyrus - Wikipedia

    en.wikipedia.org/wiki/Rhind_Mathematical_Papyrus

    Problems 1–7, 7B and 8–40 are concerned with arithmetic and elementary algebra. Problems 1–6 compute divisions of a certain number of loaves of bread by 10 men and record the outcome in unit fractions. Problems 7–20 show how to multiply the expressions 1 + 1/2 + 1/4 = 7/4, and 1 + 2/3 + 1/3 = 2 by different fractions.

  4. Matrix multiplication algorithm - Wikipedia

    en.wikipedia.org/wiki/Matrix_multiplication...

    Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. . Applications of matrix multiplication in computational problems are found in many fields including scientific computing and pattern recognition and in seemingly unrelated problems such as counting the paths through a grap

  5. Ancient Egyptian multiplication - Wikipedia

    en.wikipedia.org/.../Ancient_Egyptian_multiplication

    In mathematics, ancient Egyptian multiplication (also known as Egyptian multiplication, Ethiopian multiplication, Russian multiplication, or peasant multiplication), one of two multiplication methods used by scribes, is a systematic method for multiplying two numbers that does not require the multiplication table, only the ability to multiply and divide by 2, and to add.

  6. Multiplication algorithm - Wikipedia

    en.wikipedia.org/wiki/Multiplication_algorithm

    Karatsuba multiplication is an O(n log 2 3) ≈ O(n 1.585) divide and conquer algorithm, that uses recursion to merge together sub calculations. By rewriting the formula, one makes it possible to do sub calculations / recursion. By doing recursion, one can solve this in a fast manner.

  7. Trachtenberg system - Wikipedia

    en.wikipedia.org/wiki/Trachtenberg_system

    Some of the algorithms Trachtenberg developed are ones for general multiplication, division and addition. Also, the Trachtenberg system includes some specialised methods for multiplying small numbers between 5 and 13. The section on addition demonstrates an effective method of checking calculations that can also be applied to multiplication.