Discrete Math You Need to Know - Tim Berglund

From OSCON 2013: What do you need to know about prime numbers, Markov chains, graph theory, and the underpinnings of public key cryptography? Well, maybe more than you think!

In this talk, we'll explore the branch of mathematics that deals with separate, countable things. Most of the math we learn in school deals with real-valued quantities like mass, length, and time. However, much of the work of the software developer deals with counting, combinations, numbers, graphs, and logical statements: the purview of discrete mathematics. Join us for this brief exploration of an often-overlooked but eminently practical area of mathematics.

Follow O'Reilly Media:

[oreilly]

From the 2013 O'Reilly Open Source Convention (OSCON) - Tim Berglund on discrete mathematics - often overlooked yet eminently practical

#OpenSource   #Opensourcesoftware   #Oscon   #algorithm   #Math   #Portland  

Discrete Math You Need to Know - Tim Berglund

[gospelmusic]

THANK YOU VERY MUCH SIR, FOR TAKING YOUR PRECIOUS TIME TO PRESENT THIS TUTORIAL. PLEASE SIR, I AM NEW TO THIS KIND OF MATHS, HERE ARE SOME QUESTIONS, I NEED YOUR HELP ON THIS ONE...



1. (a) The universal set is {1, 2, . . . 10}. Let A = {1, 2, 3, 4, 6, 7}, B = {2, 3, 4, 5, 8} and
C = {1, 3, 5, 6, 8, 9}. Find the elements of the following sets:
(i) A∆B
(ii) (A ∩ B)
′\C

(b) Given the relation R such that R = {(m, n) ∈ R|m, n ∈ A, m2 − n ≥ 4} when A
is the set {0, 1, 2, 3, 4},
(i) express the relation R as a set of ordered pairs.
(ii) draw an arrow diagram to represent this relation.
(iii) investigate whether the relation is symmetric, transitive and/or reflexive.

(c) Determine if the following functions are one-to-one and/or onto and use these to
determine whether the function is a bijection. Assume both functions are such
where f : R → R.
(i) f(x) = 6x − 9
(ii) f(x) = x
2 − 2x + 1

[juniorfariasxD]

as someone new to discrete math, i just got mindblown and very interested in the topic

[shreyanshsingh]

This guy makes it look easy. Great talk

[ModernPython]

Is the notation right for the subset examples.  He said k stickers with putting n of them in a bag results in n choose k?  I think it should be k choose n.  The same logic was used on multi subsets.  Loved the material but was confused by these two examples.

[RagingNarwhal]

Is there a more formal name for the "Seed Planting" algorithm discussed at 29:40? I am trying to find out more about it and I can't find anything based on that name.

[MouseyBusiness]

Is this a bad major for someone who doesn't like/not good at math? Can they learn to like math? Can college courses help improve their math? Is programming very centered around math?

[jacobtran]

should i take discrete math and trig? would that be too hard?

[cemery]

Here is link to his full course on line:
The material is dense and my head is thick but his presentation is good and clear..

[tedahd]

what was the code/app used for calculation?

[KulvinderSingh-pmcr]

The formula written for arrangements in slide was wrong !!
for stack of k items and taking n out them, the formula is fact k / fact k - n

[allaf]

Woops! Arrangement is N ice cream flavors take K, not K take N.

[lovaaaa]

Number theory is most definitely not discrete math. Discrete math is also not about ''the integers'', sure you are interested in them as counting numbers in combinatorics but the only thing that fundamentally distinguishes discrete math is that it is interested specifically in finite structures and has a bit of a romantic affair with computer science.