When.com Web Search

  1. Ads

    related to: multiplication times table test printable

Search results

  1. Results From The WOW.Com Content Network
  2. Multiplication table - Wikipedia

    en.wikipedia.org/wiki/Multiplication_table

    Multiplication table from 1 to 10 drawn to scale with the upper-right half labeled with prime factorisations. In mathematics, a multiplication table (sometimes, less formally, a times table) is a mathematical table used to define a multiplication operation for an algebraic system.

  3. Light's associativity test - Wikipedia

    en.wikipedia.org/wiki/Light's_associativity_test

    In mathematics, Light's associativity test is a procedure invented by F. W. Light for testing whether a binary operation defined in a finite set by a Cayley multiplication table is associative. The naive procedure for verification of the associativity of a binary operation specified by a Cayley table, which compares the two products that can be ...

  4. Multiplication algorithm - Wikipedia

    en.wikipedia.org/wiki/Multiplication_algorithm

    It requires memorization of the multiplication table for single digits. This is the usual algorithm for multiplying larger numbers by hand in base 10. A person doing long multiplication on paper will write down all the products and then add them together; an abacus-user will sum the products as soon as each one is computed.

  5. Multiplication sign - Wikipedia

    en.wikipedia.org/wiki/Multiplication_sign

    The multiplication sign (×), also known as the times sign or the dimension sign, is a mathematical symbol used to denote the operation of multiplication, which results in a product. [ 1 ] The symbol is also used in botany , in botanical hybrid names .

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

  7. Fermat primality test - Wikipedia

    en.wikipedia.org/wiki/Fermat_primality_test

    Using fast algorithms for modular exponentiation and multiprecision multiplication, the running time of this algorithm is O(k log 2 n log log n) = Õ(k log 2 n), where k is the number of times we test a random a, and n is the value we want to test for primality; see Miller–Rabin primality test for details.