Punkyc7
- 415
- 0
Find the largest natural number m such that n^3 -n is divisible by m for n element N. Prove your assertion.
How exactly do you begin this
im thinking the largest m could possible be is n^3 -n, but I am not sure.
To be divisible we know that
mk=n^3-n for some k
How exactly do you begin this
im thinking the largest m could possible be is n^3 -n, but I am not sure.
To be divisible we know that
mk=n^3-n for some k
Last edited:
