Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

Please help, will medal! Give a recursive definition for the set Y of all positive multiples of 5. That is, Y = {5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, ... }. Your definition should have a base case and a recursive part. 5 is in Y. If y is in Y, so is ___ .

See more answers at
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly


Get your free account and access expert answers to this and thousands of other questions

Please read the OpenStudy terms and conditions and OpenStudy Code of Conduct :)
Yes i got it... this is not a test question

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

@Callisto , can you help her?please
@terenzreignz please, help
i think the answer may have an exponent
show me your work, how to get exponent ?
well the first part is 5 is in Y..
the whole work, please.
because 5 is the multiple
multiple of what? your prof ask you start from n = 0 or n =1?, mine always start from n =0
ok, got what you mean, got what you want to go. (you have to speak out, so , i can know what you want, right? as I stated , there are many ways to come up, how can I know which way you want) continue, you are on the right way
from that , I guess, you start at n =1
\[a_1 = 5\] \[a_2 = 10 = 5 + 1*5 = a_1 + (2-1)1*5 =a_1 +1*5\] \[a_3= 15 = 5 + 2*5 = a_1 + (3-1)*5 = a_1 + 2*5\] ................................. \[a_n= 5 + ( n-1)*5\] so the base case is 5 the recursive part is (n-1)*5 or 5(n-1) that's all I know,
awesome thanks for your input :)
thanks God, at the end, I can get what you want.... hehehe... hey, please, next time, speak out what you want, if I can ,I will help, but need clue. ok? many many ways to solve, not just that.
lol thanks :)

Not the answer you are looking for?

Search for more explanations.

Ask your own question