CS1800: Strong Induction. Professor Kevin Gold
|
|
- Isabel Young
- 5 years ago
- Views:
Transcription
1 CS1800: Strong Induction Professor Kevin Gold
2 Mini-Primer/Refresher on Unrelated Topic: Limits This is meant to be a problem about reasoning about quantifiers, with a little practice of other skills, too Intuitively, the limit is a number the sequence a n gets closer and closer to as n gets larger There exists x [the limit] such that for all ϵ [distances from the limit] we can find some n 0 [ point of no return ] such that for all n n 0, a n is no further away than ϵ. Any ϵ has a corresponding n0 ϵ n0 (3) x all ϵ or closer to x ϵ n0 (5) x ϵ or closer
3 Weak versus Strong Induction Both kinds of induction are used to argue that a statement involving some n keeps being true But they primarily differ in their inductive steps Weak induction: If it is true in the current step (n=k), it will be true for the next step (n=k+1) Strong induction: If it was true until now (1 < n < k), it will be true for the current step (n=k) It s a stronger assumption - a stronger inductive hypothesis - but if we can justify it, we can prove some things more easily
4 Brief Review of Proof By Weak Induction Recall that proof by induction consists of two pieces: An inductive step - proving that if the statement is true for n=k, it is true for n=(k + 1) This basically proves that a statement will keep being true for n > k once it is true for some n=k A base case - proving the statement is definitely true for some k, thus starting off the induction chain
5 Practice - Proving it Slowly Together Prove 5 n -1 is divisible by 4 for n 1. First step: Base case. What does that look like?
6 Practice - Proving it Slowly Together Prove 5 n -1 is divisible by 4 for n 1. First step: Base case, for n= = 4, which is clearly divisible by 4. Next: Inductive step. What are we supposing (in terms of k), and what will we try to show (also in terms of k)?
7 Practice - Proving it Slowly Together Prove 5 n -1 is divisible by 4 for n 1. First step: Base case, for n= = 4, which is clearly divisible by 4. Next: Inductive step. Suppose 5 k -1 is divisible by 4. We will show 5 k+1-1 must be divisible by 4. What s the inductive hypothesis here, and how could we turn it into some algebra to manipulate?
8 Practice - Proving it Slowly Together Prove 5 n -1 is divisible by 4 for n 1. First step: Base case, for n= = 4, which is clearly divisible by 4. Next: Inductive step. Suppose 5 k -1 is divisible by 4. We will show 5 k+1-1 must be divisible by 4. By the inductive hypothesis, 5 k -1 = 4a for some integer a. How can we start turning this into a statement about 5 k+1-1? (This takes a few steps)
9 Practice - Proving it Slowly Together Prove 5 n -1 is divisible by 4 for n 1. First step: Base case, for n= = 4, which is clearly divisible by 4. Next: Inductive step. Suppose 5 k -1 is divisible by 4. We will show 5 k+1-1 must be divisible by 4. By the inductive hypothesis, 5 k -1 = 4a for some integer a. Then 5 k = 4a+1 and 5 k+1 = 5(4a+1) = 20a+5, so 5 k+1-1 = 20a+4. All we need is to complete the inductive step. How can that happen?
10 Practice - Proving it Slowly Together Prove 5 n -1 is divisible by 4 for n 1. First step: Base case, for n= = 4, which is clearly divisible by 4. Next: Inductive step. Suppose 5 k -1 is divisible by 4. We will show 5 k+1-1 must be divisible by 4. By the inductive hypothesis, 5 k -1 = 4a for some integer a. Then 5 k = 4a+1 and 5 k+1 = 5(4a+1) = 20a+5, so 5 k+1-1 = 20a+4. Since 20a + 4 is divisible by 4, 5 k+1-1 must be divisible by 4. Thus, if 5 k -1 is divisible by 4, 5 k+1-1 is divisible by 4.
11 Recall That This is Enough To Show the Argument Works for n 1 We ve given a general argument that if the statement 5 n -1 is divisible by 4" is true for n=k, it s true for n=k+1. If somebody didn t believe us about, say, n=3, they could just apply the inductive argument a few times from the base case, using specific values for k. If true for 1, true for 2: = 4a, so 5 1 = 4a+1 and thus 5 2 = 5(4a+1) =20a+5 and = 20a+4 so divisible by 4 If true for 2, true for 3: = 4b, so 5 2 = 4b+1 and thus 5 3 = 5(4b+1) =20b+5 and = 20b+4 so divisible by 4 And so on, ad infinitum. We don t need to explain this logic in a proof by induction - it s assumed.
12 The General Justification for Strong Induction Imagine actually applying the inductive step repeatedly to prove all values 1 < n < k. If true for 1, true for 2. If true for 2, true for 3. You haven t just proven the statement for one value. You ve also proven the statement for every value of n along the way. That means we can make arguments that rely on the truth of statements further back than the previous statement k-1 k
13 Currency Example A game issues in-game coins in $4 and $5 denominations. Show that this can hit any integer value $12. The slow way of proving every statement would be to give a way to make every value, one at a time. This proof would never finish, but can help us get a sense of the problem: Proof for $12: = 12. Proof for $13: = 13. Proof for $14: = 14. Proof for $15: = 15. Proof for $16: = 16. Proof for $17: = 17.
14 Currency Example A game issues in-game coins in $4 and $5 denominations. Show that this can hit any integer value $12. We can realize that the cycle is starting over again : the patterns for 16, 17, 18 are the patterns for 12, 13, 14 just with a $4 coin attached. Proof for $12: = 12. Proof for $13: = 13. Proof for $14: = 14. Proof for $15: = 15. Proof for $16: 4 + ( ) = 16. Proof for $17: 4 + ( ) = 17. Proof for $18: 4 + ( ) = 18.
15 Currency Example A game issues in-game coins in $4 and $5 denominations. Show that this can hit any integer value $12. It seems like we have a general way to produce more values - take a combination we ve already got, and add a $4 coin. This is the basis of our proof by strong induction. Proof for $12: = 12. Proof for $13: = 13. Proof for $14: = 14. Proof for $15: = 15. Proof for $16: 4 + ( ) = 16. Proof for $17: 4 + ( ) = 17. Proof for $18: 4 + ( ) =
16 Currency Example: Inductive Step A game issues in-game coins in $4 and $5 denominations. Show that this can hit any integer value $12. Inductive step: Suppose the statement is true for 12 n < k, where k >= 16. We can argue that the statement must be true for k, because k-4 is in the range that we assume is achievable, and we can just add a $4 coin to that. Notice that this argument doesn t prove anything about n=12, 13, 14, or 15. Just use the value $4 less doesn t work for these. So these must be base cases. (The breakdowns given earlier, such as 4+4+4, prove them.) k-4 k-3 k-2 k-1
17 Currency Example: Full Proof By Strong Induction A game issues in-game coins in $4 and $5 denominations. Show that this can hit any integer value $12. Base cases: 12=4+4+4, 13=4+4+5, 14=4+5+5, 15=5+5+5 Inductive step: Suppose the statement is true for 12 n < k, where k 16. We can argue that the statement must be true for k, because k-4 is in the range that we assume is achievable, and we can just add a $4 coin to that k-4 k-3 k-2 k-1
18 Fundamental Theorem of Arithmetic An example of needing to know the statement is true somewhere in the middle between 1 and k. To prove: Every integer 2 is the product of one or more primes (i.e. has a prime factorization ). Base case: 2 is the product of one prime - itself. Inductive step: Suppose the statement is true for all n, 2 n < k. Then k is either a prime - in which case the statement is clearly true, as it was for 2 - or not. If it is not, then there exist 2 numbers a,b where 1 < a,b < k and ab=k. By the inductive hypothesis, both a and b can be written as the products of primes. Then k could be written as the product of those factorizations. 2 a b k-1 k
19 Fundamental Theorem of Arithmetic * An example of needing to know the statement is true somewhere in the middle between 1 and k. To prove: Every integer 2 is the product of one or more primes (i.e. has a prime factorization ). Base case: 2 is the product of one prime - itself. Inductive step: Suppose the statement is true for all n, 2 n < k. Then k is either a prime - in which case the statement is clearly true, as it was for 2 - or not. If it is not, then there exist 2 numbers a,b where 1 < a,b < k and ab=k. By the inductive hypothesis, both a and b can be written as the products of primes. Then k could be written as the product of those factorizations. 2 a b k-1 k *Technically the fundamental theorem also guarantees uniqueness of the factorization, which we won t prove here.
20 n < k versus n k The inductive hypothesis for a strong induction is generally some form of Suppose the statement is true for all values of n up to But then, should we hypothesize it s true for n < k and prove for k, or draw the limit at n k and prove for n=k+1? This doesn t really matter; pick one. Even proofs by weak induction can be written either way. In any case, you re just proving the next case is true, however you number or name the cases I try to choose whichever way seems clearest for that particular proof - in particular, use what makes the inductive hypothesis easiest to say (hence often k to k+1 in weak induction)
21 Proving a Counting Pattern How many strings of n bits have no consecutive 1 bits? We can list some examples for different n; some will become base cases. n=1: 0 and 1 both work: 2 n=2: 00, 01, 10 [not 11]: 3 n=3: 000, 001, 010, [not 011], 100, 101, [not 11X]: 5 n=4: 0000,0001,0010,0100,0101,1000,1001,1010: 8
22 Proving a Counting Pattern How many strings of n bits have no consecutive 1 bits? There s a similarity here to the Fibonacci numbers - 0, 1, 1, 2, 3, 5, 8, Can we prove it? Why would each number be the sum of the two before? n=1: 0 and 1 both work: 2 n=2: 00, 01, 10 [not 11]: 3 n=3: 000, 001, 010, [not 011], 100, 101, [not 11X]: 5 n=4: 0000,0001,0010,0100,0101,1000,1001,1010: 8
23 Proving a Counting Pattern How many strings of n bits have no consecutive 1 bits? There s a similarity here to the Fibonacci numbers - 0, 1, 1, 2, 3, 5, 8, Can we prove it? Why would each number be the sum of the two before? n=1: 0 and 1 both work: 2 n=2: 00, 01, 10, but not 11: 3 n=3: 000, 001, 010, skip 011, 100, 101, skip11x: 5 n=4: 0000,0001,0010,0100,0101,1000,1001,1010: 8 Start with 0: all patterns of n-1 legal Start with a 1: need a 0, then n-2 left
24 Proving a Counting Pattern Prove: there are Fn+2 bitstrings of length n with no consecutive ones. Inductive step: Suppose the statement is true for 1 <= n < k. Then there are Fk+1 bitstrings of length k-1 and Fk bitstrings of length k-2. 0 k-1 bits + 10 k-2 bits Sketch of argument to come
25 Proving a Counting Pattern Prove: there are F n+2 bitstrings of length n with no consecutive ones. Inductive step: Suppose the statement is true for 1 n < k. Then there are F k+1 bitstrings of length k-1 and F k bitstrings of length k-2. The number of bitstrings of length k is equal to the number of bitstrings that start with 0 which must be equal to F k+1 by the inductive hypothesis, since any valid noconsecutive-1 s string of k-1 bits can follow plus the number of bitstrings that start with 1. To avoid consecutive 1 s, a 1 must be followed by a 0, so just the valid bitstrings of length k-2 are possible in the starts-with-1 case, and there are F k of them. 0 k-1 bits + 10 k-2 bits
26 Proving a Counting Pattern Prove: there are F n+2 bitstrings of length n with no consecutive ones. Inductive step: Suppose the statement is true for 1 n < k. Then there are F k+1 bitstrings of length k-1 and F k bitstrings of length k-2. The number of bitstrings of length k is equal to the number of bitstrings that start with 0 which must be equal to F k+1 by the inductive hypothesis, since any valid noconsecutive-1 s string of k-1 bits can follow plus the number of bitstrings that start with 1. To avoid consecutive 1 s, a 1 must be followed by a 0, so just the valid bitstrings of length k-2 are possible in the starts-with-1 case, and there are F k of them. Thus the total number of bitstrings of length k with no consecutive 1 s is F k + F k+1 = F k+2, which is what we wanted to prove about k-bit strings. What base case(s) do we need?
27 Proving a Counting Pattern Prove: there are F n+2 bitstrings of length n with no consecutive ones. Base cases: n=1: F 3 = 2, and there are two 1-bit strings. n=2: F 4 = 3, and there are 3 2-bit strings besides 11. Inductive step: Suppose the statement is true for 1 n < k. Then there are F k+1 bitstrings of length k-1 and F k bitstrings of length k-2. The number of bitstrings of length k is equal to the number of bitstrings that start with 0 which must be equal to F k+1 by the inductive hypothesis, since any valid no-consecutive-1 s string of k-1 bits can follow plus the number of bitstrings that start with 1. To avoid consecutive 1 s, a 1 must be followed by a 0, so just the valid bitstrings of length k-2 are possible in the starts-with-1 case, and there are F k of them. Thus the total number of bitstrings of length k with no consecutive 1 s is F k + F k+1 = F k+2, which is what we wanted to prove about k-bit strings.
28 Proving Exponential Growth of Fibonacci Numbers There are some programming patterns that will result in running times that grow like the Fibonacci numbers with the size of the input. Is that bad? In fact, the Fibonacci numbers grow exponentially, so those running times are bad. Let r be the golden ratio We can notice r 2 = ( )/4 = (3 + 5)/2 = 1 + r, which we ll use later We ll prove F n r n-2 for n 2, and thus the Fibonacci numbers grow at least as fast as exponentially
29 Proving Exponential Growth of Fibonacci Numbers To prove: F n r n-2 for n 2. (F 0 = 0, F 1 = 1, F i = F i-1 + F i-2 ) Let s guess that since this is about Fibonacci numbers, the inductive step will need the previous two statements to be true Then, we need 2 base cases n=2: F 2 = 0, 1, 1 and r 2-2 = r 0 = 1. F 2 r 0. Check. n=3: F 3 = 1+1 = 2. r 3-2 = r = about 1.6. F 3 r 1. Check.
30 Proving Exponential Growth Of the Fibonacci Numbers To prove: Fn r n-2 for n 2. (F0 = 0, F1 = 1, Fi = Fi-1 + Fi-2) Base cases: n=2: F2 = 0, 1, 1 and r 2-2 = r 0 = 1. F2 r 0. Check. n=3: F3 = 1+1 = 2. r 3-2 = r = about 1.6. F3 r 1. Check. Inductive step. Suppose the statement is true for 2 n < k. Then Fk-1 r k-3 and Fk-2 r k-4. What now?
31 Proving Exponential Growth Of the Fibonacci Numbers To prove: Fn r n-2 for n 2. (F0 = 0, F1 = 1, Fi = Fi-1 + Fi-2) Base cases: n=2: F2 = 0, 1, 1 and r 2-2 = r 0 = 1. F2 r 0. Check. n=3: F3 = 1+1 = 2. r 3-2 = r = about 1.6. F3 r 1. Check. Inductive step. Suppose the statement is true for 2 n < k. Then Fk-1 r k-3 and Fk-2 r k-4. Since Fk = Fk-1 + Fk-2, Fk r k-3 + r k-4. When in doubt, try some algebra
32 Proving Exponential Growth Of the Fibonacci Numbers To prove: F n r n-2 for n 2. (F 0 = 0, F 1 = 1, F i = F i-1 + F i-2 ) Base cases: n=2: F 2 = 0, 1, 1 and r 2-2 = r 0 = 1. F 2 r 0. Check. n=3: F 3 = 1+1 = 2. r 3-2 = r = about 1.6. F 3 r 1. Check. Inductive step. Suppose the statement is true for 2 n < k. Then F k-1 r k-3 and F k-2 r k-4. Since F k = F k-1 + F k-2, F k r k-3 + r k-4 = r k-4 (r+1). Using the equation we mentioned earlier, 1+r = r 2, so r k-4 (r+1) = r k-2, which is the value we needed to compare to F k.
33 Approaching Strong Induction Problems For weak induction, you know exactly what to prove for the base case, and exactly where to start in the inductive step. For strong induction, it s not as clear - the main thing you know is what you want to prove (that the statement works for n=k). This suggests working backwards. Try to make the case for n=k, and figure out along the way how to make use of the inductive hypothesis. You will know which base cases you need only after you figure out your inductive step.
34 Practice Strong Induction: More Fib Facts Reminder: F0 = 0, F1 = 1, F2 = 1, Prove by strong induction: A Fibonacci number is even iff its index is divisible by 3. (So the pattern is even, odd, odd, even, odd, odd, ) You ll probably need to argue some different cases for k.
35 Practice Strong Induction: More Fib Facts Reminder: F 0 = 0, F 1 = 1, F 2 = 1, Prove by strong induction: A Fibonacci number is even iff its index is divisible by 3. Base cases: Illustrated above; F 0 is even, and the others are odd. Inductive step: Suppose the pattern holds up to n < k. Case 1: k divisible by 3. It is the sum of the previous two numbers, which by the inductive hypothesis are odd. The sum of odd numbers is even, which was to be proved. Case 2: k not divisible by 3. Then either k-1 is even and k-2 is odd, or vice versa. In either case, an even plus an odd is odd.
36 A Strong Induction on Trees We ve proven E = V -1 for trees already using weak induction, but it s interesting to see a contrast with a proof by strong induction. The weak argument required a clear way to get a tree exactly one vertex smaller. But with strong induction, we can make arguments about arbitrarily large or small pieces.
37 Strong Induction to Prove E = V -1 Induction on the number of vertices. Base case: V = 1. No edges; E = 0. Check. Inductive step: Suppose the formula holds for all smaller trees than k. We want to show a k-vertex tree must have V -1 edges. We re going to start by removing an arbitrary edge from our tree.
38 Strong Induction to Prove E = V -1 Induction on the number of vertices. Base case: V = 1. No edges; E = 0. Check. Inductive step: Suppose the formula holds for all smaller trees than k. We want to show a k-vertex tree must have V -1 edges. We re going to start by removing an arbitrary edge from our tree. We claim that the two subgraphs that remain must be connected and have no cycles, because these were true of the original tree, so these must be smaller trees. Subtree 1 Subtree 2
39 Strong Induction to Prove Induction on the number of vertices. E = V -1 Base case: V = 1. No edges; E = 0. Check. Inductive step: Suppose the formula holds for all smaller trees than k. We want to show a k-vertex tree must have V -1 edges. We re going to start by removing an arbitrary edge from our tree. We claim that the two subgraphs that remain must be connected and have no cycles, because these were true of the original tree, so these must be smaller trees. By the inductive hypothesis, the formula works for each of them. If they have a and b vertices, respectively, they have a-1 and b-1 edges. Subtree 1 Subtree 2
40 Strong Induction to Prove Induction on the number of vertices. E = V -1 Base case: V = 1. No edges; E = 0. Check. Inductive step: Suppose the formula holds for all smaller trees than k. We want to show a k-vertex tree must have V -1 edges. We re going to start by removing an arbitrary edge from our tree. We claim that the two subgraphs that remain must be connected and have no cycles, because these were true of the original tree, so these must be smaller trees. By the inductive hypothesis, the formula works for each of them. If they have a and b vertices, respectively, they have a-1 and b-1 edges. The original tree must therefore have (a-1)+(b-1) + 1 edges, or (a+b) -1 edges. Since V =a+b, it has V -1 edges.
41 Proving All Degrees Even Implies Euler Cycle Early on in the semester we proved that if you didn t have even degree for all vertices, then you couldn t have an Euler cycle - a path that hit all edges once and ends where it started. That s not the same as claiming that if you do have even degree for all vertices, then you do have an Euler cycle. (These statements are the converse of each other) We didn t prove this because the proof required strong induction.
42 Proving All Degrees Even Implies Euler Cycle Claim: All connected graphs with at least 3 vertices have an Euler cycle if the degree of each vertex is even. Proof: By induction on the number of vertices. Base case: n=3. If the degree of each vertex is even, either the graph isn t connected or it s a triangle, and definitely has a cycle.
43 Proving All Degrees Even Implies Euler Cycle Claim: All connected graphs with at least 3 vertices have an Euler cycle if the degree of each vertex is even. Proof: By induction on the number of vertices. Base case: n=3. If the degree of each vertex is even, either the graph isn t connected or it s a triangle, and definitely has a cycle. Inductive step: Assume true for n < k. Now follow a path on the graph until you hit a vertex already in your path (continuing is always possible because of even degree for all vertices - if you can arrive, you can leave). Mark the cycle you found.
44 Proving All Degrees Even Implies Euler Cycle Claim: All connected graphs with at least 3 vertices have an Euler cycle if the degree of each vertex is even. Proof: By induction on the number of vertices. Base case: n=3. If the degree of each vertex is even, either the graph isn t connected or it s a triangle, and definitely has a cycle. Inductive step: Assume true for n < k. Now follow a path on the graph until you hit a vertex already in your path (continuing is always possible because of even degree for all vertices). Mark the cycle you found. The rest of the graph remains of even degree. By the inductive hypothesis, every connected component that remains besides your cycle has some Euler cycle.
45 Proving All Degrees Even Implies Euler Cycle Claim: All connected graphs with at least 3 vertices have an Euler cycle if the degree of each vertex is even. Proof: By induction on the number of vertices. begin detour! Base case: n=3. If the degree of each vertex is even, either the graph isn t connected or it s a triangle, and definitely has a cycle. resume Inductive step: Assume true for n < k. Now follow a path on the graph until you hit a vertex already in your path (continuing is always possible because of even degree for all vertices). Mark the cycle you found. The rest of the graph remains of even degree. By the inductive hypothesis, every connected component that remains besides your cycle has some Euler cycle. (Attached components must have at least 3 vertices - see diagram at right.) So the final Euler cycle consists of your arbitrary cycle, plus detours to complete every smaller Euler cycle attached to it. Even degree means at least 3 vertices in attached component
46 Another Example of the Euler Cycle Inductive Step
47 Another Example of the Euler Cycle Inductive Step Inductive hypothesis applies to both sides
48 Another Example of the Euler Cycle Inductive Step 2: inside start 3, 5: main cycle 1: outside 4: similar detour to 1,2 Inductive hypothesis applies to both sides
49 When Do I Need Strong Induction? Most proofs by induction in this course will be weak induction. It s a pretty good assumption for many algorithms. But there may come a time when you need the statement to be true for multiple previous instances, or for further back than one step, or something else. Especially if you re dealing with a recurrence (like the Fibonacci numbers). Your own argument dictates whether you need a strong inductive hypothesis. You can then just make the strong assumption instead, and use the cases that you need.
50 Induction Flowchart Did the instructions say prove this by induction? If not, consider proving it a different way. Did the instructions say prove using strong induction, or otherwise suggest strong induction (like with Fibonacci numbers)? If not, try weak induction first. Try proving that if the statement works for k, then it works for k+1. Need to assume that it works for more cases to make your argument? Switch to strong induction. If the statement seems algebraic, use algebra. If it s about graphs or some other structure, figure out how the truth of the smaller case helps you. Show the statement works for all the base cases - the cases your inductive step can t possibly work for (the first case if it s weak induction).
51 Time-Permitting-Exercise: Fish Fish Fish Sometimes in CS we think about parsing things - figuring out whether strings are meaningful or not. Fish can refer either to an animal (noun), or to the act of trying to catch that animal (verb). Thus, Fish fish fish is a valid English sentence that states that there are some cannibalistic fish out there. (noun-verb-noun) I can also make a noun phrase fish fish fish that is talking about the fish who are being hauled up by other fish (noun-noun-verb). A similar construction is mice cats chase for the mice that cats chase. Thus I can say fish fish fish fish meaning the fish who are being fished for by fish, actually go fishing themselves. Assuming it is always legal to replace a noun with a noun phrase, prove that n repetitions of the word fish is always a valid English sentence.
52 n Fish Solution Base cases: n=1. Fish! Parsed as a command. n=2. Fish fish. Noun-verb. n=3. Fish fish fish. Noun-verb-noun. Inductive step: Suppose the sentence is valid for 1 n < k. A sentence with k fish can be parsed the same way as a sentence with k-2 fish, but one of the nouns fish can be replaced with the noun phrase fish fish fish, which we said was always a legal transformation. Thus, if there is a valid parse of k-2 fish, there is a valid parse of k of them. Fish Fish Fish Fish Fish Fish Fish Fish N V N V N NP N N V
53 Induction/Strong Induction Summary Induction generally is a proof technique for arguing that something starts out working (base cases) and keeps working (inductive step) Both strong and weak induction work by reasoning from the fact that the statement has been true so far Weak just argues that each statement follows from the previous one Strong assumes the statement has been true for everything up to now (although it may only make use of particular cases) Strong induction is more common when dealing with complex entities like graphs that don t have an obvious previous step, or when reasoning about values that depend on multiple previous values (Fibonacci) Other proof strategies are often more intuitive, and therefore preferred
CS1800: Mathematical Induction. Professor Kevin Gold
CS1800: Mathematical Induction Professor Kevin Gold Induction: Used to Prove Patterns Just Keep Going For an algorithm, we may want to prove that it just keeps working, no matter how big the input size
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationMath 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes
Math 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes Written by Santiago Cañez These are notes which provide a basic summary of each lecture for Math 300, Foundations of Higher
More informationInduction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2
Induction 0-8-08 Induction is used to prove a sequence of statements P(), P(), P(3),... There may be finitely many statements, but often there are infinitely many. For example, consider the statement ++3+
More informationAlgebra. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This document was written and copyrighted by Paul Dawkins. Use of this document and its online version is governed by the Terms and Conditions of Use located at. The online version of this document is
More informationCS 124 Math Review Section January 29, 2018
CS 124 Math Review Section CS 124 is more math intensive than most of the introductory courses in the department. You re going to need to be able to do two things: 1. Perform some clever calculations to
More informationCS1800: Sequences & Sums. Professor Kevin Gold
CS1800: Sequences & Sums Professor Kevin Gold Moving Toward Analysis of Algorithms Today s tools help in the analysis of algorithms. We ll cover tools for deciding what equation best fits a sequence of
More information(x 1 +x 2 )(x 1 x 2 )+(x 2 +x 3 )(x 2 x 3 )+(x 3 +x 1 )(x 3 x 1 ).
CMPSCI611: Verifying Polynomial Identities Lecture 13 Here is a problem that has a polynomial-time randomized solution, but so far no poly-time deterministic solution. Let F be any field and let Q(x 1,...,
More informationWhat can you prove by induction?
MEI CONFERENCE 013 What can you prove by induction? Martyn Parker M.J.Parker@keele.ac.uk Contents Contents iii 1 Splitting Coins.................................................. 1 Convex Polygons................................................
More informationTutorial on Mathematical Induction
Tutorial on Mathematical Induction Roy Overbeek VU University Amsterdam Department of Computer Science r.overbeek@student.vu.nl April 22, 2014 1 Dominoes: from case-by-case to induction Suppose that you
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationQuadratic Equations Part I
Quadratic Equations Part I Before proceeding with this section we should note that the topic of solving quadratic equations will be covered in two sections. This is done for the benefit of those viewing
More informationAt the start of the term, we saw the following formula for computing the sum of the first n integers:
Chapter 11 Induction This chapter covers mathematical induction. 11.1 Introduction to induction At the start of the term, we saw the following formula for computing the sum of the first n integers: Claim
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More information1 Sequences and Summation
1 Sequences and Summation A sequence is a function whose domain is either all the integers between two given integers or all the integers greater than or equal to a given integer. For example, a m, a m+1,...,
More informationModern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur
Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 02 Groups: Subgroups and homomorphism (Refer Slide Time: 00:13) We looked
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationAlex s Guide to Word Problems and Linear Equations Following Glencoe Algebra 1
Alex s Guide to Word Problems and Linear Equations Following Glencoe Algebra 1 What is a linear equation? It sounds fancy, but linear equation means the same thing as a line. In other words, it s an equation
More informationExample. How to Guess What to Prove
How to Guess What to Prove Example Sometimes formulating P (n) is straightforward; sometimes it s not. This is what to do: Compute the result in some specific cases Conjecture a generalization based on
More informationMath101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2:
Math101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2: 03 17 08 3 All about lines 3.1 The Rectangular Coordinate System Know how to plot points in the rectangular coordinate system. Know the
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationFall 2017 November 10, Written Homework 5
CS1800 Discrete Structures Profs. Aslam, Gold, & Pavlu Fall 2017 November 10, 2017 Assigned: Mon Nov 13 2017 Due: Wed Nov 29 2017 Instructions: Written Homework 5 The assignment has to be uploaded to blackboard
More informationHOMEWORK #2 - MATH 3260
HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is
More informationSection 20: Arrow Diagrams on the Integers
Section 0: Arrow Diagrams on the Integers Most of the material we have discussed so far concerns the idea and representations of functions. A function is a relationship between a set of inputs (the leave
More informationAxiomatic systems. Revisiting the rules of inference. Example: A theorem and its proof in an abstract axiomatic system:
Axiomatic systems Revisiting the rules of inference Material for this section references College Geometry: A Discovery Approach, 2/e, David C. Kay, Addison Wesley, 2001. In particular, see section 2.1,
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 013 Vazirani Note 1 Induction Induction is a basic, powerful and widely used proof technique. It is one of the most common techniques for analyzing
More informationNotes on induction proofs and recursive definitions
Notes on induction proofs and recursive definitions James Aspnes December 13, 2010 1 Simple induction Most of the proof techniques we ve talked about so far are only really useful for proving a property
More informationFall 2017 Test II review problems
Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and
More informationAn Introduction to Mathematical Reasoning
An Introduction to Mathematical Reasoning Matthew M. Conroy and Jennifer L. Taggart University of Washington 2 Version: December 28, 2016 Contents 1 Preliminaries 7 1.1 Axioms and elementary properties
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationCOLLEGE ALGEBRA. Paul Dawkins
COLLEGE ALGEBRA Paul Dawkins Table of Contents Preface... iii Outline... iv Preliminaries... 7 Introduction... 7 Integer Exponents... 8 Rational Exponents...5 Radicals... Polynomials...30 Factoring Polynomials...36
More informationEssential facts about NP-completeness:
CMPSCI611: NP Completeness Lecture 17 Essential facts about NP-completeness: Any NP-complete problem can be solved by a simple, but exponentially slow algorithm. We don t have polynomial-time solutions
More informationGuide to Proofs on Sets
CS103 Winter 2019 Guide to Proofs on Sets Cynthia Lee Keith Schwarz I would argue that if you have a single guiding principle for how to mathematically reason about sets, it would be this one: All sets
More informationP (E) = P (A 1 )P (A 2 )... P (A n ).
Lecture 9: Conditional probability II: breaking complex events into smaller events, methods to solve probability problems, Bayes rule, law of total probability, Bayes theorem Discrete Structures II (Summer
More informationMATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM
MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through
More informationWriting proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction
Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction written by Sarah Peluse, revised by Evangelie Zachos and Lisa Sauermann September 27, 2016 1 Introduction
More informationLECTURE 1. Logic and Proofs
LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and
More informationSection 1.x: The Variety of Asymptotic Experiences
calculus sin frontera Section.x: The Variety of Asymptotic Experiences We talked in class about the function y = /x when x is large. Whether you do it with a table x-value y = /x 0 0. 00.0 000.00 or with
More informationCalculus II. Calculus II tends to be a very difficult course for many students. There are many reasons for this.
Preface Here are my online notes for my Calculus II course that I teach here at Lamar University. Despite the fact that these are my class notes they should be accessible to anyone wanting to learn Calculus
More informationMath 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution
Math 38: Graph Theory Spring 2004 Dartmouth College 1 Introduction On Writing Proofs What constitutes a well-written proof? A simple but rather vague answer is that a well-written proof is both clear and
More informationPEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms
PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION The Peano axioms The following are the axioms for the natural numbers N. You might think of N as the set of integers {0, 1, 2,...}, but it turns
More informationNatural deduction for truth-functional logic
Natural deduction for truth-functional logic Phil 160 - Boston University Why natural deduction? After all, we just found this nice method of truth-tables, which can be used to determine the validity or
More informationHOW TO CREATE A PROOF. Writing proofs is typically not a straightforward, algorithmic process such as calculating
HOW TO CREATE A PROOF ALLAN YASHINSKI Abstract We discuss how to structure a proof based on the statement being proved Writing proofs is typically not a straightforward, algorithmic process such as calculating
More informationTake the Anxiety Out of Word Problems
Take the Anxiety Out of Word Problems I find that students fear any problem that has words in it. This does not have to be the case. In this chapter, we will practice a strategy for approaching word problems
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More information2.1 Convergence of Sequences
Chapter 2 Sequences 2. Convergence of Sequences A sequence is a function f : N R. We write f) = a, f2) = a 2, and in general fn) = a n. We usually identify the sequence with the range of f, which is written
More informationMATH 135 Fall 2006 Proofs, Part IV
MATH 135 Fall 006 s, Part IV We ve spent a couple of days looking at one particular technique of proof: induction. Let s look at a few more. Direct Here we start with what we re given and proceed in a
More informationLecture for Week 2 (Secs. 1.3 and ) Functions and Limits
Lecture for Week 2 (Secs. 1.3 and 2.2 2.3) Functions and Limits 1 First let s review what a function is. (See Sec. 1 of Review and Preview.) The best way to think of a function is as an imaginary machine,
More informationSequences of Real Numbers
Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next
More informationInference and Proofs (1.6 & 1.7)
EECS 203 Spring 2016 Lecture 4 Page 1 of 9 Introductory problem: Inference and Proofs (1.6 & 1.7) As is commonly the case in mathematics, it is often best to start with some definitions. An argument for
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More informationLecture 12 : Recurrences DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/1/2011 Lecture 12 : Recurrences Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last few classes we talked about program correctness. We
More informationThe following are generally referred to as the laws or rules of exponents. x a x b = x a+b (5.1) 1 x b a (5.2) (x a ) b = x ab (5.
Chapter 5 Exponents 5. Exponent Concepts An exponent means repeated multiplication. For instance, 0 6 means 0 0 0 0 0 0, or,000,000. You ve probably noticed that there is a logical progression of operations.
More informationLecture 10: Powers of Matrices, Difference Equations
Lecture 10: Powers of Matrices, Difference Equations Difference Equations A difference equation, also sometimes called a recurrence equation is an equation that defines a sequence recursively, i.e. each
More informationDiscrete Structures Proofwriting Checklist
CS103 Winter 2019 Discrete Structures Proofwriting Checklist Cynthia Lee Keith Schwarz Now that we re transitioning to writing proofs about discrete structures like binary relations, functions, and graphs,
More information3.1 Induction: An informal introduction
Chapter 3 Induction and Recursion 3.1 Induction: An informal introduction This section is intended as a somewhat informal introduction to The Principle of Mathematical Induction (PMI): a theorem that establishes
More informationLogic I - Session 10 Thursday, October 15,
Logic I - Session 10 Thursday, October 15, 2009 1 Plan Re: course feedback Review of course structure Recap of truth-functional completeness? Soundness of SD Thursday, October 15, 2009 2 The course structure
More information3. LIMITS AND CONTINUITY
3. LIMITS AND CONTINUITY Algebra reveals much about many functions. However, there are places where the algebra breaks down thanks to division by zero. We have sometimes stated that there is division by
More informationMath 016 Lessons Wimayra LUY
Math 016 Lessons Wimayra LUY wluy@ccp.edu MATH 016 Lessons LESSON 1 Natural Numbers The set of natural numbers is given by N = {0, 1, 2, 3, 4...}. Natural numbers are used for two main reasons: 1. counting,
More informationMath Circle: Recursion and Induction
Math Circle: Recursion and Induction Prof. Wickerhauser 1 Recursion What can we compute, using only simple formulas and rules that everyone can understand? 1. Let us use N to denote the set of counting
More informationCS 173: Induction. Madhusudan Parthasarathy University of Illinois at Urbana-Champaign. February 7, 2016
CS 173: Induction Madhusudan Parthasarathy University of Illinois at Urbana-Champaign 1 Induction February 7, 016 This chapter covers mathematical induction, and is an alternative resource to the one in
More informationLecture 2: Connecting the Three Models
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 2: Connecting the Three Models David Mix Barrington and Alexis Maciel July 18, 2000
More informationMATH10040: Chapter 0 Mathematics, Logic and Reasoning
MATH10040: Chapter 0 Mathematics, Logic and Reasoning 1. What is Mathematics? There is no definitive answer to this question. 1 Indeed, the answer given by a 21st-century mathematician would differ greatly
More informationNP-Completeness I. Lecture Overview Introduction: Reduction and Expressiveness
Lecture 19 NP-Completeness I 19.1 Overview In the past few lectures we have looked at increasingly more expressive problems that we were able to solve using efficient algorithms. In this lecture we introduce
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More information20.1 2SAT. CS125 Lecture 20 Fall 2016
CS125 Lecture 20 Fall 2016 20.1 2SAT We show yet another possible way to solve the 2SAT problem. Recall that the input to 2SAT is a logical expression that is the conunction (AND) of a set of clauses,
More informationBasics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On
Basics of Proofs The Putnam is a proof based exam and will expect you to write proofs in your solutions Similarly, Math 96 will also require you to write proofs in your homework solutions If you ve seen
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationCosets and Lagrange s theorem
Cosets and Lagrange s theorem These are notes on cosets and Lagrange s theorem some of which may already have been lecturer. There are some questions for you included in the text. You should write the
More informationG E O M E T R Y CHAPTER 2 REASONING AND PROOF. Notes & Study Guide CHAPTER 2 NOTES
G E O M E T R Y CHAPTER 2 REASONING AND PROOF Notes & Study Guide 2 TABLE OF CONTENTS CONDITIONAL STATEMENTS... 3 DEFINTIONS & BICONDITIONAL STATEMENTS... 6 DEDUCTIVE REASONING... 9 REASONING WITH PROPERTIES
More informationQ 2.0.2: If it s 5:30pm now, what time will it be in 4753 hours? Q 2.0.3: Today is Wednesday. What day of the week will it be in one year from today?
2 Mod math Modular arithmetic is the math you do when you talk about time on a clock. For example, if it s 9 o clock right now, then it ll be 1 o clock in 4 hours. Clearly, 9 + 4 1 in general. But on a
More informationMcGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60
McGill University Faculty of Science Solutions to Practice Final Examination Math 40 Discrete Structures Time: hours Marked out of 60 Question. [6] Prove that the statement (p q) (q r) (p r) is a contradiction
More informationThe Basics COPYRIGHTED MATERIAL. chapter. Algebra is a very logical way to solve
chapter 1 The Basics Algebra is a very logical way to solve problems both theoretically and practically. You need to know a number of things. You already know arithmetic of whole numbers. You will review
More informationPHIL 422 Advanced Logic Inductive Proof
PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon
More informationSection 3.1: Direct Proof and Counterexample 1
Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion
More informationAlgebra & Trig Review
Algebra & Trig Review 1 Algebra & Trig Review This review was originally written for my Calculus I class, but it should be accessible to anyone needing a review in some basic algebra and trig topics. The
More informationSection 2.7 Solving Linear Inequalities
Section.7 Solving Linear Inequalities Objectives In this section, you will learn to: To successfully complete this section, you need to understand: Add and multiply an inequality. Solving equations (.1,.,
More informationStudent Instruction Sheet: Unit 3, Lesson 3. Solving Quadratic Relations
Student Instruction Sheet: Unit 3, Lesson 3 Solving Quadratic Relations Suggested Time: 75 minutes What s important in this lesson: In this lesson, you will learn how to solve a variety of quadratic relations.
More informationWhat is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
More informationA Brief Introduction to Proofs
A Brief Introduction to Proofs William J. Turner October, 010 1 Introduction Proofs are perhaps the very heart of mathematics. Unlike the other sciences, mathematics adds a final step to the familiar scientific
More informationMI 4 Mathematical Induction Name. Mathematical Induction
Mathematical Induction It turns out that the most efficient solution to the Towers of Hanoi problem with n disks takes n 1 moves. If this isn t the formula you determined, make sure to check your data
More informationCS280, Spring 2004: Final
CS280, Spring 2004: Final 1. [4 points] Which of the following relations on {0, 1, 2, 3} is an equivalence relation. (If it is, explain why. If it isn t, explain why not.) Just saying Yes or No with no
More informationOne sided tests. An example of a two sided alternative is what we ve been using for our two sample tests:
One sided tests So far all of our tests have been two sided. While this may be a bit easier to understand, this is often not the best way to do a hypothesis test. One simple thing that we can do to get
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationMATH 2200 Final LC Review
MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from
More informationWriting proofs. Tim Hsu, San José State University. May 31, Definitions and theorems 3. 2 What is a proof? 3. 3 A word about definitions 4
Writing proofs Tim Hsu, San José State University May 31, 2006 Contents I Fundamentals 3 1 Definitions and theorems 3 2 What is a proof? 3 3 A word about definitions 4 II The structure of proofs 6 4 Assumptions
More informationHandout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte
Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a
More informationDescriptive Statistics (And a little bit on rounding and significant digits)
Descriptive Statistics (And a little bit on rounding and significant digits) Now that we know what our data look like, we d like to be able to describe it numerically. In other words, how can we represent
More informationBasic Logic and Proof Techniques
Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely
More informationMath 414, Fall 2016, Test I
Math 414, Fall 2016, Test I Dr. Holmes September 23, 2016 The test begins at 10:30 am and ends officially at 11:45 am: what will actually happen at 11:45 is that I will give a five minute warning. The
More informationNondeterministic finite automata
Lecture 3 Nondeterministic finite automata This lecture is focused on the nondeterministic finite automata (NFA) model and its relationship to the DFA model. Nondeterminism is an important concept in the
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
More informationPlease bring the task to your first physics lesson and hand it to the teacher.
Pre-enrolment task for 2014 entry Physics Why do I need to complete a pre-enrolment task? This bridging pack serves a number of purposes. It gives you practice in some of the important skills you will
More informationMA103 STATEMENTS, PROOF, LOGIC
MA103 STATEMENTS, PROOF, LOGIC Abstract Mathematics is about making precise mathematical statements and establishing, by proof or disproof, whether these statements are true or false. We start by looking
More informationFibonacci mod k. In this section, we examine the question of which terms of the Fibonacci sequence have a given divisor k.
Fibonacci mod k I start by giving out a table of the first 0 Fibonacci numbers actually the first, because we begin with u 0 =0 (and I have a reason for that which will soon become apparent). Okay, which
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More information, p 1 < p 2 < < p l primes.
Solutions Math 347 Homework 1 9/6/17 Exercise 1. When we take a composite number n and factor it into primes, that means we write it as a product of prime numbers, usually in increasing order, using exponents
More information