This action might not be possible to undo. Are you sure you want to continue?
1. Decide whether following are true or false. If false, give a counter example: a. b. c. d. | | | | | | | | | | |
2. Prove that for any positive integer n, gcd(n, n+1) = 1 3. Give an example to show that it is not necessarily the case that gcd(a,b,c) . lcm(a,b,c) = abc 4. Show that 5. Show that 39 divides 6. Find a complete residue system modulo 11 composed of multiples of 11 7. Find a number with remainders of 3, 11 and 15 when divided by 10, 13 and 17 8. Someone wishes to purchase horses and cows spending exactly $ 1770. A horse costs $31 and a cow $21. How many of each can the person buy? 9. Divide 100 into two parts, one divisible by 7 and the other divisible by 11. 10. Find an integer that leaves a remainder of one when divided by either 2 or 5 but that is divisible by 3
Submission due: Oct 21, 2011. If you want to submit hand written, you can give me on 24th (monday)