Finding Almost Squares III
Abstract
An almost square of type 2 is an integer n that can be factored in two different ways as n = a1 b1 = a2 b2 with a1, a2, b1, b2 ≈ n. In this paper, we shall improve upon previous result on short intervals containing an almost square of type 2. This leads to an inquiry of finding a short interval around x that contains an integer divisible by some integer in [xc, 2 xc] with 0 < c < 1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.