On the gaps in multiplicatively closed sets generated by at most two elements

Density, gaps, topology (11B05) Arithmetic progressions (11B25) Distribution of integers with specified multiplicative constraints (11N25) Distribution of integers in special residue classes (11N69)

Abstract: We prove in Theorem

2.2

that the multiplicatively closed subset generated by at most two elements in the set of natural numbers

m a t h b b N

has arbitrarily large gaps by explicitly constructing large integer intervals with known prime factorization for the end points, which do not contain any element from the multiplicatively closed set apart from the end points, which belong to the multiplicatively closed set. An Example

4.6

is also illustrated. We also give a criterion in Theorems

7.8, 7.12

by using a geometric correspondence between maximal singly generated multiplicatively closed sets and points of the space

m a t h b b {P F}_{m a t h b b Q g e q 0}^{i n f t y}

(refer to Theorem

7.5

) as to when a finitely generated multiplicatively closed set gives rise to a doubly multiplicatively closed line (refer to Definition

7.4

). We answer a similar Question

5.1

partially about gaps in a multiply-generated multiplicative closed set, when it is contained in a doubly multiplicative closed set using Theorem

7.8

and Theorem

7.17

. In the appendix Section

8

we discuss another constructive proof (refer to Theorem

8.6

) for arbitrarily large gap intervals, where the prime factorization is not known for the right end-point unlike the constructive proof of the main result of the article in the case of multiplicatively closed set

p_{1}^{i} p_{2}^{j} m i d i, j i n m a t h b b N c u p 0

with

p_{1} < p_{2}, L o g_{p_{1}} (p_{2})

irrational for which the prime factorization is known for both the end-points of the gap interval via the stabilization sequence of the irrational

f r a c 1 L o g_{p_{1}} (p_{2})

.

Review text

Let \(p_1\) and \(p_2, 1<p_1 <p_2,\) be natural numbers and \(\alpha=\log p_ 1/\log p_ 2\) be irrational number. The stabilization sequence of an irrational is defined. The following theorem is the main result of the article. Theorem. Let \(p_1,p_2\) be two positive integers, which are not log-rational to each other with \(p_1< p_2 \). Let \(\alpha=\log (p_1)/\log(p_2) \) be the associated irrational less than one. Let \(\{s_i: i \in \mathbb{N} \}\) be the stabilization sequence of \(\alpha\). Let \(t_i=\lfloor s_i \alpha \rfloor \). Then (1) The set of integers \[ \Big\{p_2^{t_{i+1}-1},p_2^{t_{i+1}-1}+1,\dots,p_1^{s_i}p_2^{t_{i+1}-t_i-1} \Big\} \] contains no element in the multiplicatively closed set generated by the positive integers \( p_1, p_2\) apart from the end values. (2) The limit of the gaps \( (p_1^{s_1}p_2^{t_{i+1}-t_i-1}-p_2^{t_{i+1}-1})\) tends to infinity as \(i \to \infty \). An example illustrating the ideas used to prove theorem given.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: On the gaps in multiplicatively closed sets generated by at most two elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422802)