Quote:
Originally Posted by Yak
I had to look it up to refresh my memory from an earlier post. See #15 here for the question and symbols. more discrete math help
Step 1 is basically writing the text "is divisible by 2 without remainder" in congruent format. Step 2 is solving that: There must be some integer (k) when multiplied by 2 that equals n^3 + 2n.
|
I understand Yak. I've encountered Mod math (slightly) for over 40 years. But I could not (and still cannot) make the step without greater clarity and understanding than I currently possess.
It's not a subset of math that I learned and I've been prettied drugged (finally off those) and infirmed for almost 2 years.
Nice to see someone provide a general instead of a specific disproof.