Dwight Schrute Posted May 8, 2011 Report Share Posted May 8, 2011 Hey, so what do people think will be in the paper 3 DM this year? Reply Link to post Share on other sites More sharing options...
adletaY Posted May 8, 2011 Report Share Posted May 8, 2011 Hopefully there won't be any crazy Graph Theory proofs. Even though I am in IB1, I am dreading what P3 will be like, seeing as I still don't really understand Graph Theory. Number Theory was better though, but the proofs are still very hard. Good luck to everyone sitting the exam, I hope it goes well.PS: Make sure you know the proof for Euler's Formula (and the Corollaries)and Fermat's Little Theorem, maybe they will show up. Reply Link to post Share on other sites More sharing options...
Dwight Schrute Posted May 8, 2011 Author Report Share Posted May 8, 2011 I agree proofs under graph theory can be a nightmareIm hoping for minimum spanning tree, system of linear congruences, base representations, diaphantine equations and a divisibility proof with PMI would be awesomebut obviosuly graph theory needs to come up as well a bit more best of luck to you too and everyone else 1 Reply Link to post Share on other sites More sharing options...
adletaY Posted May 9, 2011 Report Share Posted May 9, 2011 Shortest path (Djikstra's Algorithm), Chinese Postman Problem, and Traveling Salesman Problems aren't so bad either. Reply Link to post Share on other sites More sharing options...
dogmatichurricane Posted May 11, 2011 Report Share Posted May 11, 2011 Hey I'm guessing 24 hours has past now so:How did you guys think Discrete went? I personally found the paper quite straightforward didn't have any issues. Just hoping I made no careless mistakes in my haste, but apart from that it was a breeze compared to some of the monster graph theory proofs in past papers. Reply Link to post Share on other sites More sharing options...
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.