Article
Licensed
Unlicensed
Requires Authentication
Finding Almost Squares V
Published/Copyright:
November 5, 2010
Abstract
An almost square of type 2 is an integer n that can be factored in two different ways as n = a1b1 = a2b2 with a1, a2, b1,
. In this paper, we continue the study of almost squares of type 2 in short intervals and improve the 1/2 upper bound. We also draw connections with almost squares of type 1.
Keywords.: Almost squares; elementary method
Received: 2010-01-08
Accepted: 2010-05-14
Published Online: 2010-11-05
Published in Print: 2010-November
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Some Divisibility Properties of Binomial Coefficients and the Converse of Wolstenholme's Theorem
- On the Iteration of a Function Related to Euler's φ-Function
- An Explicit Evaluation of the Gosper Sum
- On the Frobenius Problem for {ak, ak + 1, ak + a, . . . , ak + ak−1}
- Generalizing the Combinatorics of Binomial Coefficients via -Nomials
- Finding Almost Squares V
- On Relatively Prime Subsets and Supersets
- Reformed Permutations in Mousetrap and Its Generalizations
- On Ternary Inclusion-Exclusion Polynomials
- Sums and Products of Distinct Sets and Distinct Elements in ℂ
Articles in the same Issue
- Some Divisibility Properties of Binomial Coefficients and the Converse of Wolstenholme's Theorem
- On the Iteration of a Function Related to Euler's φ-Function
- An Explicit Evaluation of the Gosper Sum
- On the Frobenius Problem for {ak, ak + 1, ak + a, . . . , ak + ak−1}
- Generalizing the Combinatorics of Binomial Coefficients via -Nomials
- Finding Almost Squares V
- On Relatively Prime Subsets and Supersets
- Reformed Permutations in Mousetrap and Its Generalizations
- On Ternary Inclusion-Exclusion Polynomials
- Sums and Products of Distinct Sets and Distinct Elements in ℂ