![goldwinner300](/avatars/48016.jpg)
goldwinner300
18.03.2020 •
Mathematics
Let S be the subset of the set of ordered pairs of integers defined recursively by: Basis Step: (0,0)∈S. Recursive Step: If (a,b)∈S, then (a+4,b+5)∈S and (a+5,b+4)∈S. a) List the elements of S produced by the basis step plus the first 3 applications of the recursive step in the definition. b) Use strong induction on the number of applications of the recursive step of the definition of set S given above to show that 9 "divides" (a+b) [or that (a+b) is a multiple of 9] when (a,b)∈S. That is, show that for any (a,b)∈S obtained by n≥0 applications of the recursive step of the definition of S, (a+b) = 9m for some integer m. This is equivalent to proving that set S is a subset of the multiples of 9. Be sure to use strong induction. [Note that the only difference in a proof by induction versus one by strong induction is that the inductive hypothesis is "stronger".]
Solved
Show answers
More tips
- S Society and Politics How Could Nobody Know About the Dead Mountaineers?...
- H Health and Medicine How to Cure Adenoids?...
- H Health and Medicine Why Wearing a Back Brace Can Be Beneficial During Back Strain?...
- S Sport When and Where Will the 2014 World Cup be Held?...
- C Computers and Internet How to Choose a Monitor?...
- H Horoscopes, Magic, Divination Where Did Tarot Cards Come From?...
- S Style and Beauty How to Make Your Lips Fuller? Ideas and Tips for Beautiful Lips...
- C Computers and Internet How to Learn to Type Fast?...
Answers on questions: Mathematics
- M Mathematics Europa2433 why would you delete my question it was very important...
- M Mathematics Solve for b. 24 = -6b...
- B Biology If the shape of an object is irregular like a stone how can you measure its volume...
- M Mathematics Describe the association between a person s height and their name....
Ответ:
400x +36000 divide by 400
x=90%