using Euclid division lemma prove that for any positive integer n, n^3-n is divisible by 6
Answers
Answered by
1
We can take n,=any integer and can prove it
Anonymous:
Brainly is the name for procedure. I know u can't edit it now but for next u should be aware for doing this only. U've to show the procedure.
Similar questions