For all positive integers \(n>1\), prove that

\[n^5+n-1\]

has at least two distinct prime factors.

For all positive integers \(n>1\), prove that

\[n^5+n-1\]

has at least two distinct prime factors.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestHint: The polynomial can be factored.See answer here. – Pi Han Goh · 10 months, 3 weeks ago

Log in to reply

\[n^5+n-1=(n^2-n+1)(n^3+n^2-1)\] (This could be manually done through comparing coefficients.)

The next thing to note is that they have to be both perfect powers to avoid having two distinct factors. We can easily check from here that they can't be perfect powers and thus they must have atleast two distinct factors.

I can post the proof on request but for now it is left as an excercise to the reader.

@Sharky Kesa now onto your functional equation. – Sualeh Asif · 10 months, 3 weeks ago

Log in to reply

– Sharky Kesa · 10 months, 3 weeks ago

If you want, you can post the final part of the proof as a DM to me on Slack.Log in to reply