Finding Almost Squares III

DOI10.1515/9783110208504.7MaRDI QIDQ3633800zbMATH OpenOpenAlexFDO

Authors Tsz Ho Chan

Publication date 23 June 2009

Published in Combinatorial Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0709.2723, http://www.westga.edu/~integers/vol9supp.html

zbMATH Keywords

Almost squareselementary methodsexponential sumsshort intervals

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Estimates on exponential sums (11L07) Distribution of integers with specified multiplicative constraints (11N25)

Abstract: An almost square of type 2 is an integer $n$ that can be factored in two different ways as $n=a_1{b}_1=a_2{b}_2$ with $a_1$, $a_2$, $b_1$, $b_{2}approxsqrtn$. 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 $[x^c,2x^c]$ with $0<c<1$.

Recommendations

• Finding almost squares. V
• scientific article; zbMATH DE number 7556192
• Finding almost squares
• Finding almost squares. II
• Finding almost squares. IV

Cited in

(4)

• Finding almost squares. IV
• Finding almost squares. V
• Finding almost squares. II
• Finding almost squares. VI.

This page was built for publication: Finding Almost Squares III

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