This site is supported by donations to The OEIS Foundation.
19
19 is a prime number. Any positive integer can be expressed as a sum of 19 or fewer fourth powers.
Contents
- 1 Membership in core sequences
- 2 Sequences pertaining to 19
- 3 Partitions of 19
- 4 Roots and powers of 19
- 5 Logarithms and nineteenth powers
- 6 Values for number theoretic functions with 19 as an argument
- 7 Factorization of some small integers in a quadratic integer ring adjoining the square roots of −19, 19
- 8 Factorization of 19 in some quadratic integer rings
- 9 Representation of 19 in various bases
- 10 See also
Membership in core sequences
Odd numbers | ..., 13, 15, 17, 19, 21, 23, 25, ... | A005408 |
Prime numbers | ..., 11, 13, 17, 19, 23, 29, 31, ... | A000040 |
Squarefree numbers | ..., 14, 15, 17, 19, 21, 22, 23, ... | A005117 |
Mersenne exponents | 2, 3, 5, 7, 13, 17, 19, 31, 61, ... | A000043 |
Central trinomial coefficients | 1, 1, 3, 7, 19, 51, 141, 393, ... | A002426 |
In Pascal's triangle, 19 occurs twice. (In Lozanić's triangle, 19 occurs four times).
Sequences pertaining to 19
Multiples of 19 | 0, 19, 38, 57, 76, 95, 114, 133, 152, 171, 190, 209, 228, ... | A008601 |
19-gonal numbers | 1, 19, 54, 106, 175, 261, 364, 484, 621, 775, 946, 1134, ... | A051871 |
sequence starting at 33 | 33, 100, 50, 25, 76, 38, 19, 58, 29, 88, 44, 22, 11, 34, 17, ... | A008880 |
sequence starting at 36 | 36, 18, 9, 26, 13, 38, 19, 56, 28, 14, 7, 20, 10, 5, 14, 7, 20, ... | A008894 |
19-rough numbers | 1, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, ... | A166061 |
Partitions of 19
There are 490 partitions of 19.
The Goldbach representations of 19 are 2 + 17 = 3 + 5 + 11 = 19 (there's also 3 + 3 + 13 = 5 + 7 + 7 if it's not required that the primes be distinct).
Roots and powers of 19
In the table below, irrational numbers are given truncated to eight decimal places.
4.35889894 | A010475 | 19 2 | 361 | |
2.66840164 | A010591 | 19 3 | 6859 | |
2.08779762 | A011015 | 19 4 | 130321 | |
1.80198312 | A011104 | 19 5 | 2476099 | |
1.63352430 | A011410 | 19 6 | 47045881 | |
1.52292699 | A011411 | 19 7 | 893871739 | |
1.44492132 | A011412 | 19 8 | 16983563041 | |
1.38702322 | A011413 | 19 9 | 322687697779 | |
1.34237965 | A011414 | 19 10 | 6131066257801 | |
A001029 |
Logarithms and nineteenth powers
In the OEIS specifically and mathematics in general, refers to the natural logarithm of , whereas all other bases are specified with a subscript.
As above, irrational numbers in the following table are truncated to eight decimal places.
TABLE GOES HERE
Values for number theoretic functions with 19 as an argument
–1 | ||
–3 | ||
8 | ||
20 | ||
2 | ||
18 | ||
1 | ||
1 | ||
18 | This is the Carmichael lambda function. | |
–1 | This is the Liouville lambda function. | |
1.0000019... | See A013677. | |
19! | 121645100408832000 | |
6402373705728000 |
Factorization of some small integers in a quadratic integer ring adjoining the square roots of −19, 19
Both and are unique factorization domains. There is something quite interesting about the way in which is a UFD. But first, we'll look at . In that domain, the norm function is .
- Theorem Z19EUC. The domain is a Euclidean domain in which the absolute value of the norm is a suitable Euclidean function. Given any two nonzero numbers , it is always possible to find two other numbers such that , and .
If this is true, then the Euclidean GCD algorithm can be implemented in this domain. Whatever two nonzero numbers in the domain are input into the algorithm, a sequence of quotients and remainders is produced, and the absolute values of the norms of the remainders form a decreasing sequence. The Euclidean algorithm may or may not always produce optimal results, but it should always produce an answer in a finite number of steps.
- Proof. If is a divisor of , or the other way around, then or as needed, and . If this is not the case, it does not automatically mean and are coprime, but it does mean that but . Notate and . The we have:
- where . Now choose such that and then set and . Since the norm is multiplicative, it follows that and therefore
- ???????
- as specified by the theorem. ENDOFPROOFMARK
We then say that is norm-Euclidean, and from this it automatically follows that it is a principal ideal domain and therefore a unique factorization domain. , on the other hand, is a principal ideal domain but not norm-Euclidean, and a single example example suffices to demonstrate that it is not norm-Euclidean.
Given and , can we find numbers such that , and ? In this domain, the norm is never negative, and since the numbers are spread out throughout the complex plane rather than crammed on the real number line, it is easy to make diagrams to help us visualize these things. In the following diagram, 0 is represented by a black dot, the nonzero numbers of by green dots, and the nonzero numbers of by red dots.
As you can see, 10 is a red dot that almost smack dab in the middle of a lozenge-like shape formed by green dots. It stands to reason that, as values of , those green dots closest to 10 correspond to smaller than green dots farther away. We need to find just one dot such that .
7 | 3 | 9 |
7 | ||
19 | ||
20 | ||
11 | ||
14 | –4 | 16 |
It's not necessary to continue this with and so on to see that there is no value of suitable for the Euclidean algorithm to be found.
We do need a theorem to prove that is not Euclidean for any suitable function whatsoever, and it becomes a little more involved to show that it is a principal ideal domain. But we will not include those theorems here at this time.
Of course the Euclidean algorithm is not the only way to find GCDs. From prime factorizaton alone it would be obvious that . Now follows a table of factorization of some small integers in and .
2 | Prime | |
3 | ||
4 | 2 2 | |
5 | ||
6 | 2 × 3 | |
7 | Prime | |
8 | 2 3 | |
9 | 3 2 | |
10 | ||
11 | Prime | |
12 | 2 2 × 3 | |
13 | Prime | |
14 | ||
15 | ||
16 | 2 4 | |
17 | ||
18 | 2 × 3 2 | |
19 | ||
20 |
Since both of these domains are UFDs, looking at the factorizations of ideals does not give us much insight. The factorization of an ideal is pretty much the same as that of the generating number. Often it's just a matter of changing parentheses to angle brackets.
However, there are a few subtleties to consider, which concern 2 and 19 (and, of course, also their negative counterparts).
First, although (as noted above), the ideal in ramifies, since and are associated by multiplication by a unit. And so, .
In , 2 is prime, as is the ideal generated by it. The equation has no solutions in nonzero integers. This means that if a number in this domain has nonzero imaginary part and an even norm, then that norm is divisible by an odd number greater than 1. For example, and have norms that are divisible by 5 and by 7, respectively.
Lastly, note that although , as ideals go, we still have .
Factorization of 19 in some quadratic integer rings
As was mentioned above, 19 is a prime number in . But it is composite in some quadratic integer rings.
TABLE GOES HERE
Representation of 19 in various bases
Base | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 through 36 |
Representation | 10011 | 201 | 103 | 34 | 31 | 25 | 23 | 21 | 19 | 18 | 17 | 16 | 15 | 14 | 13 | 12 | 11 | 10 | J |
See also
0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 |
30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 |
40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 |
1729 |