A324155 Greatest number N such that the number of primes (<= N) <= the number of base-n-zerofree numbers (<= N).

4, 498, 1139556, 33182655688

Offset: 2

Author

Hieronymus Fischer, Feb 22 2019

Keywords

• nonn
• base
• more
• hard

Comments

Further terms:

14670238462896430 < a(6) < 14670469667698570;

1.88655928870547380*10^22 < a(7) < 1.8865698003644555*10^22;

1.5845871199286*10^29 < a(8) < 1.5845909238805*10^29;

3.7023896360635*10^36 < a(9) < 3.7023941021398*10^36;

1.0075615552422*10^45 < a(10) < 1.0075622026833*10^45;

1.3480809599483*10^53 < a(11) < 1.3480814844466*10^53;

3.9618565460983*10^62 < a(12) < 3.9618574860993*10^62;

7.8648507615953*10^71 < a(13) < 7.864851991241*10^71;

4.7945106758325*10^81 < a(14) < 4.7945111864185*10^81;

1.0953005932169*10^92 < a(15) < 1.0953006746693*10^92;

8.3149001821943*10^148 < a(20) < 8.3149003278317*10^148.

All terms are even, since a(n) + 1 is always an odd prime number.

The numbers a(n) + 1 and a(n) + 2 are zero containing numbers (in base n).

The numbers between a(n) and p := min( k > a(n) + 1 | k is prime) are zero containing numbers, i.e., a(n) + j is a zero containing number for 0 < j < p - a(n).

For numbers m > a(10) = 1.00756...*10^45, we have pi(m) > A324161(m) [= number of zerofree numbers <= m]; in general, the ratio A324161(m) to pi(m) is O(log(n)*n^d), where d := 1 - 1/(1 - log_10(9)) = -0.0457..., and thus tends to 0 for m --> infinity. Consequently, the share of primes <= m which have no '0'-digit become significantly smaller as m rises beyond that bound a(10). For m = 10^100, the share is not greater than 0.000688, for m = 10^1000, the share cannot exceed 4.52757*10^(-43). Conversely, the share of primes which contain a '0'-digit tends to 1 as m grows to infinity (cf. A011540).

Conjecture: a(n) can be represented in the form a(n) = k*n^m + j, where j < (n^(m+1)-1)/(n-1) - n^m, and m > 1, 0 < k < n.

Examples

			a(2) = 4, since pi(1) = 0 <= 1 = numOfZerofreeNum_2(1), pi(2) = 1 <= 1 = numOfZerofreeNum_2(2), pi(3) = 2 <= 2 = numOfZerofreeNum_2(3), pi(4) = 2 <= 2 = numOfZerofreeNum_2(3), and pi(m) > numOfZerofreeNum_2(m) for m > 4, where numOfZerofreeNum_2(m) is the number of base-2-zerofree numbers <= m and pi(m) = number of primes <= m. The first base-2-zerofree numbers are 1 = 1_2, 3 = 11_2, 7 = 111_2, ...
		

Crossrefs

Cf. A011540, A052382, A324154, A324160, A324161, A325164, A325165.

Formula

a(n) = max(k | pi(k) <= numOfZerofreeNum_n(k)), where numOfZerofreeNum_n(k) is the number of base-n zerofree numbers <= k ((see A324161 for general formulas regarding numOfZerofreeNum _n(k))).

a(n) >= A324154(n) + 1.

Estimate of the n-th term (n > 2):

a(n) < e*(p*log(p*log((e/(e-1))*p*log(p))))^(1/(1-d)),

a(n) > e^1.1*(q*log(q*log(q*log(q))))^(1/(1-d)),

where p := (n-1)/((n-2)*(1-d(n)))*e^(-(1-d)), q := (n-1)^d/((n-2)*(1-d(n)))*e^(-1.1*(1-d)), d := d(n) := log(n-1)/log(n).

Also, but more imprecise:

a(n) < e*((e/(e-1))*p*log(p))^(1/(1-d)),

a(n) < e*((e/(e-1))*p*log(p))^((n-1/2)*log(n)),

a(n) < n*((e/(e-1))*n*log(n)*log(n*log(n)))^((n-1/2)*log(n)), n > 3.

Asymptotic behavior:

a(n) = O(n*((e/(e-1))*n*log(n)*log(n*log(n)))^(n*log(n))).

a(n) = O(n*((e+1)/(e-1)*n*log(n)^2)^(n*log(n))).