Summer HSSP Week 1 Homework. Lane Gunderman, Victor Lopez, James Rowan

Similar documents
Summer HSSP Lecture Notes Week 1. Lane Gunderman, Victor Lopez, James Rowan

Summer HSSP Lecture Notes. Lane Gunderman

Discrete Mathematics. Spring 2017

MATH10040: Numbers and Functions Homework 1: Solutions

Proofs Not Based On POMI

Climbing an Infinite Ladder

MATH CSE20 Homework 5 Due Monday November 4

Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction

Direct Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24

In Exercises 1 12, list the all of the elements of the given set. 2. The set of all positive integers whose square roots are less than or equal to 3

Proofs Not Based On POMI

Senior Math Circles November 19, 2008 Probability II

Mathematical Induction Assignments

REVIEW Chapter 1 The Real Number System

(3,1) Methods of Proof

Axioms for the Real Number System

Chapter 3: Factors, Roots, and Powers

What can you prove by induction?

CSC 344 Algorithms and Complexity. Proof by Mathematical Induction

Tenth Bit Bank Mathematics Real Numbers

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. College Algebra for STEM

Contradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730

Section 2.1: Introduction to the Logic of Quantified Statements

(4) Using results you have studied, show that if x, y are real numbers,

Discrete Math I Exam II (2/9/12) Page 1

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Some Review Problems for Exam 1: Solutions

Climbing an Infinite Ladder

Algebra Summer Review Packet

1 Implication and induction

Solutions to Practice Final

, p 1 < p 2 < < p l primes.

CSE 20. Final Review. CSE 20: Final Review

MATH 271 Summer 2016 Practice problem solutions Week 1

Sect Least Common Denominator

CISC-102 Fall 2017 Week 3. Principle of Mathematical Induction

0.Axioms for the Integers 1

CSC 125 :: Final Exam December 14, 2011

(4.2) Equivalence Relations. 151 Math Exercises. Malek Zein AL-Abidin. King Saud University College of Science Department of Mathematics

Introduction to Induction (LAMC, 10/14/07)

Solutions to Homework Set 1

SUMMER MATH PACKET ADVANCED ALGEBRA A COURSE 215

One-to-one functions and onto functions

Mathematical Induction. EECS 203: Discrete Mathematics Lecture 11 Spring

Problem Set 5 Solutions

Mathematics. Algebra I (PreAP, Pt. 1, Pt. 2) Curriculum Guide. Revised 2016

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2

Math 319 Problem Set #2 Solution 14 February 2002

Honors Geometry/Trigonometry course 4524/4525 Desert Mountain High School Math Department

NUMBERS( A group of digits, denoting a number, is called a numeral. Every digit in a numeral has two values:

At the start of the term, we saw the following formula for computing the sum of the first n integers:

LESSON 8.1 RATIONAL EXPRESSIONS I

MATHEMATICAL INDUCTION

UNIT 4 NOTES: PROPERTIES & EXPRESSIONS

CHAPTER 1 REAL NUMBERS KEY POINTS

Homework 1 2/7/2018 SOLUTIONS Exercise 1. (a) Graph the following sets (i) C = {x R x in Z} Answer:

Notes: Pythagorean Triples

PRINCIPLE OF MATHEMATICAL INDUCTION

MATH 402 : 2017 page 1 of 6

NAME DATE PERIOD. A negative exponent is the result of repeated division. Extending the pattern below shows that 4 1 = 1 4 or 1. Example: 6 4 = 1 6 4

Some Review Problems for Exam 3: Solutions

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

Warm-up Quantifiers and the harmonic series Sets Second warmup Induction Bijections. Writing more proofs. Misha Lavrov

PRACTICE PROBLEMS: SET 1

Properties of the Integers

M381 Number Theory 2004 Page 1

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

LESSON 9.1 ROOTS AND RADICALS

Basic Fraction and Integer Operations (No calculators please!)

Mathematics 228(Q1), Assignment 2 Solutions

Why write proofs? Why not just test and repeat enough examples to confirm a theory?

At least one of us is a knave. What are A and B?

Contribution of Problems

Section 4.2: Mathematical Induction 1

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution

Solutions to Tutorial for Week 4

LESSON 7.1 FACTORING POLYNOMIALS I

Basic Proof Techniques

Inference and Proofs (1.6 & 1.7)

. As the binomial coefficients are integers we have that. 2 n(n 1).

CS 246 Review of Proof Techniques and Probability 01/14/19

MATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions

Introduction: Pythagorean Triplets

Lecture 4: Constructing the Integers, Rationals and Reals

Homework 3: Solutions

Solutions to Assignment 1

Computer Science Section 1.6

Carmen s Core Concepts (Math 135)

9.2 Multiplication Properties of Radicals

3 The language of proof

2301 Assignment 1 Due Friday 19th March, 2 pm

Cool Results on Primes

Mathematics Review for Business PhD Students Lecture Notes

P.1: Algebraic Expressions, Mathematical Models, and Real Numbers

Math 11 Foundations: Unit 1 - Logic. Unit 1: Logic

Questionnaire for CSET Mathematics subset 1

Unit 3 Day 4. Solving Equations with Rational Exponents and Radicals

Rings, Integral Domains, and Fields

Practice Test III, Math 314, Spring 2016

CS280, Spring 2004: Final

Transcription:

Summer HSSP Week 1 Homework Lane Gunderman, Victor Lopez, James Rowan July 9, 2014

Questions 1

Chapter 1 Homework Questions These are the questions that should be turned in as homework. As mentioned in class, do as many as you like. In general (*) marked questions are straight forward, (**) marked questions require a little bit of cleverness, (***) requires a fair amount of cleverness and or care, while (****) are questions that would challenge the teachers to some degree, and lastly (*****) marked questions are unsolved questions in math, which are meant merely to challenge the most advanced students and introduce everyone to really tough problems. Generally speaking, you should be at the point of fully understanding the material if you are able to do most of the (*) questions in a section and some of the (**) questions. Anything beyond that is for extra practice, and may be so accordingly rewarded at the end of the class series. We ll see. 1.0.1 Questions for chapter 2 Categorize the following numbers: (*)1. 2; 1; 0; 2; π; 3 2 (*)2. 16384 32 ; 0. 7; 11 (**)3. 2 + 2 + 2 + 2 +... (*)4. (infinity) Decide which of the following numbers are prime: (*)5. 2; 5; 8; 0; 51; 1 (**)6. -17; 13689; 52841 (***)7. 89575378759; 852895895231; 3554389342359862463 2

Decide whether the following pairs of numbers are relatively prime: (*)8. 2 and 3 (*)9. 21 and 36 (*)10. 216 and 144 (*)11. 121 and 169 (**)12. 40123 and 7433 (**)13. 13 and 131313131313131313131313...1313131313...131313 1.0.2 Questions for chapter 3 Prove the values that solve the following using the standard set of equality postulates: (*)1. 6x+2=3x+5 (*)2. 2x+3y=2 and 2x+4y=4 (**)3. 12x+2y=6 and 15x+3z=9 and 4y+5z=-71 1.0.3 Questions for chapter 4 Find appropriate counter-examples where possible (not all are possible to find counter-examples for): (*)1. Proposition: In the interval [0,1) there are more natural numbers than irrational numbers. (*)2. Proposition: x 2 + 4x + 5 = 0 has no real values of x which satisfy the equation. (*)3. Proposition: Everyone in your immediate family is left-handed. (**)4. Proposition: There are no other triplet primes than 3,5,7. (**)5. Proposition: define a perfect number as a number whose sum of all factors (prime and composite) are equal to twice its value. For example, 6 has factors 1, 2, 3, 6, which sum to 12. We also notice that 28 is a perfect number. I propose that there are no other perfect numbers than 6 and 28. (*****)6. Proposition: define a perfect number as above. I propose that there are no odd perfect numbers. 3

1.0.4 Questions for chapter 5 Prove the following using induction: (*)1. Σ2f(i) = 2Σf(i) (*)2. n 1 i=0 (2i + 1) = n2 (**)3. n i=0 i3 = ( n i=0 i)2 n (**)4. i=1 ( 1 2 )i = 1 n+1 ( 1 2 )i. This one is a little less formal than one might desire, as not very well defined, nor is it clear that is a natural number. This still serves as practice. (*)5. n i=0 i2 = n(n+1)(2n+1) 6 These are somewhat different than the previous examples (in that they are not summation proofs): (*)6. Prove that 8 n 3 n is divisible by 5, n 1 (*)7. Prove that n 3 n is always divisible by 6, n 2. Hint: factoring might help, also it might be useful to show that this is divisible by 2 and by 3, rather than jump straight to 6 (**)8. Prove that 2 n+2 + 3 2n+1 is divisible by 7, n 1 (**)9. Prove that 11 n 6 is divisible by 5, n 1 (*)10. Prove n i i=1 i+1 = 1 n+1. [n.b.: The symbol Π is like Σ except instead of adding progressive terms, successive terms are multiplied together.] (****)11. Attempt to prove that: i ai n n i a i Where a i is a set of positive numbers. This is true, but challenging. (**)12. The following is a proof by mathematical induction that everyone has the same birthday. Find the flaw in the proof. Explain. Property P(n): Every member of a set of n distinct people has the same birthday. Basis of induction: Since a set of one person has only one birthday, so P(1) is true. Inductive step: Assume P(k) is true for a positive integer k, we will show that P(k+1) is also true. For a set A = {a 1, a 2, a 3,...a k+1 } of k+1 distinct people, consider two subsets B = {a 1, a 2, a 3...a k } and C = {a 2, a 3...a k+1 } each with k distinct people, 4

obtained respectively by removing the last and first person from the set A. By the inductive assumption, every member of set B has the same birthday x, and every member of set C has the same birthday y. Since the two sets B and C have a 2, a 3...a k in common, the two birthdays x and y must be the same. As a result, every member of the set A has the same birthday and we have shown P(k+1) is true based on the inductive hypothesis that P(k) is true. 1.0.5 Questions for chapter 6 (*)1. Prove 3 is irrational (**)2. Prove the following set of statements: the product of two positive numbers is positive the product of two negative numbers is positive the produce of a positive and a negative number is negative (**)3. Prove the following statements: the product of two even numbers is an even number the product of two odd numbers is an odd number the product of an even number and an odd number is an even number (*)4. Prove that the difference between an irrational number and a rational number must be irrational. (*)5. Prove that if a number m is rational, and the product mn is irrational, then n must be irrational. 1.0.6 Questions for chapter 7 (*)1. How many rolls of a 6-sided die are needed to ensure that a repeated roll occurs? (*)2. How many rolls of an n-sided die are needed to ensure that a repeated roll occurs? (**)3. How many real numbers do we need to pick between 0 and 1 so that we have an ensured repeat? 5