153k views
3 votes
Give a recursive definition of each of these sets of ordered pairs of positive integers. (Hint: plot the points in the set in the plane and look for lines containing points in the set. 1. S=(a, b) I a E Z+, b Ñ Z+ , and a 2. S= a + b 3. S={(a, b) | a Ñ Z+ , b Ñ Z+ , and a + b is odd) a) (1,2) S, (2, 1) E S and if (a, b) S then (a + 2, b) E S, (a, b + 2) E S and (a + 1, b + 1) E S b) (1,2) es, (2, 1) Ñ Sand if (a, b) Ñ S then (a + 3, b) Ñ s, (a, b + 3) Ñ s, (a+1, b + 2) ES and (a + 2, b + 1) Ñ s c) (1,1) Ñ Sand if (a, a) Ñ Sthen (a + 1, a + 1) Ñ S and if (a, b) Ñ S, then (a, b + a) Ñ s

User Thepoetdj
by
7.7k points

1 Answer

5 votes

Answer:

1. s=gfcgj sdgc

gzgixxhcxc

vxtuixzdfhvxxgjknn

jfhujhgcxvjkmvcghj

mvhuiknbb5542698755

8423675369

8823

User Nasenbaer
by
8.4k points

No related questions found

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories