A Simple Proof that e is Irrational
... (and e) is irrational should be evident from this e demonstration. The following analysis explicates why this conclusion is justified. ...
... (and e) is irrational should be evident from this e demonstration. The following analysis explicates why this conclusion is justified. ...
![[Part 1]](http://s1.studyres.com/store/data/008795851_1-ba5e93defdc79389d9cfa65f2721a736-300x300.png)
Answers to
... Factor Test Theorem says to take the square root of the number. We only have to test from 1 to the whole part of the number to find all factors of the original number. This does not mean that the square root will be a factor, only that we test to that number. Example: the sqrt(18) = 4.24 (approx.) S ...
... Factor Test Theorem says to take the square root of the number. We only have to test from 1 to the whole part of the number to find all factors of the original number. This does not mean that the square root will be a factor, only that we test to that number. Example: the sqrt(18) = 4.24 (approx.) S ...
Problems for the test
... Find the maximum possible value for x + y given that 3x +2y 7 and 2x + 4y 8 Andy says, “Exactly three of us are liars.” Bill says, “Andy is a liar.” Clair says, “Bill is a liar.” Daisy says, “My favorite movie is Dukes of Hazzard.” Each person is either lying or telling the truth. Name the liar( ...
... Find the maximum possible value for x + y given that 3x +2y 7 and 2x + 4y 8 Andy says, “Exactly three of us are liars.” Bill says, “Andy is a liar.” Clair says, “Bill is a liar.” Daisy says, “My favorite movie is Dukes of Hazzard.” Each person is either lying or telling the truth. Name the liar( ...
SESSION 1: PROOF 1. What is a “proof”
... is greater than each pi (so k 6= pi for any i) and that k divided by each pi has remainder 1. In particular, if p1 , p2 , . . . , pn is a complete list of primes then k’s only divisors are 1 and k meaning that k is a prime. This contradicts our assumption that {p1 , . . . , pn } was the set of all p ...
... is greater than each pi (so k 6= pi for any i) and that k divided by each pi has remainder 1. In particular, if p1 , p2 , . . . , pn is a complete list of primes then k’s only divisors are 1 and k meaning that k is a prime. This contradicts our assumption that {p1 , . . . , pn } was the set of all p ...
