This site is supported by donations to The OEIS Foundation.

3

From OeisWiki
Jump to navigationJump to search


This article is under construction.            

Please do not rely on any information it contains.            


3 is the smallest odd prime number, and the only prime number that is one more than another prime (namely, 2).

Membership in core sequences

Odd numbers 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, ... A005408
Prime numbers 2, 3, 5, 7, 11, 13, 17, 19, ... A000040
Fibonacci numbers 1, 1, 2, 3, 5, 8, 13, 21, ... A000045
Lucas numbers 2, 1, 3, 4, 7, 11, 18, 29, 47, ... A000032
Triangular numbers 1, 3, 6, 10, 15, 21, 28, 36, 45, ... A000217

In Pascal's triangle, 3 occurs twice. (In Lozanić's triangle, 3 occurs four times).

Sequences pertaining to 3

Multiples of 3 0, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, ... A008585
Inert rational primes in (3) 5, 7, 17, 19, 29, 31, 41, 43, 53, 67, 79, 89, ... A003630
Positive numbers of the form x23y2 1, 4, 6, 9, 13, 16, 22, 24, 25, 33, 36, 37, 46, ... A084916
Negative numbers of the form x23y2 –2, –3, –8, –11, –12, –18, –23, –26, –27, –32, ... A084917
3x+1 sequence beginning at 3 3, 10, 5, 16, 8, 4, 2, 1, 4, 2, 1, 4, 2, 1, 4, 2, 1, ... A033478
Fermat pseudoprimes to base 3 91, 121, 286, 671, 703, 949, 1105, 1541, 1729, ... A005935

Partitions of 3

There are only three partitions of 3: {1, 1, 1}, {1, 2} and {3}. Thus the only partition of 3 into primes is a trivial partition.

Roots and powers of 3

In the table below, irrational numbers are given truncated to eight decimal places.

3 1.73205080 A002194 3 2 9
33 1.44224957 A002581 3 3 27
34 1.31607401 A011002 3 4 81
35 1.24573093 A005532 3 5 243
36 1.20093695 A246708 3 6 729
37 1.16993081 A246709 3 7 2187
38 1.14720269 A246710 3 8 6561
39 1.12983096 A011446 3 9 19683
310 1.11612317 A246711 3 10 59049
311 1.10503150 3 11 177147
312 1.09587269 3 12 531441
A000244

Logarithms and cubes

In the OEIS specifically and mathematics in general, logx refers to the natural logarithm of x, whereas all other bases are specified with a subscript.

If n is not a multiple of 7, then either n31 or n3+1 is. Hence the formula for the Legendre symbol (a7)=a3mod7.

As above, irrational numbers in the following table are truncated to eight decimal places.

log32 0.63092975 A102525 log23 1.58496250 A102525 2 3 8
log3e 0.91023922 A121935 log3 1.09861228 A002162 e3 20.08553692 A091933
log33 1.00000000 3 3 27
log3π 1.04197804 logπ3 0.95971311 π3 31.00627668 A091925
log34 1.26185950 A100831 log43 0.79248125 A094148 4 3 64
log35 1.46497352 A113209 log53 0.68260619 A152914 5 3 125
log36 1.63092975 A153459 log63 0.61314719 A152935 6 3 216
log37 1.77124374 A152565 log73 0.56457503 A152945 7 3 343
log38 1.89278926 A113210 log83 0.52832083 A152956 8 3 512
log39 2.00000000 log93 0.50000000 9 3 729
log310 2.09590327 A152566 log103 0.47712125 A114490 10 3 1000

(See A000578 for integer cubes).

Values for number theoretic functions with 3 as an argument

μ(3) –1
M(3) –1
π(3) 2
σ1(3) 4
σ0(3) 2
ϕ(3) 2
Ω(3) 1
ω(3) 1
λ(3) 2 This is the Carmichael lambda function.
λ(3) –1 This is the Liouville lambda function.
ζ(3) 1.2020569031595942853997381615... (see A002117)
3! 6
Γ(3) 2

Factorization of some small integers in a quadratic integer ring adjoining the square roots of −3, 3

[3] is actually a subdomain because it is not integrally closed. Since 31mod4, it is not enough to consider algebraic integers of the form a+b3 (with a,b); we must also consider algebraic integers of the form a2+b32 (with ab odd).

Define ω=12+32. This number is of great importance not only because the ring of algebraic integers 𝒪(3) is [ω], but also because it is a complex cubic root of unity, meaning that ω3=1. And since its norm is 1, this means that ω is a unit of [ω], and so are ω2, ω and ω2. Thus, together with 1 and –1, this means that [ω] has six units, more than any other imaginary quadratic integer ring.

That's very little compared to [3], which has infinitely many units of the form (23)n. Both [ω] (also called the domain of Eisenstein integers) and [3] are unique factorization domains. The inertial primes in [ω] are the primes congruent to 2 modulo 3 (see A003627). If a prime p|(3p12+1), then it is inertial in [3] (see A003630).

In the table below, some factorizations in [ω] will also be expressed using 3; this does not constitute a distinct factorization since [ω] has unique factorization and 3=1+2ω. This is done for the sake of clarification, to facilitate comparison to other domains not usually expressed in terms of multiples of a unit that has both a real and an imaginary part.

n [ω] [3]
1 Unit
2 Prime (1)(13)(1+3)
3 (1)(1+2ω)2. Since (2ω)=1, this is tantamount to (1)(3)2. (3)2
4 2 2 (13)2(1+3)2
5 Prime
6 (1)2(1+2ω)2 (1)(13)(1+3)(3)2
7 (2+ω)(2+ω2). This may seem clearer expressed as (5232)(52+32). Prime
8 2 3. Note that (1+3)3 is not a distinct factorization. See 8 for a full explanation. (1)(13)3(1+3)3
9 (1+2ω)4 (3)4
10 2 × 5 (1)(13)(1+3)5
11 Prime (1)(123)(1+23)
12 (1)(1+2ω)222 (13)2(1+3)2(3)2
13 (3ω)(4+ω) (523)(5+23)
14 2(2+ω)(2+ω2) (1)(13)(1+3)7
15 (1)(1+2ω)25 (3)25
16 2 4 (13)4(1+3)4
17 Prime
18 (1)2(1+2ω)4 (1)(13)(1+3)(3)4
19 (5+2ω)(5+2ω2) Prime
20 2 2 × 5 (13)2(1+3)25

Factorization of 3 in some quadratic integer rings

As was mentioned above, 3 is a prime number in . But it is composite in some quadratic integer rings.

[i] Prime
[2] (12)(1+2) [2] Prime
[ω] (1)(1+2ω)2 [3] (3)2
[5] Irreducible [ϕ] Prime
[6] [6] (36)(3+6)
𝒪(7) Prime [7] (1)(27)(2+7)
[10] [10] Irreducible
𝒪(11) (12112)(12+112) [11] Prime
[13] Prime 𝒪(13) (1)(12132)(12+132)
[14] Irreducible [14] Prime
𝒪(15) [15] Irreducible
[17] 𝒪(17) Prime
𝒪(19) Prime [19] (1)(419)(4+19)

For [13] through 𝒪(163), 3 is irreducible and possibly prime. And beyond 𝒪(163), without reference to a specific ring, it can only be guaranteed to be irreducible, as there are no more imaginary quadratic rings with unique factorization after that.

Representation of 3 in various bases

In binary, 3 is represented as 11 and in ternary as 10 (as well as in balanced ternary). For all ordinary higher integer bases, 3 is 3, as well as in quater-imaginary base. In negabinary, 3 is 111, since (2)2+(2)1+(2)0=42+1=3.

In base 10, as well as in any other case in which the base is congruent to 1 modulo 3, there is a simple divisibility test for 3: if the digital root of a given number is 3 or any multiple thereof, then the number is also divisible by 3. In base 10, this means that all integers having a digital root of 3, 6 or 9 are multiples of 3 (see A008585).

See also

Some integers
1
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