B Is There an Alternative Approach to Learning Pure Math for Beginners?

  • B
  • Thread starter Thread starter NoahsArk
  • Start date Start date
  • Tags Tags
    Pure Pure math
NoahsArk
Gold Member
Messages
258
Reaction score
24
I've wanted to learn pure math for a while. I bought the book "A Concise Introduction to Pure Mathematics by Martin Liebeck." The first chapter or so misled me into thinking that finishing the rest of the book would be doable. Chapter 1 gets into definitions of sets and related vocabulary and basic ideas like if then statements. It very quickly gets into problems like proving ## \sqrt 3 ## is irrational. Even the chapter on decimals is difficult for me.

Is there a better way to learn pure math- like through another book or online course? Other than pure math, the furthest I've gotten to in math is some calculus, and it was mostly from self-study. I'm rusty in most of the math that I do know since I haven't studied it in a while, but my understanding is that pure math is kind of a standalone subject and more related to logic. If there is anything I do need to brush up on or learn before studying pure math please let me know. Thanks
 
Physics news on Phys.org
Pure math is a huge range of subjects. All it means is you develop theorems from axioms, and prove things.

I took a look at the book and it moves pretty fast. For your first introduction to proofs, it starts off with some hijinky stuff. Proving every real numberhas a decimal expansion is mind bending because it's so obvious, why would you even need to prove it? Which makes it hard to see what the point is.

You might be better served by doing a book on geometry or just number theory first, to get the pattern down of what a proof looks like and how to know when you've actually solved a problem, and then revisit this book. Or ask lots of questions here.
 
  • Like
Likes Klystron, jedishrfu and fresh_42
I appreciate your response! I will look into number theory and brush up more on geometry first. Thanks
 
NoahsArk said:
I appreciate your response! I will look into number theory and brush up more on geometry first. Thanks
Don't hesitate to use our - in this case - precalculus homework forum and ask what you need to understand:
https://www.physicsforums.com/forums/precalculus-mathematics-homework-help.155/
... and show some of your efforts or thoughts. This is required there.

Number theory can become quickly tricky, depending on where you enter and what you consider. I would suggest trying to prove Bézout's lemma. It says that given any two integers ##a## and ##b## you can find other integers ##n,m## such that ##a\cdot n +b \cdot m= \operatorname{gcd}(a,b)## the greatest common divisor of ##a## and ##b.## All you need is the Euclidean algorithm for that. The Euclidean algorithm is the sophisticated word for division: Given two integers ##N## and ##D## there is are integers ##q## and ##r## such that ##N=q\cdot D +r.## It means: ##D## fits ##q## times into ##N## leaving a remainder ##r## that is smaller than ##D.## (Of course. Otherwise, we could set ##q## one higher and take then the remainder.) Formally we require ##0\leq r< D.##

Hint for Bézout's lemma. Set ##N=a## and ##D=b##. Then write ##a=q_1\cdot b +r_1## with ##0\leq r_1<b.## If ##r_1=0## then stop. Otherwise, write ##b=q_2\cdot r_1+r_2## and so on, until ##r_n=0## becomes zero. Why has it to end up at zero? What if you roll up this chain from the bottom back to the top?
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Replies
13
Views
3K
Replies
5
Views
4K
Replies
32
Views
369
Replies
4
Views
2K
Replies
1
Views
1K
Back
Top