Skip to main content
typos corrected
Source Link
John Kemeny
  • 17.1k
  • 3
  • 43
  • 67

I am an electrical engineer and trying to make a transition into machine learning. I I read in multiple articles that I have to learn data structures and algorithms, before this I have to learn about mathematical proofs. I I started studying it on my own using the material available on MIT's OCW, while I did grasp the concepts of induction and well ordering etc.. I've

I've been struggling with the exercises for a very long time and it's really frustrating. I I can easily deal with any type of proofs that I saw before (e.g. once I saw the proof of a recurrence question I became pretty good at proving them). My My problems start when I face an unusual question. I I feel like I am memorizing the proofs rather than learn how to prove. is

Is there any way ( oror any resources) that can improve my proving skills? In in a way that whenever I see an unusual question (like the checkers tiles and chess tiles type of questions) I don't have to stare at them for 2 hours before giving up.?

I am an electrical engineer and trying to make a transition into machine learning. I read in multiple articles that I have to learn data structures and algorithms, before this I have to learn about mathematical proofs. I started studying it on my own using the material available on MIT's OCW, while I did grasp the concepts of induction and well ordering etc.. I've been struggling with the exercises for a very long time and it's really frustrating. I can easily deal with any type of proofs that I saw before (e.g. once I saw the proof of a recurrence question I became pretty good at proving them). My problems start when I face an unusual question. I feel like I am memorizing the proofs rather than learn how to prove. is there any way ( or any resources) that can improve my proving skills? In a way that whenever I see an unusual question (like the checkers tiles and chess tiles type of questions) I don't have to stare at them for 2 hours before giving up.

I am an electrical engineer and trying to make a transition into machine learning. I read in multiple articles that I have to learn data structures and algorithms, before this I have to learn about mathematical proofs. I started studying it on my own using the material available on MIT's OCW, while I did grasp the concepts of induction and well ordering etc..

I've been struggling with the exercises for a very long time and it's really frustrating. I can easily deal with any type of proofs that I saw before (e.g. once I saw the proof of a recurrence question I became pretty good at proving them). My problems start when I face an unusual question. I feel like I am memorizing the proofs rather than learn how to prove.

Is there any way (or any resources) that can improve my proving skills in a way that whenever I see an unusual question (like the checkers tiles and chess tiles type of questions) I don't have to stare at them for 2 hours before giving up?

iI am an electrical engineer and trying to make a transition into machine learning. I read in multiple articles that iI have to learn data structures and algorithms, before this iI have to learn about mathematical proofs. I started studying it on my own using the material available on mit's ocwMIT's OCW, while iI did grasp the concepts of induction and well ordering etc.. I've been struggling with the exercises for a very long time and it's really frustrating. I can easily deal with any type of proofs that iI saw before ( ege.g. once iI saw the proof of a recurrence question iI became pretty good at proovingproving them). My problems start when iI face an unusual question. I feel like iI am memorizing the proofs rather than learn how to prove. is there any way ( or any resources) that can improve my proving skills  ? inIn a way that whenever iI see an unusual question ( likelike the checkers tiles and chess tiles type of questions) i dontI don't have to stare at them for 2 hours before giving up.

i am an electrical engineer and trying to make a transition into machine learning. I read in multiple articles that i have to learn data structures and algorithms, before this i have to learn about mathematical proofs. I started studying it on my own using the material available on mit's ocw, while i did grasp the concepts of induction and well ordering etc.. I've been struggling with the exercises for a very long time and it's really frustrating. I can easily deal with any type of proofs that i saw before ( eg. once i saw the proof of a recurrence question i became pretty good at prooving them). My problems start when i face an unusual question. I feel like i am memorizing the proofs rather than learn how to prove. is there any way ( or any resources) that can improve my proving skills  ? in a way that whenever i see an unusual question ( like the checkers tiles and chess tiles type of questions) i dont have to stare at them for 2 hours before giving up

I am an electrical engineer and trying to make a transition into machine learning. I read in multiple articles that I have to learn data structures and algorithms, before this I have to learn about mathematical proofs. I started studying it on my own using the material available on MIT's OCW, while I did grasp the concepts of induction and well ordering etc.. I've been struggling with the exercises for a very long time and it's really frustrating. I can easily deal with any type of proofs that I saw before (e.g. once I saw the proof of a recurrence question I became pretty good at proving them). My problems start when I face an unusual question. I feel like I am memorizing the proofs rather than learn how to prove. is there any way ( or any resources) that can improve my proving skills? In a way that whenever I see an unusual question (like the checkers tiles and chess tiles type of questions) I don't have to stare at them for 2 hours before giving up.

Became Hot Network Question
Source Link
user28324
  • 239
  • 1
  • 2
  • 5

Why are mathematical proofs so hard?

i am an electrical engineer and trying to make a transition into machine learning. I read in multiple articles that i have to learn data structures and algorithms, before this i have to learn about mathematical proofs. I started studying it on my own using the material available on mit's ocw, while i did grasp the concepts of induction and well ordering etc.. I've been struggling with the exercises for a very long time and it's really frustrating. I can easily deal with any type of proofs that i saw before ( eg. once i saw the proof of a recurrence question i became pretty good at prooving them). My problems start when i face an unusual question. I feel like i am memorizing the proofs rather than learn how to prove. is there any way ( or any resources) that can improve my proving skills ? in a way that whenever i see an unusual question ( like the checkers tiles and chess tiles type of questions) i dont have to stare at them for 2 hours before giving up