Prove Maasei Hoshev: Engineering Student Minor in Math Needs Help

  • Thread starter Thread starter JoshC
  • Start date Start date
AI Thread Summary
An engineering student minoring in math seeks assistance with a proof related to Proposition 32 of Maasei Hoshev, specifically involving the summation of sequences. The student is struggling with induction proofs while studying from "A History of Mathematics" by Victor Katz. After requesting help, the student ultimately decides to drop the course. The discussion highlights the challenges faced by students transitioning to more advanced mathematical concepts. The need for clear guidance in understanding induction proofs is emphasized.
JoshC
Messages
2
Reaction score
0
I am taking a course in the history of modern math. Note, I am an engineering student minoring in math. Therefore, I am not that up to speed on induction proofs. I have been working on a problem in my book (A History of Mathematics by Victor Katz), and really don't know how to procede. Any help would be greatly appreciated.
Problem:
------------------------------
Prove Proposition 32 of the Maasei hoshev (by Levi Ben Gerson):

1+(1+2)+(1+2+3)+...+(1+2+...+n)

={1^2+3^2+...+n^2 n odd;
{2^2+4^2+...+n^2 n even
------------------------------
Thank you for your assistance
 
Physics news on Phys.org
Nevermind. I dropped the course. Thanks for the help.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top