3.5 Arithmetic Sequences as Linear Functions
... 1) Use inductive reasoning in continuing number patterns 2) Write rules for arithmetic sequences 3) Relate arithmetic sequences to linear functions ...
... 1) Use inductive reasoning in continuing number patterns 2) Write rules for arithmetic sequences 3) Relate arithmetic sequences to linear functions ...
document
... • Addition of complex numbers can also be represented by graphing. First, graph the two numbers to be added. Then complete the parallelogram that has two sides represented by the segments. The segments from the origin to the fourth vertex of the parallelogram represents the sum of the two original n ...
... • Addition of complex numbers can also be represented by graphing. First, graph the two numbers to be added. Then complete the parallelogram that has two sides represented by the segments. The segments from the origin to the fourth vertex of the parallelogram represents the sum of the two original n ...
Infinite Sets and Infinite Sizes
... How many fractions are there? If a table has m rows, and n columns, then it has a total of mön cells. Now the chart depicted above has infinitely-many rows and infinitely-many columns; what is ¢0 ö ¢0? Surely, a "zillion-zillion" is bigger than a "zillion"! If that is not convincing, consider the fo ...
... How many fractions are there? If a table has m rows, and n columns, then it has a total of mön cells. Now the chart depicted above has infinitely-many rows and infinitely-many columns; what is ¢0 ö ¢0? Surely, a "zillion-zillion" is bigger than a "zillion"! If that is not convincing, consider the fo ...
Full text
... Remarks: This implies that if p is a non-defective odd prime, then p = 5 or p = 3 or 7 (mod 20). While it is easily seen that 2, 3, 5 and 7 are non-defective, the author has not been able to find any other non-defective primes. From Theorems 2 and 6, we have Theorem 7. If n > 1 is non-defective, the ...
... Remarks: This implies that if p is a non-defective odd prime, then p = 5 or p = 3 or 7 (mod 20). While it is easily seen that 2, 3, 5 and 7 are non-defective, the author has not been able to find any other non-defective primes. From Theorems 2 and 6, we have Theorem 7. If n > 1 is non-defective, the ...
