Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Geometry of the Multiplicatively Closed Sets generated by at most Two Elements with arbitrarily Large Gaps, a constructive method

Published 12 Aug 2016 in math.NT | (1608.03721v4)

Abstract: We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{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 $\mathbb{PF}{\infty}_{\mathbb{Q}\geq 0}$ (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_1ip_2j\mid i,j\in \mathbb{N}\cup{0}}$ with ${p_1<p_2,Log_{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 $\frac {1}{Log_{p_1}(p_2)}$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.