Tutors Answer Your Questions about Sequences-and-series (FREE)
Question 494799: A man borrowed sum of $3600 to be redeemed in 40 installments which made an Arithmetic Progression. After paying 30 installments he died leaving behind a sum of $1200 unpaid. His heirs accepted to pay his remaining liability. What was the first installment paid by (1) The Man (2) His Heirs.
Click here to see answer by Theo(13342)   |
Question 495959: Hello. I would appreciate an explanation to the following question:
A playground is being designed where children can interact with their friends in certain combinations.
If there is 1 child, there can be 0 interactions.
If there are 2 children, there can be only 1 interaction.
If there are 3 children , there can be 5 interactions.
If there are 4 children, there can be 14 interactions.
Which recursive pattern represents the pattern?
asubn=asubn-1+2^(n-1)
asubn=asubn+(n-1)^2
asubn=asubn+2(n-1)
asubn=asubn+(2n-1)
So far I have figured out by setting up this basic pattern chart that:
n a
1 0 +1
2 1 +4
3 5 +9
4 14
Is the equation always the same? or does it change with the given information. I got this wrong and would appreciate understanding why? I understand how to make derive the sequence information. What if I need the 50th term? I can easily get the ninth term as in the previous question on this assignment. But having trouble understanding how to write the formula.
I appreciate you help. This is a wonderful resource for students who take math seriously because the tutors answer the questions so thoroughly. Again, thank you in advance.
Justina
Click here to see answer by Theo(13342) |
Question 498919: The number of counties in California and the number of counties in Montana are consecutive even integers whose sum is 114. if California has more counties than Montana how many counties does each state have
Click here to see answer by Mr_Schuler(2) |
Question 498943: Hello:
I am working on a practice test and it would be dishonest of me to ask you the same question. However, I am having a horrible time discerning how to write a recursive pattern. I know how to find the pattern, no problem, see that right away, but when it comes to figuring out the pattern I get a mental block.
Is there a resource you can recommend to me to sort this out? I would be happy to study it as I want to understand this.
Tina
Click here to see answer by chessace(471)  |
Question 465514: The Fundamental Counting Principle states that the number of ways in which a series of successive things can occur is found by multiplying the number of ways in which each thing can occur. That is, if first event E1 can occur in M1 different ways and after E1 has occurred, if event E2 can occur M2 different ways, then total number of ways that two events can occur is M1*M2
1.Based on this principle, how many different Social Security numbers are possible?
2.Can you find out how many telephone numbers are possible within any area code?
3.Try following problem using Fundamental Counting Principle.
A typical alarm code is unarmed with the correct sequence of three numbers between 0 and 49 inclusive. If a burglar takes one second to try one sequence of
alarm code, how long (in hours) will take for a burglar to try all possible sequences? Is this alarm code systems deterrent enough to keep burglars away?
Click here to see answer by Ashlynbyrd(1) |
Question 465514: The Fundamental Counting Principle states that the number of ways in which a series of successive things can occur is found by multiplying the number of ways in which each thing can occur. That is, if first event E1 can occur in M1 different ways and after E1 has occurred, if event E2 can occur M2 different ways, then total number of ways that two events can occur is M1*M2
1.Based on this principle, how many different Social Security numbers are possible?
2.Can you find out how many telephone numbers are possible within any area code?
3.Try following problem using Fundamental Counting Principle.
A typical alarm code is unarmed with the correct sequence of three numbers between 0 and 49 inclusive. If a burglar takes one second to try one sequence of
alarm code, how long (in hours) will take for a burglar to try all possible sequences? Is this alarm code systems deterrent enough to keep burglars away?
Click here to see answer by solver91311(24713)  |
|
Older solutions: 1..45, 46..90, 91..135, 136..180, 181..225, 226..270, 271..315, 316..360, 361..405, 406..450, 451..495, 496..540, 541..585, 586..630, 631..675, 676..720, 721..765, 766..810, 811..855, 856..900, 901..945, 946..990, 991..1035, 1036..1080, 1081..1125, 1126..1170, 1171..1215, 1216..1260, 1261..1305, 1306..1350, 1351..1395, 1396..1440, 1441..1485, 1486..1530, 1531..1575, 1576..1620, 1621..1665, 1666..1710, 1711..1755, 1756..1800, 1801..1845, 1846..1890, 1891..1935, 1936..1980, 1981..2025, 2026..2070, 2071..2115, 2116..2160, 2161..2205, 2206..2250, 2251..2295, 2296..2340, 2341..2385, 2386..2430, 2431..2475, 2476..2520, 2521..2565, 2566..2610, 2611..2655, 2656..2700, 2701..2745, 2746..2790, 2791..2835, 2836..2880, 2881..2925, 2926..2970, 2971..3015, 3016..3060, 3061..3105, 3106..3150, 3151..3195, 3196..3240, 3241..3285, 3286..3330, 3331..3375, 3376..3420, 3421..3465, 3466..3510, 3511..3555, 3556..3600, 3601..3645, 3646..3690, 3691..3735, 3736..3780, 3781..3825, 3826..3870, 3871..3915, 3916..3960, 3961..4005, 4006..4050, 4051..4095, 4096..4140, 4141..4185, 4186..4230, 4231..4275, 4276..4320, 4321..4365, 4366..4410, 4411..4455, 4456..4500, 4501..4545, 4546..4590, 4591..4635, 4636..4680, 4681..4725, 4726..4770, 4771..4815, 4816..4860, 4861..4905, 4906..4950, 4951..4995, 4996..5040, 5041..5085, 5086..5130, 5131..5175, 5176..5220, 5221..5265, 5266..5310, 5311..5355, 5356..5400, 5401..5445, 5446..5490, 5491..5535, 5536..5580, 5581..5625, 5626..5670, 5671..5715, 5716..5760, 5761..5805, 5806..5850, 5851..5895, 5896..5940, 5941..5985, 5986..6030, 6031..6075, 6076..6120, 6121..6165, 6166..6210, 6211..6255, 6256..6300, 6301..6345, 6346..6390, 6391..6435, 6436..6480, 6481..6525, 6526..6570, 6571..6615, 6616..6660, 6661..6705, 6706..6750, 6751..6795, 6796..6840, 6841..6885, 6886..6930, 6931..6975, 6976..7020, 7021..7065, 7066..7110, 7111..7155, 7156..7200, 7201..7245, 7246..7290, 7291..7335, 7336..7380, 7381..7425, 7426..7470, 7471..7515, 7516..7560, 7561..7605, 7606..7650, 7651..7695, 7696..7740, 7741..7785, 7786..7830, 7831..7875, 7876..7920, 7921..7965, 7966..8010, 8011..8055, 8056..8100, 8101..8145, 8146..8190, 8191..8235, 8236..8280, 8281..8325, 8326..8370, 8371..8415, 8416..8460, 8461..8505, 8506..8550, 8551..8595, 8596..8640, 8641..8685, 8686..8730, 8731..8775, 8776..8820, 8821..8865, 8866..8910, 8911..8955, 8956..9000, 9001..9045, 9046..9090, 9091..9135, 9136..9180, 9181..9225, 9226..9270, 9271..9315, 9316..9360, 9361..9405, 9406..9450, 9451..9495, 9496..9540, 9541..9585, 9586..9630, 9631..9675, 9676..9720, 9721..9765, 9766..9810, 9811..9855, 9856..9900, 9901..9945, 9946..9990, 9991..10035, 10036..10080, 10081..10125, 10126..10170, 10171..10215, 10216..10260, 10261..10305, 10306..10350, 10351..10395, 10396..10440, 10441..10485, 10486..10530, 10531..10575, 10576..10620, 10621..10665, 10666..10710, 10711..10755, 10756..10800, 10801..10845, 10846..10890, 10891..10935, 10936..10980, 10981..11025, 11026..11070, 11071..11115, 11116..11160, 11161..11205, 11206..11250, 11251..11295, 11296..11340, 11341..11385, 11386..11430, 11431..11475, 11476..11520, 11521..11565, 11566..11610, 11611..11655, 11656..11700, 11701..11745, 11746..11790
|
