enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Least common multiple - Wikipedia

    en.wikipedia.org/wiki/Least_common_multiple

    A least common multiple of a and b is a common multiple that is minimal, in the sense that for any other common multiple n of a and b, m divides n. In general, two elements in a commutative ring can have no least common multiple or more than one. However, any two least common multiples of the same pair of elements are associates. [10]

  3. Table of prime factors - Wikipedia

    en.wikipedia.org/wiki/Table_of_prime_factors

    A perfect power has a common divisor m > 1 for all multiplicities (it is of the form a m for some a > 1 and m > 1). The first: 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100 (sequence A001597 in the OEIS). 1 is sometimes included. A powerful number (also called squareful) has multiplicity above 1 for all prime factors. The first: 1, 4, 8, 9, 16 ...

  4. Integer triangle - Wikipedia

    en.wikipedia.org/wiki/Integer_triangle

    A 5-Con triangle pair is a pair of triangles that are similar but not congruent and that share three angles and two sidelengths. Primitive integer 5-Con triangles, in which the four distinct integer sides (two sides each appearing in both triangles, and one other side in each triangle) share no prime factor, have triples of sides

  5. Heronian triangle - Wikipedia

    en.wikipedia.org/wiki/Heronian_triangle

    In geometry, a Heronian triangle (or Heron triangle) is a triangle whose side lengths a, b, and c and area A are all positive integers. [1] [2] Heronian triangles are named after Heron of Alexandria, based on their relation to Heron's formula which Heron demonstrated with the example triangle of sides 13, 14, 15 and area 84.

  6. Coprime integers - Wikipedia

    en.wikipedia.org/wiki/Coprime_integers

    In number theory, two integers a and b are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. [1] Consequently, any prime number that divides a does not divide b, and vice versa. This is equivalent to their greatest common divisor (GCD) being 1. [2] One says also a is prime to b or a ...

  7. Amicable numbers - Wikipedia

    en.wikipedia.org/wiki/Amicable_numbers

    However, amicable numbers where the two members have different smallest prime factors do exist: there are seven such pairs known. [8] Also, every known pair shares at least one common prime factor. It is not known whether a pair of coprime amicable numbers exists, though if any does, the product of the two must be greater than 10 65.

  8. Carmichael function - Wikipedia

    en.wikipedia.org/wiki/Carmichael_function

    The Carmichael lambda function of a prime power can be expressed in terms of the Euler totient. Any number that is not 1 or a prime power can be written uniquely as the product of distinct prime powers, in which case λ of the product is the least common multiple of the λ of the prime power factors.

  9. List of trigonometric identities - Wikipedia

    en.wikipedia.org/wiki/List_of_trigonometric...

    In particular, in these two identities an asymmetry appears that is not seen in the case of sums of finitely many angles: in each product, there are only finitely many sine factors but there are cofinitely many cosine factors. Terms with infinitely many sine factors would necessarily be equal to zero.