Epp is good. That was the text used in my discrete mathematics class. I thought It was a good introductory book to the wide-ranging topic of discrete mathematics. The professor teaching the class was a student of Susanna Epp before she retired (I believe she was his grad studies advisor). The book covers a wide range of topics but the one thing really caught my attention was when, fifty or so pages into the text, she wrote: "Don't be stingy with paper." I stopped right then and looked at my work sheet, and sure enough, all the writing, calculations, notes, whatever, were crowded, small and really hard to understand with the poor organization that being stingy with paper brings on. Taking that advice, notes and calculations were easier to read and a lot more organized. The class was still a lot of work, but at least I didn't have to fight to understand what I'd written.
Perfect timing, as I am currently studying for my discrete Maths exam. What I realized is that the theory usually is not to complicated, especially in graph theory, yet applying it causes most problems. So I would suggest focusing a lot on practice problems, as it really helps to understand the underlying Concepts.
One book that I got recently is “Concrete Mathematics” by Knuth, Graham, and Patashnik. Knuth is a great writer and I also recommend getting his “The Art of Computer Programming” series of books for learning data structures and algorithms. These books are very well written and have very creative problems which can be quite difficult. It’s not the best book for beginners, but I think it’s good to have a broad selection of books with different styles. Rosen is good if you want a comprehensive treatment with a lot of problems, but it’s not as “to the point” as Knuth and is less enjoyable to read IMO. I also recommend getting proof writing books like the ones by Vellman and Cummings. They cover many of the same topics and are a great supplement to any discrete math text.
"If you think you're a really good programmer... read (Knuth's) Art of Computer Programming... You should definitely send me a résumé if you can read the whole thing," -- Bill Gates
You inspire me Mohammed. Im a 30 year old whose previous experience has all been in sales and now I'm considering making a career change into networking and telecommunications. I've already got my CCNA and the next step I reckon is going back to college and doing a masters in telecommunications. Never let age be a barrier.
I'm currently working with Susanna Epp's "Discrete Mathematics with Applications" and I can highly recommend it! It might also serve as a little helper in English since she starts out with using English sentences and bridges the gap between math and linguistics by looking at them from a logical perspective!
I recently finished a Data Structures and Algorithms course with the Open University. During that time I amassed a small collection of discrete maths and problem solving books which proved invaluable to the course. Whenever I was stuck on the course materials I was able to find a relevant chapter in at least on of the books that worded the same subjects in a way that I understood. The most useful book throughout that course was Grokking Algorithms so I 100% recommend that for anyone struggling with problem solving and algorithms.
I don't get to watch all of your videos, but when I do, I am reminded to think about unfamiliar topics, ask questions, show kindness and grace to others, and to not shy away from discipline when learning something I do not understand. I bought a 5th edition of Discrete Mathematics with Applications, and I have been slowly plowing through it. I do fall off for bits of time due to work and life, but I always come back. Thanks again.
For programming I would recommend studying *combinatorics* and *graph theory* as well along with *discrete mathematics.* I would implore to start with discrete math first and get good with *set theory* and *basic logic* before diving into other areas. Obviously some *algebra* and even *calculus* can be helpful just for gaining the math maturity to help solve math and logic related problems. Another very important and useful thing to study is *Boolean algebra* and the logic that goes into it. *Truth tables, postulates, theorems, K-maps, minterms/maxterms, and combinational logic* can make it easier to simplify logical problems down into mathematical functions that can be solved. Of course also understand how computers store data, communicate, and perform tasks. Being able to *represent data in terms of strings of binary sequences* and how that translates to characters in a machine.
The topic I struggled the most is probabilities and I hope this video helps for my next semester. I can't thank you enough for your videos, your book recommendations made me increase my grades from 60 to near 100 ❤
I really like the idea of accountants learning programming! My account friend was still way too dependent on spreadsheets to do stuff that could be done easily in code. I wish you the best in your endevors!
I've studied discerete math in my college and it's really a cool subject so if one wants to self learn the subject there's a book called discrete mathematics by kenneth rosen it consists of concepts which are explained crystal clear and tons of exercises.
It almost felt like you were talking to me directly lol. This is the weirdest coincidence I have ever witnessed. Just like the man in the email I'm also named Mohamed, I'm from Egypt, and I'm interesting in doing a career shift towards software development, and just this month I picked up a book about discrete math from the Sorcerer's video about learning math start to finish.
Hello, Myself from Pakistan. And I am BS Information Technology. Maybe I could guide a bit here. Actually from an Information tech/computer science perspective, you have to precisely understand the importance and amount of mathematics that you need because it varies from task to task. If Questioner wants to work in development side, then Mathematics is not going to be a problem, I mean shouldn't be one. If you wanna work in Data structure and Algorithm side, there would be only basic mathematical logic, set theory and maybe basic graph theory to just start it and you study further as you move on. If you want to go into network security side then you wanna learn number theory for cryptography and stuff. If you want to work in Data Analysis/Science side, you wanna learn statistics,probability,calculus,linear algebra to get a start because this side is really hard on mathematics. So it really depends what you want to do. Don't just get lost in the deep dark forest of mathematics, just stay focused, prioritize you stuff, divide and conquer you tasks, and best of luck. ♥ Welcome to Programming world.
so someone who wants to go into Data Science/Analysis has to learn pretty much everything of math right? And can u tell how much of calculus is actually needed for this role?
@@rahulpaul1833 Rahul that's a very good question, actually I am just preparing for the role right now. According to my knowledge and some of which I have covered it is as follows: Univariate & Multivariate Calculus, Linear Algebra, Statistics, Probability Theory, Optimization Theory, Information Theory, Fourier Transform, Differential Equations, Time series analysis, bayesian statistics, graph theory, operations research, and a few discrete math topics. Some of them have higher priority some of them has lower. For junior data science role, first three of these would suffice. But If someone would like to go into research field or more senior level roles, then ofcourse all would be required. As practitioner, Surface of these branches would suffice. But as researcher you might have to go much deeper.
If you are self-studying, I recommend checking out books on Set Theory and Discrete Mathematics (Schaum Series) by Seymour Lipschutz. I am self-studying proofs these days for fun, and I have found these books very easy to understand.
Hey man, just wanted to say thank you for recommending Chris McMullen's workbook on Calculus Fundamentals, I've been working through it and the examples are super instructive and easy to digest, and the exercises are the perfect difficulty too for an introduction to certain ideas. I've been working on my Maths skills to prep for my course in uni, and so far I've covered limits and continuity as well as a bit of sequences and series, and I would love to hear some recommendations for books geared towards those topics. Many thanks again!
Hi! I am from Bulgaria. when you made the video about the spanish book I bought it. I looked at it and saw that the problems are easy compared to the algebra workbook that was used in our high school 30-40 years ago. I could recommend you one of the some bulgarian books like : 1"сборник от задачи по алгебра за 7-10 клас" 2."ръководство за решаване на задачи по математика част 1"
I went through the Epp book (on recommendation of this channel). It's a good book, but I still had some trouble with the proofs, especially when it got on to proof by strong mathematical induction. I would recommend picking up the Proofs book by Cummings as a suppliment. Any time you get confused about a concept in proofs, look it up in there.
Super suggested book: A Logical Approach to Discrete Math - David Gries, Fred B. Schneider It starts from scratch using a more...computer science approach, but it's amazing!
I just finished taking a discrete math class based on Epp's book. I would give it a 3/5. Good but not great. Part of what bugged me a bit was not the book itself, but kind of how these classes are structured. You're given a compendium of disparate topics and an overview of each. The book jumps around in subject matter and difficulty quite a bit. Some stuff is discussed pretty in depth and gets very confusing and abstract, even though it seems to be totally disconnected from the rest. The Boolean Algebra and Partial Order Relations were examples of this. They were discussed superficially, but in a complicated way at the same time. Meanwhile, some very basic explanations are repeated over and over, to the point where it seems like they were trying to fill up space. However, some of the explanations of more common topics in set and number theory were good, even better than other textbooks I've seen. I personally would like it better if I could take a set theory class, a probability class, a graph theory, and a proof writing class, instead of grouping everything in Discrete Math. I think those 4 would cover the material in a more organized way, and I'll probably have to take them anyway in the end. I realize this is not always possible though.
I have the math skills of an amoeba. Unless they're excellent at math...then not so much. But here I am at 7 am watching your fascinating video with a cup of coffee. I love passionate people. Honestly it's all Greek to me but I love this channel.
Discrete math is my main area of math that I know, I find it almost improbable to memorise compared to other mathematics so I try and not beat myself up too much about it. I learned it mainly from building games and now my own game engine currently, university (AI degree specifically) and some courses on Udemy I think. Set theory is 'extremely' easy to learn out of all the things I learned this was probably the easiest to remember. The problem I find with a lot of computer science like degrees though that seem to teach this, you probably would only use about 20% of what you learn in an actual job.
"Discrete Mathematics with Graph Theory" by Goodaire is a very intro level discrete text. I'd say roughly high school level. the older editions are pretty inexpensive.
Computer Science is basically a disguised Math degree, much like Electrical Engineering is a disguised Physics degree. The more math you know the better you'll be at programming, since you'll often design algorithms. Complexity Analysis & Big O notion are basically Math proofs you'll learn in Discrete Multi-Variable Calculus or Linear Algebra. If you get into programming for AI it uses Probability and is very Math intensive. I would recommend a CompSci major with a Math/Statistics minor, or vice versa. I used the 3rd edition of Discrete Math by Epp and she has a chart for Core sections, Optional Math sections, and CompSci Apps sections. I actually failed Data Structures when I was an undergraduate CompSci major, I then changed my major to Math. After working as a Statistician for 4 years, I went to grad school and Data Structures was a breeze. My area of research was in IoT, Chip design, and Architecture in Graduate School. I currently work with Computer Engineers even though by degrees are in Math & CompSci. We underestimate how useful a Math degree is, even though Physics, Engineering, and Computer Science is based from it. Hope this is helpful.
The best way would be to look into "graph theory". I think that's also discrete math. But it looks at solving problems displayed as graphs. It's the most interesting and most versatile math + algorithmic branch in IT.
Well, at least now I don’t feel like such an idiot, getting stuck working through the first chapter of Rosen. That book is over 2000 pages. So much to get through.
I really enjoyed Discrete Mathematics: An Open Introduction 3rd Edition by Oscar Levin. He noted specifically in the preface that it was not written to be geared towards computer science, but since I do not study CS I have no idea what the difference would’ve been if it was. It’s worth noting though. Felt like a good mix of straight explanations and working through the logic with examples to me. I admittedly still have a couple chapters unread but don’t really need them yet. I only bring this book up because it was super cheap on Amazon and I know these things add up fast
I've found that discreet math books differ in the amount of attention they pay to topics directed towards computer applications. Some cover languages. Some do not. IMO, the former are more applicable to computer science. You might look up the introductory CS courses offered at your local university to see what texts they use.
As someone who has a lot of books and a good amount of textbooks, I have to imagine when you move it is a NIGHTMARE hauling all those things around 🤣. It's the main hesitation I have whenever I want a new one.
A difficulty with discrete math is that it is not a unified single subject, but rather it is a collection, a mixture, a potpourri of miscellany, often none of which are explained in sufficient depth or detail to be understood well. So, to achieve understanding a person must delve deeper into particular subjects such as graph theory, combinatorics, or cryptography. The abbreviated, terse, and incomplete subject and problem descriptions must be filled out with more substantive, and often easier-to-understand materials. Your autodidactic efforts will be challenged, and your range of required reading expanded and enhanced.
Thank you for this advice for him (maybe for several of us). I'd like to know what subjetcs are the antecedents for Discrete Maths. Only calculus and differential equations are okay, or do you need to know more before trying to learn Discrete Maths?
I think that in order to become JAVA developer you need only subset of discrete mathematics. You will save a lot of time by mastering, practicing essential topics with IDE and JVM. Bitwise operations, boolean logic, etc. And skip in depth diving into discrete math. (IMHO)
Hi, I am from India, my English is very weak, I do not understand any book of English medium math, due to which my math is also becoming weak, the reason for this is that all the good books of math are all in English, due to which I am not able to solve the math, which is very sad for me, please tell me a real solution for this. I will be very grateful to you.
I'm a programmer for a Wall Street firm for the past 15 yers and there is almost no math involved. If there is math there are libraries that do all the math for you. Maybe he should consider data science not programming. Front end programmer -- no math. Back end programmer -- no math.
muhammad, just so u know: u dont need to " master " discrete math to be good at programming or to understand data structures and algorithms. Beyond some intermmidiate topics it would be rudandant to continue unless u r interested in hard core theoretical computer science. In a common CS b.s.c they will teach u: linear algebra, probability, discrete math, graph theory, algorithms, data structures, logic and sets ... I would advise to pass the brginner level in each of those rather than " mastering " a single one.' It would be more interesting, less frastrating and will make u a well rounded thinker.
Epp is good. That was the text used in my discrete mathematics class. I thought It was a good introductory book to the wide-ranging topic of discrete mathematics. The professor teaching the class was a student of Susanna Epp before she retired (I believe she was his grad studies advisor). The book covers a wide range of topics but the one thing really caught my attention was when, fifty or so pages into the text, she wrote: "Don't be stingy with paper." I stopped right then and looked at my work sheet, and sure enough, all the writing, calculations, notes, whatever, were crowded, small and really hard to understand with the poor organization that being stingy with paper brings on. Taking that advice, notes and calculations were easier to read and a lot more organized. The class was still a lot of work, but at least I didn't have to fight to understand what I'd written.
Perfect timing, as I am currently studying for my discrete Maths exam. What I realized is that the theory usually is not to complicated, especially in graph theory, yet applying it causes most problems. So I would suggest focusing a lot on practice problems, as it really helps to understand the underlying Concepts.
But the trouble guive not discuss and threat the expensive medicine!The medicine is need mathmatics teory!
Discrete math is fascinating to learn about. Thanks for making a video on this topic.
One book that I got recently is “Concrete Mathematics” by Knuth, Graham, and Patashnik. Knuth is a great writer and I also recommend getting his “The Art of Computer Programming” series of books for learning data structures and algorithms. These books are very well written and have very creative problems which can be quite difficult. It’s not the best book for beginners, but I think it’s good to have a broad selection of books with different styles. Rosen is good if you want a comprehensive treatment with a lot of problems, but it’s not as “to the point” as Knuth and is less enjoyable to read IMO. I also recommend getting proof writing books like the ones by Vellman and Cummings. They cover many of the same topics and are a great supplement to any discrete math text.
"If you think you're a really good programmer... read (Knuth's) Art of Computer Programming... You should definitely send me a résumé if you can read the whole thing," -- Bill Gates
You inspire me Mohammed. Im a 30 year old whose previous experience has all been in sales and now I'm considering making a career change into networking and telecommunications. I've already got my CCNA and the next step I reckon is going back to college and doing a masters in telecommunications. Never let age be a barrier.
♥ And you both inspired me
I'm currently working with Susanna Epp's "Discrete Mathematics with Applications" and I can highly recommend it! It might also serve as a little helper in English since she starts out with using English sentences and bridges the gap between math and linguistics by looking at them from a logical perspective!
I recently finished a Data Structures and Algorithms course with the Open University. During that time I amassed a small collection of discrete maths and problem solving books which proved invaluable to the course. Whenever I was stuck on the course materials I was able to find a relevant chapter in at least on of the books that worded the same subjects in a way that I understood. The most useful book throughout that course was Grokking Algorithms so I 100% recommend that for anyone struggling with problem solving and algorithms.
Rosen is pretty good. Quite verbose, so focus only on important topics
I don't get to watch all of your videos, but when I do, I am reminded to think about unfamiliar topics, ask questions, show kindness and grace to others, and to not shy away from discipline when learning something I do not understand. I bought a 5th edition of Discrete Mathematics with Applications, and I have been slowly plowing through it. I do fall off for bits of time due to work and life, but I always come back. Thanks again.
For programming I would recommend studying *combinatorics* and *graph theory* as well along with *discrete mathematics.* I would implore to start with discrete math first and get good with *set theory* and *basic logic* before diving into other areas. Obviously some *algebra* and even *calculus* can be helpful just for gaining the math maturity to help solve math and logic related problems. Another very important and useful thing to study is *Boolean algebra* and the logic that goes into it. *Truth tables, postulates, theorems, K-maps, minterms/maxterms, and combinational logic* can make it easier to simplify logical problems down into mathematical functions that can be solved. Of course also understand how computers store data, communicate, and perform tasks. Being able to *represent data in terms of strings of binary sequences* and how that translates to characters in a machine.
A lot of the Boolean algebra stuff is taught in a digital logic design course.
ooh thanks!
I am going to learn graph theory I love discrete math ❤❤❤❤❤
I’m taking discrete maths in the fall so this is super helpful!
The topic I struggled the most is probabilities and I hope this video helps for my next semester. I can't thank you enough for your videos, your book recommendations made me increase my grades from 60 to near 100 ❤
I really like the idea of accountants learning programming! My account friend was still way too dependent on spreadsheets to do stuff that could be done easily in code.
I wish you the best in your endevors!
I've studied discerete math in my college and it's really a cool subject so if one wants to self learn the subject there's a book called discrete mathematics by kenneth rosen it consists of concepts which are explained crystal clear and tons of exercises.
It almost felt like you were talking to me directly lol. This is the weirdest coincidence I have ever witnessed. Just like the man in the email I'm also named Mohamed, I'm from Egypt, and I'm interesting in doing a career shift towards software development, and just this month I picked up a book about discrete math from the Sorcerer's video about learning math start to finish.
❤
Thanks man. We appreciate your efforts.
Hello, Myself from Pakistan. And I am BS Information Technology. Maybe I could guide a bit here. Actually from an Information tech/computer science perspective, you have to precisely understand the importance and amount of mathematics that you need because it varies from task to task. If Questioner wants to work in development side, then Mathematics is not going to be a problem, I mean shouldn't be one. If you wanna work in Data structure and Algorithm side, there would be only basic mathematical logic, set theory and maybe basic graph theory to just start it and you study further as you move on. If you want to go into network security side then you wanna learn number theory for cryptography and stuff. If you want to work in Data Analysis/Science side, you wanna learn statistics,probability,calculus,linear algebra to get a start because this side is really hard on mathematics. So it really depends what you want to do. Don't just get lost in the deep dark forest of mathematics, just stay focused, prioritize you stuff, divide and conquer you tasks, and best of luck. ♥ Welcome to Programming world.
so someone who wants to go into Data Science/Analysis has to learn pretty much everything of math right?
And can u tell how much of calculus is actually needed for this role?
@@rahulpaul1833 Rahul that's a very good question, actually I am just preparing for the role right now. According to my knowledge and some of which I have covered it is as follows: Univariate & Multivariate Calculus, Linear Algebra, Statistics, Probability Theory, Optimization Theory, Information Theory, Fourier Transform, Differential Equations, Time series analysis, bayesian statistics, graph theory, operations research, and a few discrete math topics. Some of them have higher priority some of them has lower. For junior data science role, first three of these would suffice. But If someone would like to go into research field or more senior level roles, then ofcourse all would be required. As practitioner, Surface of these branches would suffice. But as researcher you might have to go much deeper.
@@thatsfantastic313 Thank you so much for the valuable info
@@rahulpaul1833 Anytime ♥
what about machine learning?
If you are self-studying, I recommend checking out books on Set Theory and Discrete Mathematics (Schaum Series) by Seymour Lipschutz. I am self-studying proofs these days for fun, and I have found these books very easy to understand.
Hey man, just wanted to say thank you for recommending Chris McMullen's workbook on Calculus Fundamentals, I've been working through it and the examples are super instructive and easy to digest, and the exercises are the perfect difficulty too for an introduction to certain ideas.
I've been working on my Maths skills to prep for my course in uni, and so far I've covered limits and continuity as well as a bit of sequences and series, and I would love to hear some recommendations for books geared towards those topics. Many thanks again!
Hi! I am from Bulgaria. when you made the video about the spanish book I bought it. I looked at it and saw that the problems are easy compared to the algebra workbook that was used in our high school 30-40 years ago. I could recommend you one of the some bulgarian books like :
1"сборник от задачи по алгебра за 7-10 клас"
2."ръководство за решаване на задачи по математика част 1"
I went through the Epp book (on recommendation of this channel). It's a good book, but I still had some trouble with the proofs, especially when it got on to proof by strong mathematical induction. I would recommend picking up the Proofs book by Cummings as a suppliment. Any time you get confused about a concept in proofs, look it up in there.
Super suggested book: A Logical Approach to Discrete Math - David Gries, Fred B. Schneider
It starts from scratch using a more...computer science approach, but it's amazing!
I just finished taking a discrete math class based on Epp's book. I would give it a 3/5. Good but not great.
Part of what bugged me a bit was not the book itself, but kind of how these classes are structured. You're given a compendium of disparate topics and an overview of each. The book jumps around in subject matter and difficulty quite a bit. Some stuff is discussed pretty in depth and gets very confusing and abstract, even though it seems to be totally disconnected from the rest. The Boolean Algebra and Partial Order Relations were examples of this. They were discussed superficially, but in a complicated way at the same time. Meanwhile, some very basic explanations are repeated over and over, to the point where it seems like they were trying to fill up space. However, some of the explanations of more common topics in set and number theory were good, even better than other textbooks I've seen.
I personally would like it better if I could take a set theory class, a probability class, a graph theory, and a proof writing class, instead of grouping everything in Discrete Math. I think those 4 would cover the material in a more organized way, and I'll probably have to take them anyway in the end. I realize this is not always possible though.
I have the same feeling, and I don't think it's necessary for basic programming
I have the math skills of an amoeba. Unless they're excellent at math...then not so much. But here I am at 7 am watching your fascinating video with a cup of coffee. I love passionate people. Honestly it's all Greek to me but I love this channel.
Discrete math is my main area of math that I know, I find it almost improbable to memorise compared to other mathematics so I try and not beat myself up too much about it. I learned it mainly from building games and now my own game engine currently, university (AI degree specifically) and some courses on Udemy I think. Set theory is 'extremely' easy to learn out of all the things I learned this was probably the easiest to remember. The problem I find with a lot of computer science like degrees though that seem to teach this, you probably would only use about 20% of what you learn in an actual job.
"Discrete Mathematics with Graph Theory" by Goodaire
is a very intro level discrete text.
I'd say roughly high school level.
the older editions are pretty inexpensive.
Great video, I'm in the same situation and will start going through the books
Computer Science is basically a disguised Math degree, much like Electrical Engineering is a disguised Physics degree.
The more math you know the better you'll be at programming, since you'll often design algorithms.
Complexity Analysis & Big O notion are basically Math proofs you'll learn in Discrete Multi-Variable Calculus or Linear Algebra.
If you get into programming for AI it uses Probability and is very Math intensive.
I would recommend a CompSci major with a Math/Statistics minor, or vice versa.
I used the 3rd edition of Discrete Math by Epp and she has a chart for Core sections, Optional Math sections, and CompSci Apps sections.
I actually failed Data Structures when I was an undergraduate CompSci major, I then changed my major to Math.
After working as a Statistician for 4 years, I went to grad school and Data Structures was a breeze.
My area of research was in IoT, Chip design, and Architecture in Graduate School.
I currently work with Computer Engineers even though by degrees are in Math & CompSci.
We underestimate how useful a Math degree is, even though Physics, Engineering, and Computer Science is based from it.
Hope this is helpful.
The best way would be to look into "graph theory". I think that's also discrete math. But it looks at solving problems displayed as graphs. It's the most interesting and most versatile math + algorithmic branch in IT.
Well, at least now I don’t feel like such an idiot, getting stuck working through the first chapter of Rosen. That book is over 2000 pages. So much to get through.
Tons lol
It's so funny how I'm also from Egypt and watching this video. Thanks Mohamed for writing that email! 😂❤
I really enjoyed Discrete Mathematics: An Open Introduction 3rd Edition by Oscar Levin. He noted specifically in the preface that it was not written to be geared towards computer science, but since I do not study CS I have no idea what the difference would’ve been if it was. It’s worth noting though.
Felt like a good mix of straight explanations and working through the logic with examples to me. I admittedly still have a couple chapters unread but don’t really need them yet. I only bring this book up because it was super cheap on Amazon and I know these things add up fast
I've found that discreet math books differ in the amount of attention they pay to topics directed towards computer applications. Some cover languages. Some do not. IMO, the former are more applicable to computer science. You might look up the introductory CS courses offered at your local university to see what texts they use.
As someone who has a lot of books and a good amount of textbooks, I have to imagine when you move it is a NIGHTMARE hauling all those things around 🤣. It's the main hesitation I have whenever I want a new one.
A difficulty with discrete math is that it is not a unified single subject, but rather it is a collection, a mixture, a potpourri of miscellany, often none of which are explained in sufficient depth or detail to be understood well. So, to achieve understanding a person must delve deeper into particular subjects such as graph theory, combinatorics, or cryptography. The abbreviated, terse, and incomplete subject and problem descriptions must be filled out with more substantive, and often easier-to-understand materials. Your autodidactic efforts will be challenged, and your range of required reading expanded and enhanced.
books I read for discrete mathematics:
1. Rosen (there are a couple of books on discrete mathematics by rosen)
2. Miklós Bona (advanced topics)
Can you review “A Logical to Discrete Math” by Gries and Schneider
Its a pretty awesome book on logic!
Can discrete maths textboks be used as preanalysis book... like as beginner book for analysis..
do you have any course for discrete mathematics?
Thank you for this advice for him (maybe for several of us). I'd like to know what subjetcs are the antecedents for Discrete Maths. Only calculus and differential equations are okay, or do you need to know more before trying to learn Discrete Maths?
Please make more videos on jee exam, love from india
I think that in order to become JAVA developer you need only subset of discrete mathematics. You will save a lot of time by mastering, practicing essential topics with IDE and JVM. Bitwise operations, boolean logic, etc. And skip in depth diving into discrete math. (IMHO)
Get a text in English and one in Arabic.
You'll get two perspectives and practice in English.
God I really really needed this video ❤
Where did the wizard Beard go ? 😮
The MIT OCW has a free discrete mathematics videos
Hi math sorcerer
Maybe it's just me but I found discrete math to be the hardest compared to linear algebra & calculus. I found it hard to visualize what I was doing.
"Discrete Math with Ducks" is one of my favorite books
Hi, I am from India, my English is very weak, I do not understand any book of English medium math, due to which my math is also becoming weak, the reason for this is that all the good books of math are all in English, due to which I am not able to solve the math, which is very sad for me, please tell me a real solution for this. I will be very grateful to you.
Hindi courses and youtubers exist you know
Hi I'm new to your channel I want to learn calculus derivatives etc give me the playlists in a correct order. I'm studying grade 10
Proving isnt hard, its knowing if the statement is true or false is the hardest part.
Hey guys 👋 anyone know of any infinite series texts, specifically as it pertains to oscillation functions? 🎉😅
ISAAC NEWTON?
Bahut shukriya
Come on Bruce, we know you're not Bruce
I have the Rosen book. It's awful. I don't know why it's used for undergrads.
I'm a programmer for a Wall Street firm for the past 15 yers and there is almost no math involved. If there is math there are libraries that do all the math for you. Maybe he should consider data science not programming. Front end programmer -- no math. Back end programmer -- no math.
How can i get your email, i have questions as well
Patron or channel description
muhammad, just so u know: u dont need to " master " discrete math to be good at programming or to understand data structures and algorithms.
Beyond some intermmidiate topics it would be rudandant to continue unless u r interested in hard core theoretical computer science.
In a common CS b.s.c they will teach u: linear algebra, probability, discrete math, graph theory, algorithms, data structures, logic and sets ...
I would advise to pass the brginner level in each of those rather than " mastering " a single one.'
It would be more interesting, less frastrating and will make u a well rounded thinker.
Ewe huemans should be aware...more.....👁️
First one, hahaha
Sir please don’t release your valuable information posting many videos.Just release a video which contains so much information.