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 17:00
Evaluate the expression for the given value of the variable. 5Γ—(h+3) for h=7
Answers: 1
question
Mathematics, 21.06.2019 19:00
Is this a polynomial function? i need to know asap
Answers: 2
question
Mathematics, 22.06.2019 00:00
Heather is a cashier. she can ring up 1212 customers in 99 minutes. at this rate, how many minutes does it take her to ring up 44 customers?
Answers: 1
question
Mathematics, 22.06.2019 00:10
How do i take any fraction and make it into a decimal or percentage?
Answers: 1
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
question
Mathematics, 11.11.2019 09:31
Questions on the website: 13722361