Summary: What are the non-trivial solutions to the question: Find two sequences of consecutive integers whose products are the same. There are four known solutions, all of thich consist of small integers, and there is no clear pattern connecting them. Given the small number of known solutions and the lack of any clear pattern among them, I suspect this question contains more number theory than at first appears.

The "Puzzle Corner" of MIT News for March/April 2020 gives a "speed" problem by Sorab Vatcha: "Find seven consecutive integers whose product equals the product of four consecutive integers." The obvious "speed" solution is: 0, 1, 2, 3, 4, 5, and 6; and 0, 1, 2, and 3.

This leads to the general question of whether there are any "nontrivial" solutions to find two distinct sequences of integers whose products are the same. The obvious trivial solutions involve (1) sequences containing 0, (2) replacing all of the integers in a sequence with their negatives, (3) adding or deleting values 1 or -1, and (4) one sequence has length 1 (and hence contains one integer that is the product of the integers in the other sequence). These criteria reduce the problem to finding two distinct sequences of integers $\ge 2$ of length $\ge 2$ whose products are the same.

There is a less obvious criterion of non-triviality: (5) The two sequences must not overlap. If the sequences overlap, then the overlapping part can be deleted from both of them, yielding a soltion with shorter sequences. This interacts with the prohibition (4) against sequences of length 1: Removing the overlapped part may reduce one sequence to length 1, and the shorter solution may be trivial also. And indeed, there is a large family of solutions constructed this way: If the product of $a \cdots b$ is $P$, then $a \cdots (P-1) = (b+1) \cdots P$.

There are non-trivial solutions. The one with the smallest product is $5 \cdot 6 \cdot 7 = 14 \cdot 15 = 210$. Is there an enumeration of all solutions?

The known non-trivial solutions are: $5 \cdots 7 = 14 \cdot 15 = 210$, $2 \cdots 6 = 8 \cdots 10 = 720$, $19 \cdots 22 = 55 \cdots 57 = 175560$, and $8 \cdots 14 = 63 \cdots 66 = 17297280$.

I have run a number of computer searches that have not revealed any further solutions: (a) all sequences with products less than $10^{30}$, (b) sequences with numbers less than 10,000,000 and length less than 10, (c) sequences with numbers less than 1,000,000 and length less than 100, (d) sequences with numbers less than 100,000 and length less than 1,000, and (e) sequences with numbers less than 10,000 and length less than 10,000.

See also https://math.stackexchange.com/questions/991728/equal-products-of-consecutive-integers/ and https://math.stackexchange.com/questions/3346618/non-trivial-solutions-to-equal-products-of-consecutive-integers.

  • 5
    $\begingroup$ It appears no further solutions are known: oeis.org/A163263 $\endgroup$ – Mikhail Tikhomirov Mar 27 at 3:40
  • $\begingroup$ Note the literature references in the above OEIS entry. $\endgroup$ – Dale Mar 28 at 15:51

The observation is made in many places (see the linked questions and OEIS sequence) that the sequence with larger numbers cannot contain a prime. It should also be noted that sufficiently large solutions cannot contain both three times a prime and two times a different prime. This can be extended using information on maximal gaps to limit how many large primes can appear as factors in a large sequence. An interesting variant is when a product of n consecutive positive integers divides another sequence of n consecutive positive integers. Except for n factorial dividing every such, or a sequence dividing itself, I am not aware of examples beyond the ones listed above and trivial modifications. Listing such pairs of n tuples would go far toward solving this problem.

Gerhard "Unless Erdos Already Did It" Paseman, 2020.03.26.

| cite | improve this answer | |
  • $\begingroup$ "Unless Erdos Already Did It" - you made my day! 😁 $\endgroup$ – Wolfgang Mar 27 at 14:12

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.