# Subsets of an interval whose product is a power

P. Erdős, Janice L. Malouf, J. L. Selfridge, Esther Szekeres

Research output: Contribution to journalArticle

1 Citation (Scopus)

### Abstract

We form squares from the product of integers in a short interval [n, n + tn], where we include n in the product. If p is prime, p\n, and (p2) > n, we prove that p is the minimum tn. If no such prime exists, we prove tn ≤ √5n when n > 32. If n = p(2p - 1) and both p and 2p + 1 are primes, then tn = 3p > 3 √n/2. For n(n + u) a square > n2, we conjecture that a and b exist where n <a <b <n + u and nab is a square (except n = 8 and n = 392). Let g2(1) be minimal such that a square can be formed as the product of distinct integers from [n, g2(n)] so that no pair of consecutive integers is omitted. We prove that g2(2(n) ≤ 3n - 3, and list or conjecture the values of g2(n) for all n. We describe the generalization to kth powers and conjecture the values for large n.

Original language English 137-147 11 Discrete Mathematics 200 1-3 Published - Apr 6 1999

Interval
Subset
Integer
Short Intervals
Consecutive
Distinct
Generalization

### ASJC Scopus subject areas

• Discrete Mathematics and Combinatorics
• Theoretical Computer Science

### Cite this

Erdős, P., Malouf, J. L., Selfridge, J. L., & Szekeres, E. (1999). Subsets of an interval whose product is a power. Discrete Mathematics, 200(1-3), 137-147.

Subsets of an interval whose product is a power. / Erdős, P.; Malouf, Janice L.; Selfridge, J. L.; Szekeres, Esther.

In: Discrete Mathematics, Vol. 200, No. 1-3, 06.04.1999, p. 137-147.

Research output: Contribution to journalArticle

Erdős, P, Malouf, JL, Selfridge, JL & Szekeres, E 1999, 'Subsets of an interval whose product is a power', Discrete Mathematics, vol. 200, no. 1-3, pp. 137-147.
Erdős P, Malouf JL, Selfridge JL, Szekeres E. Subsets of an interval whose product is a power. Discrete Mathematics. 1999 Apr 6;200(1-3):137-147.
Erdős, P. ; Malouf, Janice L. ; Selfridge, J. L. ; Szekeres, Esther. / Subsets of an interval whose product is a power. In: Discrete Mathematics. 1999 ; Vol. 200, No. 1-3. pp. 137-147.
@article{9246ed3ed19442bdba6272f110ca4900,
title = "Subsets of an interval whose product is a power",
abstract = "We form squares from the product of integers in a short interval [n, n + tn], where we include n in the product. If p is prime, p\n, and (p2) > n, we prove that p is the minimum tn. If no such prime exists, we prove tn ≤ √5n when n > 32. If n = p(2p - 1) and both p and 2p + 1 are primes, then tn = 3p > 3 √n/2. For n(n + u) a square > n2, we conjecture that a and b exist where n 2(1) be minimal such that a square can be formed as the product of distinct integers from [n, g2(n)] so that no pair of consecutive integers is omitted. We prove that g2(2(n) ≤ 3n - 3, and list or conjecture the values of g2(n) for all n. We describe the generalization to kth powers and conjecture the values for large n.",
author = "P. Erdős and Malouf, {Janice L.} and Selfridge, {J. L.} and Esther Szekeres",
year = "1999",
month = "4",
day = "6",
language = "English",
volume = "200",
pages = "137--147",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Subsets of an interval whose product is a power

AU - Erdős, P.

AU - Malouf, Janice L.

AU - Selfridge, J. L.

AU - Szekeres, Esther

PY - 1999/4/6

Y1 - 1999/4/6

N2 - We form squares from the product of integers in a short interval [n, n + tn], where we include n in the product. If p is prime, p\n, and (p2) > n, we prove that p is the minimum tn. If no such prime exists, we prove tn ≤ √5n when n > 32. If n = p(2p - 1) and both p and 2p + 1 are primes, then tn = 3p > 3 √n/2. For n(n + u) a square > n2, we conjecture that a and b exist where n 2(1) be minimal such that a square can be formed as the product of distinct integers from [n, g2(n)] so that no pair of consecutive integers is omitted. We prove that g2(2(n) ≤ 3n - 3, and list or conjecture the values of g2(n) for all n. We describe the generalization to kth powers and conjecture the values for large n.

AB - We form squares from the product of integers in a short interval [n, n + tn], where we include n in the product. If p is prime, p\n, and (p2) > n, we prove that p is the minimum tn. If no such prime exists, we prove tn ≤ √5n when n > 32. If n = p(2p - 1) and both p and 2p + 1 are primes, then tn = 3p > 3 √n/2. For n(n + u) a square > n2, we conjecture that a and b exist where n 2(1) be minimal such that a square can be formed as the product of distinct integers from [n, g2(n)] so that no pair of consecutive integers is omitted. We prove that g2(2(n) ≤ 3n - 3, and list or conjecture the values of g2(n) for all n. We describe the generalization to kth powers and conjecture the values for large n.

UR - http://www.scopus.com/inward/record.url?scp=0347040224&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0347040224&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0347040224

VL - 200

SP - 137

EP - 147

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -