If you have 2 integers n and n+1, it is easy to show that they have no shared prime factors.(adsbygoogle = window.adsbygoogle || []).push({});

For example: the prime factors of 9 are (3,3), and the prime factors of 10 are (2,5).

Now if we consider 9 and 10 as a pair, we can collect all their prime factors (2,3,3,5) and find the maximum, which is 5. But where is the last occurrence of 5 as the maximum prime factor between two neighboring integers? Is there a known way to compute this, or to get a bound on it?

Essentially what I am looking for is a function that take a prime and tells me which integer n is part of the last pair of integers that have that prime as the greatest prime factor.

n_last = f(p)

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# A The Last Occurrence of any Greatest Prime Factor

Have something to add?

Draft saved
Draft deleted

**Physics Forums | Science Articles, Homework Help, Discussion**