Waste less time on Facebook — follow Brilliant.

So succinct. It almost seems too easy

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


has at least two distinct prime factors.

Note by Sharky Kesa
1 year, 1 month ago

No vote yet
1 vote


Sort by:

Top Newest

Hint: The polynomial can be factored.

See answer here. Pi Han Goh · 1 year, 1 month ago

Log in to reply

@Pi Han Goh The factoring is really easy

\[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 · 1 year, 1 month ago

Log in to reply

@Sualeh Asif If you want, you can post the final part of the proof as a DM to me on Slack. Sharky Kesa · 1 year, 1 month ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...