Give a recursive definition for the set y of all positive multiples of 9. that is, y = {9, 18, 27, 36, 45, 54, 63, 72, 81, 90, 99, }. your definition should have a base case and a recursive part.

Recursion means defining something, such as a function, in terms of itself. So Y = {9, 18, 27, 36, 45, 54, 63, 72, 81, 90, 99, ... }

Let f (0) = 0

So f ( n + 1) = f (n) + 9

f (1) = f(0) + 9 = 0 +9 = 9

f (2) = f(1) + 9 = 9 +9  = 18

lo.lll

step-by-step explanation:

75

step-by-step explanation:

you do x-29=46 (the number of cantaloupes sold)

in order to find x, you have to find what minus 29 equals 46, meaning you'd have to add 29 to 46.

29+46=75

if you replace x with 75, the equation looks like:

75-29=46

x=75