If n is odd, then 3n + 7 is even.


 Elwin O’Connor’
 2 years ago
 Views:
Transcription
1
2 Proof:
3 Proof: We suppose...
4 that 3n + 7 is even.
5 that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1.
6 that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. By substituting for n and using algebra, we get 3n + 7 = 3(2k + 1) + 7
7 that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. By substituting for n and using algebra, we get 3n + 7 = 3(2k + 1) + 7 3n + 7 = 6k
8 that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. By substituting for n and using algebra, we get 3n + 7 = 3(2k + 1) + 7 3n + 7 = 6k n + 7 = 6k + 10
9 that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. By substituting for n and using algebra, we get 3n + 7 = 3(2k + 1) + 7 3n + 7 = 6k n + 7 = 6k n + 7 = 2(3k + 5).
10 that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. By substituting for n and using algebra, we get 3n + 7 = 3(2k + 1) + 7 3n + 7 = 6k n + 7 = 6k n + 7 = 2(3k + 5). Since k is an integer, 3k + 5 is also an integer because integers are closed under addition and multiplication.
11 that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. By substituting for n and using algebra, we get 3n + 7 = 3(2k + 1) + 7 3n + 7 = 6k n + 7 = 6k n + 7 = 2(3k + 5). Since k is an integer, 3k + 5 is also an integer because integers are closed under addition and multiplication. If we let q be the integer 3k + 5, then by substitution we have shown 3n + 7 = 2q.
12 that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. By substituting for n and using algebra, we get 3n + 7 = 3(2k + 1) + 7 3n + 7 = 6k n + 7 = 6k n + 7 = 2(3k + 5). Since k is an integer, 3k + 5 is also an integer because integers are closed under addition and multiplication. If we let q be the integer 3k + 5, then by substitution we have shown 3n + 7 = 2q. Therefore, if n is an odd integer, we have shown that 3n + 7 is even.
13 that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. By substituting for n and using algebra, we get 3n + 7 = 3(2k + 1) + 7 3n + 7 = 6k n + 7 = 6k n + 7 = 2(3k + 5). Since k is an integer, 3k + 5 is also an integer because integers are closed under addition and multiplication. If we let q be the integer 3k + 5, then by substitution we have shown 3n + 7 = 2q. Therefore, if n is an odd integer, we have shown that 3n + 7 is even.
14 Alternative proof: that 3n + 7 is even. Since n is odd, there exists an integer k so that n = 2k + 1. By substituting for n and using algebra, we get 3n + 7 = 3(2k + 1) + 7 = 6k = 6k + 10 = 2(3k + 5) = 2q, where q = 3k +5 is an integer because k is an integer, and integers are closed under addition and multiplication. Therefore, we have shown that 3n + 7 is even when n is an odd integer. QED
15 Writing Guidelines We do not consider a proof complete until there is a wellwritten proof.
16 Writing Guidelines We do not consider a proof complete until there is a wellwritten proof. 0. Do all of the thinking, work, and planning first. A KnowShow table or outline or notes or scratch work should be completed prior to writing so you can focus on quality writing, not math.
17 Writing Guidelines We do not consider a proof complete until there is a wellwritten proof. 0. Do all of the thinking, work, and planning first. A KnowShow table or outline or notes or scratch work should be completed prior to writing so you can focus on quality writing, not math. 1. Begin with a carefully worded statement of the theorem or result to be proven. State what you are about to prove. Below that write Proof and begin writing.
18 Writing Guidelines We do not consider a proof complete until there is a wellwritten proof. 0. Do all of the thinking, work, and planning first. A KnowShow table or outline or notes or scratch work should be completed prior to writing so you can focus on quality writing, not math. 1. Begin with a carefully worded statement of the theorem or result to be proven. State what you are about to prove. Below that write Proof and begin writing. 2. Begin the proof with a statement of assumptions. We assume (the hypothesis)... or Suppose (the hypothesis)...
19 Writing Guidelines We do not consider a proof complete until there is a wellwritten proof. 0. Do all of the thinking, work, and planning first. A KnowShow table or outline or notes or scratch work should be completed prior to writing so you can focus on quality writing, not math. 1. Begin with a carefully worded statement of the theorem or result to be proven. State what you are about to prove. Below that write Proof and begin writing. 2. Begin the proof with a statement of assumptions. We assume (the hypothesis)... or Suppose (the hypothesis) Use the pronoun we. Mathematicians are a loving community that does everything together. Do not use I, my, you or similar pronouns in writing proofs. It is our convention that we use the pronouns we and our and us.
20 Writing Guidelines Continued Use italics for variables when typing. 5. Display important equations and mathematical expressions. They should be centered and wellaligned. 6. Tell the reader when you are done. Give some form of QED: Quod Erat Demonstrandum  which was to be demonstrated. Use whatever symbol you like: or or or or $.
Full and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More information2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.
2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then
More informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationNotes from February 11
Notes from February 11 Math 130 Course web site: www.courses.fas.harvard.edu/5811 Two lemmas Before proving the theorem which was stated at the end of class on February 8, we begin with two lemmas. The
More informationIntroduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
More informationPythagorean Triples Pythagorean triple similar primitive
Pythagorean Triples One of the most farreaching problems to appear in Diophantus Arithmetica was his Problem II8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationSolutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014
Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationIndiana State Core Curriculum Standards updated 2009 Algebra I
Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and
More informationWarm up. Connect these nine dots with only four straight lines without lifting your pencil from the paper.
Warm up Connect these nine dots with only four straight lines without lifting your pencil from the paper. Sometimes we need to think outside the box! Warm up Solution Warm up Insert the Numbers 1 8 into
More informationSOLVING POLYNOMIAL EQUATIONS
C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra
More informationDoug Ravenel. October 15, 2008
Doug Ravenel University of Rochester October 15, 2008 s about Euclid s Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationThe Foundations: Logic and Proofs. Chapter 1, Part III: Proofs
The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationAppendix F: Mathematical Induction
Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another
More informationSection 62 Mathematical Induction
6 Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationMath Circle Beginners Group October 18, 2015
Math Circle Beginners Group October 18, 2015 Warmup problem 1. Let n be a (positive) integer. Prove that if n 2 is odd, then n is also odd. (Hint: Use a proof by contradiction.) Suppose that n 2 is odd
More informationCollatz Sequence. Fibbonacci Sequence. n is even; Recurrence Relation: a n+1 = a n + a n 1.
Fibonacci Roulette In this game you will be constructing a recurrence relation, that is, a sequence of numbers where you find the next number by looking at the previous numbers in the sequence. Your job
More informationSECTION 102 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationWorksheet on induction Calculus I Fall 2006 First, let us explain the use of for summation. The notation
Worksheet on induction MA113 Calculus I Fall 2006 First, let us explain the use of for summation. The notation f(k) means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other
More informationThe Factor Theorem and a corollary of the Fundamental Theorem of Algebra
Math 421 Fall 2010 The Factor Theorem and a corollary of the Fundamental Theorem of Algebra 27 August 2010 Copyright 2006 2010 by Murray Eisenberg. All rights reserved. Prerequisites Mathematica Aside
More information6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives
6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More informationFinite Sets. Theorem 5.1. Two nonempty finite sets have the same cardinality if and only if they are equivalent.
MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we
More informationDigitalCommons@University of Nebraska  Lincoln
University of Nebraska  Lincoln DigitalCommons@University of Nebraska  Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 71007 Pythagorean Triples Diane Swartzlander University
More informationOutline. Cryptography. Bret Benesh. Math 331
Outline 1 College of St. Benedict/St. John s University Department of Mathematics Math 331 2 3 The internet is a lawless place, and people have access to all sorts of information. What is keeping people
More informationMTH124: Honors Algebra I
MTH124: Honors Algebra I This course prepares students for more advanced courses while they develop algebraic fluency, learn the skills needed to solve equations, and perform manipulations with numbers,
More informationLecture Notes on Polynomials
Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex
More informationWelcome to Math 19500 Video Lessons. Stanley Ocken. Department of Mathematics The City College of New York Fall 2013
Welcome to Math 19500 Video Lessons Prof. Department of Mathematics The City College of New York Fall 2013 An important feature of the following Beamer slide presentations is that you, the reader, move
More informationCongruent Numbers, the Rank of Elliptic Curves and the Birch and SwinnertonDyer Conjecture. Brad Groff
Congruent Numbers, the Rank of Elliptic Curves and the Birch and SwinnertonDyer Conjecture Brad Groff Contents 1 Congruent Numbers... 1.1 Basic Facts............................... and Elliptic Curves.1
More informationMath 313 Lecture #10 2.2: The Inverse of a Matrix
Math 1 Lecture #10 2.2: The Inverse of a Matrix Matrix algebra provides tools for creating many useful formulas just like real number algebra does. For example, a real number a is invertible if there is
More informationCongruent Number Problem
University of Waterloo October 28th, 2015 Number Theory Number theory, can be described as the mathematics of discovering and explaining patterns in numbers. There is nothing in the world which pleases
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationMathematical induction. Niloufar Shafiei
Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
More informationProperties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
More informationFACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS
International Electronic Journal of Algebra Volume 6 (2009) 95106 FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS Sándor Szabó Received: 11 November 2008; Revised: 13 March 2009
More informationSOLUTIONS FOR PROBLEM SET 2
SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such
More informationTrigonometric Functions and Equations
Contents Trigonometric Functions and Equations Lesson 1 Reasoning with Trigonometric Functions Investigations 1 Proving Trigonometric Identities... 271 2 Sum and Difference Identities... 276 3 Extending
More informationAlgebra I. In this technological age, mathematics is more important than ever. When students
In this technological age, mathematics is more important than ever. When students leave school, they are more and more likely to use mathematics in their work and everyday lives operating computer equipment,
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationCS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers
CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationProofs are short works of prose and need to be written in complete sentences, with mathematical symbols used where appropriate.
Advice for homework: Proofs are short works of prose and need to be written in complete sentences, with mathematical symbols used where appropriate. Even if a problem is a simple exercise that doesn t
More informationThe program also provides supplemental modules on topics in geometry and probability and statistics.
Algebra 1 Course Overview Students develop algebraic fluency by learning the skills needed to solve equations and perform important manipulations with numbers, variables, equations, and inequalities. Students
More informationAPPLICATIONS OF THE ORDER FUNCTION
APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and
More informationRemembering Ray s Lecture: e is Transcendental
Remembering Ray s Lecture: e is Transcendental Mike Raugh Michael.Raugh@gmail.com http://mikeraugh.org Companion to a presentation at The High School Math Contest Los Angeles City College March 28, 2009
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More informationTEXAS A&M UNIVERSITY. Prime Factorization. A History and Discussion. Jason R. Prince. April 4, 2011
TEXAS A&M UNIVERSITY Prime Factorization A History and Discussion Jason R. Prince April 4, 2011 Introduction In this paper we will discuss prime factorization, in particular we will look at some of the
More informationIf A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?
Problem 3 If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C? Suggested Questions to ask students about Problem 3 The key to this question
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the
More informationIntroduction to Proofs
Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are
More information1 Introductory Comments. 2 Bayesian Probability
Introductory Comments First, I would like to point out that I got this material from two sources: The first was a page from Paul Graham s website at www.paulgraham.com/ffb.html, and the second was a paper
More informationIn a triangle with a right angle, there are 2 legs and the hypotenuse of a triangle.
PROBLEM STATEMENT In a triangle with a right angle, there are legs and the hypotenuse of a triangle. The hypotenuse of a triangle is the side of a right triangle that is opposite the 90 angle. The legs
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationAnswer Key for California State Standards: Algebra I
Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.
More information12 Greatest Common Divisors. The Euclidean Algorithm
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 12 Greatest Common Divisors. The Euclidean Algorithm As mentioned at the end of the previous section, we would like to
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationSection 4.3 Image and Inverse Image of a Set
Section 43 Image and Inverse Image of a Set Purpose of Section: To introduce the concept of the image and inverse image of a set We show that unions of sets are preserved under a mapping whereas only onetoone
More informationNOT AN OFFICIAL SCORE REPORT. Summary of Results
From SAT TEST MARCH 8, 214 Summary of Results Page 1 of 1 Congratulations on taking the SAT Reasoning Test! You re showing colleges that you are serious about getting an education. The SAT is one indicator
More information3. Applications of Number Theory
3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a
More informationLinear Equations in One Variable
Linear Equations in One Variable MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this section we will learn how to: Recognize and combine like terms. Solve
More informationChapter 1  Matrices & Determinants
Chapter 1  Matrices & Determinants Arthur Cayley (August 16, 1821  January 26, 1895) was a British Mathematician and Founder of the Modern British School of Pure Mathematics. As a child, Cayley enjoyed
More informationTaylor Polynomials and Taylor Series Math 126
Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will
More informationInstructions for SA Completion
Instructions for SA Completion 1 Take notes on these Pythagorean Theorem Course Materials then do and check the associated practice questions for an explanation on how to do the Pythagorean Theorem Substantive
More informationA Hajós type result on factoring finite abelian groups by subsets II
Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is
More information3.4 Complex Zeros and the Fundamental Theorem of Algebra
86 Polynomial Functions.4 Complex Zeros and the Fundamental Theorem of Algebra In Section., we were focused on finding the real zeros of a polynomial function. In this section, we expand our horizons and
More informationIntroduction to Mathematics for Software Engineering
Introduction to Mathematics for Software Engineering SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier
More informationAn Innocent Investigation
An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number
More informationIteration, Induction, and Recursion
CHAPTER 2 Iteration, Induction, and Recursion The power of computers comes from their ability to execute the same task, or different versions of the same task, repeatedly. In computing, the theme of iteration
More informationMATH 22. THE FUNDAMENTAL THEOREM of ARITHMETIC. Lecture R: 10/30/2003
MATH 22 Lecture R: 10/30/2003 THE FUNDAMENTAL THEOREM of ARITHMETIC You must remember this, A kiss is still a kiss, A sigh is just a sigh; The fundamental things apply, As time goes by. Herman Hupfeld
More informationApplications of Methods of Proof
CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The settheoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are
More informationInduction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition
Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing
More informationYear 12 Pure Mathematics. C1 Coordinate Geometry 1. Edexcel Examination Board (UK)
Year 1 Pure Mathematics C1 Coordinate Geometry 1 Edexcel Examination Board (UK) Book used with this handout is Heinemann Modular Mathematics for Edexcel AS and ALevel, Core Mathematics 1 (004 edition).
More informationProof of Infinite Number of Fibonacci Primes. Stephen Marshall. 22 May Abstract
Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist. The approach
More informationSECTION 14 Absolute Value in Equations and Inequalities
14 Absolute Value in Equations and Inequalities 37 SECTION 14 Absolute Value in Equations and Inequalities Absolute Value and Distance Absolute Value in Equations and Inequalities Absolute Value and
More information0.8 Rational Expressions and Equations
96 Prerequisites 0.8 Rational Expressions and Equations We now turn our attention to rational expressions  that is, algebraic fractions  and equations which contain them. The reader is encouraged to
More information22 Proof Proof questions. This chapter will show you how to:
22 Ch22 537544.qxd 23/9/05 12:21 Page 537 4 4 3 9 22 537 2 2 a 2 b This chapter will show you how to: tell the difference between 'verify' and 'proof' prove results using simple, stepbystep chains of
More informationDIVISORS IN A DEDEKIND DOMAIN. Javier Cilleruelo and Jorge JiménezUrroz. 1 Introduction
DIVISORS IN A DEDEKIND DOMAIN Javier Cilleruelo and Jorge JiménezUrroz 1 Introduction Let A be a Dedekind domain in which we can define a notion of distance. We are interested in the number of divisors
More informationTHE PYTHAGOREAN THEOREM
THE PYTHAGOREAN THEOREM a 2 + b 2 = c 2 CFE 3285V OPEN CAPTIONED ALLIED VIDEO CORPORTATION 1993 Grade Levels: 912 14 minutes DESCRIPTION Reviews the definition of a right triangle before a brief history
More informationVariables in Mathematics Education
Variables in Mathematics Education Susanna S. Epp DePaul University, Department of Mathematical Sciences, Chicago, IL 60614, USA http://www.springer.com/lncs Abstract. This paper suggests that consistently
More informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More informationMathematical Induction. Mary Barnes Sue Gordon
Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by
More informationVerifying Specifications with Proof Scores in CafeOBJ
Verifying Specifications with Proof Scores in CafeOBJ FUTATSUGI, Kokichi 二 木 厚 吉 Chair of Language Design Graduate School of Information Science Japan Advanced Institute of Science and Technology (JAIST)
More informationNo Solution Equations Let s look at the following equation: 2 +3=2 +7
5.4 Solving Equations with Infinite or No Solutions So far we have looked at equations where there is exactly one solution. It is possible to have more than solution in other types of equations that are
More informationGeometry Chapter 2: Geometric Reasoning Lesson 1: Using Inductive Reasoning to Make Conjectures Inductive Reasoning:
Geometry Chapter 2: Geometric Reasoning Lesson 1: Using Inductive Reasoning to Make Conjectures Inductive Reasoning: Conjecture: Advantages: can draw conclusions from limited information helps us to organize
More informationVocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.
CHAPTER Vocabulary The table contains important vocabulary terms from Chapter. As you work through the chapter, fill in the page number, definition, and a clarifying example. biconditional statement conclusion
More informationZeros of Polynomial Functions
Review: Synthetic Division Find (x 25x  5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 35x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 35x 2 + x + 2. Zeros of Polynomial Functions Introduction
More informationAnnouncements. CS243: Discrete Structures. More on Cryptography and Mathematical Induction. Agenda for Today. Cryptography
Announcements CS43: Discrete Structures More on Cryptography and Mathematical Induction Işıl Dillig Class canceled next Thursday I am out of town Homework 4 due Oct instead of next Thursday (Oct 18) Işıl
More informationAdversary Modelling 1
Adversary Modelling 1 Evaluating the Feasibility of a Symbolic Adversary Model on Smart Transport Ticketing Systems Authors Arthur Sheung Chi Chan, MSc (Royal Holloway, 2014) Keith Mayes, ISG, Royal Holloway
More information