M328K Final Exam Solutions, May 10, 2003 1. “Bibonacci” numbers
... “Proof ” Let n be a positive integer. If n is prime, then n is divisible by the prime n, and we are done. If n is composite, then n = ab, where a and b are integers less than n. If a is prime, then a|n, and we are done. If a is composite, write a as a product of two smaller integers, and examine the ...
... “Proof ” Let n be a positive integer. If n is prime, then n is divisible by the prime n, and we are done. If n is composite, then n = ab, where a and b are integers less than n. If a is prime, then a|n, and we are done. If a is composite, write a as a product of two smaller integers, and examine the ...
![arXiv:math/0602485v1 [math.NT] 22 Feb 2006](http://s1.studyres.com/store/data/013513616_1-50ff29799a9beccee93b8ed57af48985-300x300.png)
