209 (number)

In mathematics

• There are 209 spanning trees in a 2 × 5 grid graph, 209 partial permutations on four elements, and 209 distinct undirected simple graphs on 7 or fewer unlabeled vertices.
• 209 is the smallest number with six representations as a sum of three positive squares. These representations are:
• :209 . :By Legendre's three-square theorem, all numbers congruent to 1, 2, 3, 5, or 6 mod 8 have representations as sums of three squares, but this theorem does not explain the high number of such representations for 209.
• , one less than the product of the first four prime numbers. Therefore, 209 is a Euclid number of the second kind, also called a Kummer number. One standard proof of Euclid's theorem that there are infinitely many primes uses the Kummer numbers, by observing that the prime factors of any Kummer number must be distinct from the primes in its product formula as a Kummer number. However, the Kummer numbers are not all prime, and as a semiprime (the product of two smaller prime numbers ), 209 is the first example of a composite Kummer number.

References

References

1. {{Cite OEIS. A001353
2. Kreweras, Germain. (1978). "Complexité et circuits eulériens dans les sommes tensorielles de graphes". Journal of Combinatorial Theory.
3. {{Cite OEIS. A002720
4. (2007). "Combinatorial results for the symmetric inverse semigroup". Semigroup Forum.
5. {{Cite OEIS. A006897
6. (2006). "Taxonomy of graphs of order 10". Congressus Numerantium.
7. {{Cite OEIS. A025414
8. {{Cite OEIS. A057588
9. O'Shea, Owen. (2016). "The Call of the Primes: Surprising Patterns, Peculiar Puzzles, and Other Marvels of Mathematics". Prometheus Books.
10. {{Cite OEIS. A125549