subject
Mathematics, 07.08.2019 06:10 lnelson9127

26. let s be the set of positive integers defined by to 913 basis step: 1e s recursive step: if n e s, then 3n+2 e s and n2 e s. a) show that if n e s, thenn = 1 (mod 4). b) show that there exists an integer m 1 (mod 4) that does not belong to s

ansver
Answers: 2

Another question on Mathematics

question
Mathematics, 21.06.2019 19:00
What is the expression in factored form? -x^2 + 3x + 28 a. (x-7)(x-4) b. -(x-7)(x+4) c. (x+4)(x+7) d. -(x-4)(x+7)
Answers: 2
question
Mathematics, 21.06.2019 23:00
Of the 304 people who attended a school play, 5/8 were students. how many of the people who attended were students.
Answers: 1
question
Mathematics, 22.06.2019 02:00
What is the area of this figure. select from the drop down box menu to correctly complete the statement shows a rectangle 3in. by 16in. and a trapezoid center is 10 in. by 5 in. answers are 128 136 153 258
Answers: 2
question
Mathematics, 22.06.2019 04:00
Ahealth-food producer has 250 samples of a new snack to distribute in the mall. the producer has to keep at least 50 samples for display in the health food for the product launch. how long will the samples last if consumers are taking the samples at a rate of 25 every hour
Answers: 2
You know the right answer?
26. let s be the set of positive integers defined by to 913 basis step: 1e s recursive step: if n...
Questions
Questions on the website: 13722362