Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Discrete People
| Question | Answer |
|---|---|
| What is Prim known for | Prim is famous for developing Prim’s algorithm, which is used in graph theory to find a minimum spanning tree (MST). |
| What was kruskal known for | Kruskal developed an algorithm used to find a minimum spanning tree (MST) in a graph—similar goal as Prim’s, but with a different approach. |
| what was Jacob (James) Bernoulli (1655-1705 | gave many examples on how much one would expect to win playing various games of chance. The term Bernoulli trial resulted from this work. |
| What was Leonhard Euler (1707-1783) known for | Euler is credited as the first to develop graph theory, as a solution for the problem of the Seven Bridges of K ̈onigsberg, which is considered the first practical application of topology. Euler also discovered the formula V − E + F = 2 |
| What was William Rowan Hamilton (1805-1865) known for | Hamiltonian paths and cycles are named after William Rowan Hamilton, who invented the icosian game, now also known as Hamilton’s puzzle |
| What was Julius Peter Christian Petersen (1839-1910) known for | His contributions to the field of mathematics led to the birth of graph theory. n 1898, he presented a counter example to Tait’s claimed theorem about 1-factorability of 3-regular graphs, which is nowadays known as the Petersen grap |
| What was Brendan Mckay (born 1951) for | One of McKay’s main contributions has been a practical algorithm for the graph isomorphism problem and its software implementation NAUTY (No AUTomorphisms, Yes?) |
| Who is Frank Ruskey | Notably, Frank was the PhD supervisor of Joe Sawada and Aaron Williams. His favourite decoding problem produced the message Beer and Basketball |
| Who was Blaise Pascal (1623–1662) | In 1654, Pascal described a convenient tabular presentation for binomial coefficients which he called the arithmetical triangle, but is now called Pascal’s triangle. |
| What was Fibonacci (c. 1170 – c. 1240-50 known for | was an Italian mathematician developed the fibbanacci sequence and considered the most talented western mathematican of this time |
| What is the euler cyle vs hamiltonian | Euler is for edges Hamiltonian is for vertices |
| How many people must be in a class before there is a 50% chance that two of them have the same birthday? | 23 people |
| What is the probability that in a room with 4 students, two share the same birthday? | =1⋅ 364/365 ⋅ 363/365 ⋅ 362/365 = 0.0164 |
| Find the smallest number of students required so that the probability that someone (at least one) has a birthday on Jan 1 is greater than 1/2 | 254 |
| max # edges with n vertices? | This is prims algorithm n(n - 1)/2 this also equals n choose 2 |
| What do you need to pay attention to in lexico questions | is it before or after |
| Does the Euler formula for regions/ faces apply to every graph | no only planar connected graphs |
| How many edges are in a spanning tree | n - 1 always |
| what is Kazimierz Kuratowski best known for? | He is best known for Kuratowski’s Theorem, which states that a graph is non-planar if and only if it contains a subdivision of ( K_5 ) or ( K_{3,3} ). |
| Which 2 people developed the greedy algorithm for MST | Kruskal and Prim |
| m!/(m − n)! represents what number of functions with m > n | one to one functions |
| Given a random subset of 3 students, what is the probability that (at least) two were born on the same weekday (Mon, Tues, Wed, Thurs, Fri, Sat, Sun)? | (7 * 6 * 5)/ 7^3 |
Created by:
jayne_