Answer: 12.48
Step-by-step explanation:
38x38+bxb=40x40
1444+b=1600
1600-1444=156
=12.48
Answer:
54
Step-by-step explanation:
90+36= 126
180-126= 54
Answer:
95.03
Step-by-step explanation:
The way you worded the question kind of confuses me but i'll try to answer.
Think of recursion like climbing a ladder; in this type of sequence you start out somewhere, usually n. So in f(n-1)+1, you take n (where you started) and "step down" once, and then step up once (which brings you back where you were). Remember PEMDAS when doing these.
Answer:
Least number is 60.
Step-by-step explanation:
Let the number of CDs has Jo be represented by x + 10. Where x = 0, 1, 2, 3....
Then, since Ken has twice as many CDs as Jo, the number of CDs that Ken has can be expressed as;
2(x + 10) = 2x + 20
Maisie has three times as many CDs as Ken, then the number of CDs that Maisie has can be expressed as;
3(2x + 20) = 6x + 60
Thus to determine the least number of CDs that Maisie can have, let x = 0.
3(2x + 20) = 6x + 60
= 6(0) + 60
= 60
Therefore, the least number of CDs that Maisie can have is 60.
