Where can I find a comprehensive resource for learning discrete mathematics?

tntcoder
Messages
11
Reaction score
0
Hi,

Im after some advice on what materials to use in order to gain a fairly 'decent' understanding of the following topics:

Elementary Set Theory, Subsets, Unions, Intersections, Complements. Logic, Functions, Mappings, Injectivity. Subjectivity. Bijectivity, Permutations, Proof techniques (contradiction, induction).

I covered the basics of these topics about 3 years ago, and have done virtually no maths studying since then, so i only have vague memories :(

Can anyone reccomend a decent book that covers these topics, and contains solid self practice exercises.

This is knowledge which I am supposed to have as a prerequisite for a masters degree, so i really just want to brush up on it to a point where i know what I am talking about to pass an interview and not struggle with the more advanced use of the mathematics which might come up in the degree (computing).

Many thanks,

Jack
 
Mathematics news on Phys.org
A very decent book is Discrete Mathematics and Its Applications by Kenneth H. Rosen. Although it is a formal textbook for one or two term introductory Discrete Mathematics courses taken by students from a wide variety of majors, including Computer Science, Mathematics, and Engineering, it is accessible, flexible and precise enough with lots of examples and a number of intermediate and difficult exercises.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top