Luxist Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Squaring the square - Wikipedia

    en.wikipedia.org/wiki/Squaring_the_square

    Squaring the square is the problem of tiling an integral square using only other integral squares. (An integral square is a square whose sides have integer length.) The name was coined in a humorous analogy with squaring the circle. Squaring the square is an easy task unless additional conditions are set.

  3. Pythagorean theorem - Wikipedia

    en.wikipedia.org/wiki/Pythagorean_theorem

    In mathematics, the Pythagorean theorem or Pythagoras' theorem is a fundamental relation in Euclidean geometry between the three sides of a right triangle. It states that the area of the square whose side is the hypotenuse (the side opposite the right angle) is equal to the sum of the areas of the squares on the other two sides.

  4. Square number - Wikipedia

    en.wikipedia.org/wiki/Square_number

    Square number. Square number 16 as sum of gnomons. In mathematics, a square number or perfect square is an integer that is the square of an integer; [1] in other words, it is the product of some integer with itself. For example, 9 is a square number, since it equals 32 and can be written as 3 × 3 .

  5. Completing the square - Wikipedia

    en.wikipedia.org/wiki/Completing_the_square

    In elementary algebra, completing the square is a technique for converting a quadratic polynomial of the form. to the form for some values of h and k . In other words, completing the square places a perfect square trinomial inside of a quadratic expression. Completing the square is used in. finding Laplace transforms.

  6. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    Sphere packing finds practical application in the stacking of . In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three- dimensional Euclidean space. However, sphere packing problems can be generalised to ...

  7. Integer square root - Wikipedia

    en.wikipedia.org/wiki/Integer_square_root

    Digit-by-digit algorithm. The traditional pen-and-paper algorithm for computing the square root is based on working from higher digit places to lower, and as each new digit pick the largest that will still yield a square . If stopping after the one's place, the result computed will be the integer square root.

  8. Methods of computing square roots - Wikipedia

    en.wikipedia.org/wiki/Methods_of_computing...

    A method analogous to piece-wise linear approximation but using only arithmetic instead of algebraic equations, uses the multiplication tables in reverse: the square root of a number between 1 and 100 is between 1 and 10, so if we know 25 is a perfect square (5 × 5), and 36 is a perfect square (6 × 6), then the square root of a number greater ...

  9. Euler's totient function - Wikipedia

    en.wikipedia.org/wiki/Euler's_totient_function

    In number theory, Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. It is written using the Greek letter phi as or , and may also be called Euler's phi function. In other words, it is the number of integers k in the range 1 ≤ k ≤ n for which the greatest common divisor gcd (n, k ...