PLEASE CHECK THE FAQ FOR QUESTION 6. I POSTED SOMETHING WRONG EARLIER ON IN THE DAY... IT'S BEEN CHANGED. very sorry about that.
For some reason, we can't seem to get into the hotmail account
today... So, if you could send your questions directly to us:
cpjones@leland
johnson@cs
we'll do our best to answer the questions.
If something is proven in the text part of the book or in a handout, you can cite it. If it is a proof from the problem sets in the book, you need to provide the proof with your exam if you wish to cite it.
non-negative means >= 0 positive means >= 1
3,5,7,9,11 would be consecutive odd integers 3,5,7 would be consecutive odd integers that are prime 3,5,7,11 would not be consecutive odd integers that are prime
you can't assume that the sum, product, dividend of two rational numbers are rational. You have to prove the properties yourself.
you can assume that the sum, product, difference of two integers are integers.
There is no typo. 5 is not an Ulam number.
if you replace n with u(n), as in the nth Ulam number, the problem may make more sense. So we have:
We define Ulam Numbers by setting u1=1, u2=2. Then after determining the integers less than u(n) that are Ulam numbers, we set u(n) equal to the next Ulam number if it can be written uniquely as the sum of two different Ulam numbers.
Assume n is a positive integer.
If each term in a sum is divisible by 6, you can assume that the sum is divisible by 6.
Assume n is a positive integer
Assume n is a positive integer.
each mathematicians is allowed to look at another mathematician. No other communication is allowed.
there is always at least 1 white hat. and 0 or more black hats.
the mathematicians with black hats do not talk to the king.
Last modified: Tue Nov 21 11:18:50 PST 2000