Bob
]]>Bob
]]>I am studying modular arithmetic, diophantine equations, linear congruences, prime numbers and logic. And we are supposed to be able to prove statement concerning those topics.
for example:
prove 2^n > n^2 for all n greater than 2.
If you need more info, let me know.
]]>I have a Discrete Math midterm approaching soon
In the UK that phrase covers many topics. You can download past papers and mark schemes for free from some of the exam boards. But you'd have to look at the content to see if they had what you are seeking.
http://www.edexcel.com/Pages/Home.aspx
Don't know if that will help. Or post again with more specific topics.
Bob
]]>I have a Discrete Math midterm approaching soon and I feel that I am weak at proofs, can someone provide me with some activities to do. Say give a batch of proofs to prove or disprove and then check over my solutions?
Thanks!
]]>