Pigeonhole Solutions
... sequence to guarantee there are fewer than p numbers in 0, 1, 1, 2, …, Fn-1. Therefore the period is less than (p-1)*(p-1) < p2 – 1. (We will look at p = 5 in just a moment.) There are other interesting primes, the first of which are 7 = 2 + 5 and 11 = 3 + 8. These are the primes formed by adding Fn ...
... sequence to guarantee there are fewer than p numbers in 0, 1, 1, 2, …, Fn-1. Therefore the period is less than (p-1)*(p-1) < p2 – 1. (We will look at p = 5 in just a moment.) There are other interesting primes, the first of which are 7 = 2 + 5 and 11 = 3 + 8. These are the primes formed by adding Fn ...
Chapter 2 Hints and Solutions to Exercises p
... some natural number. Step 1: First show that perfect squares can only be of the form 3j or 3j+1. For example (3k 1) 2 9k 2 6k 1 3(3k 2 2k ) 1 3 j 1 where j 3k 2 2k . Do a similar analysis for 3k and 3k+2. Step 2: Assume that a and b in the Pythagorean Theorem are both not multi ...
... some natural number. Step 1: First show that perfect squares can only be of the form 3j or 3j+1. For example (3k 1) 2 9k 2 6k 1 3(3k 2 2k ) 1 3 j 1 where j 3k 2 2k . Do a similar analysis for 3k and 3k+2. Step 2: Assume that a and b in the Pythagorean Theorem are both not multi ...
38_sunny
... you will at once point out to me the lunatic asylum as my goal. I dilate on this simply to convince you that you will not be able to follow my methods of proof if I indicate the lines on which I proceed in a single letter.” ...
... you will at once point out to me the lunatic asylum as my goal. I dilate on this simply to convince you that you will not be able to follow my methods of proof if I indicate the lines on which I proceed in a single letter.” ...
PDF
... A k-superperfect number n is an integer such that σ k (n) = 2n, where σ k (x) is the iterated sum of divisors function. For example, 16 is 2-superperfect since its divisors add up to 31, and in turn the divisors of 31 add up to 32, which is twice 16. At first Suryanarayana only considered 2-superper ...
... A k-superperfect number n is an integer such that σ k (n) = 2n, where σ k (x) is the iterated sum of divisors function. For example, 16 is 2-superperfect since its divisors add up to 31, and in turn the divisors of 31 add up to 32, which is twice 16. At first Suryanarayana only considered 2-superper ...