7. Take the Fibonace the first term by 100, infinity)-the sum is [Hint: The standard a series by something see what we get. The
Permutations and Combinations
If there are 5 dishes, they can be relished in any order at a time. In permutation, it should be in a particular order. In combination, the order does not matter. Take 3 letters a, b, and c. The possible ways of pairing any two letters are ab, bc, ac, ba, cb and ca. It is in a particular order. So, this can be called the permutation of a, b, and c. But if the order does not matter then ab is the same as ba. Similarly, bc is the same as cb and ac is the same as ca. Here the list has ab, bc, and ac alone. This can be called the combination of a, b, and c.
Counting Theory
The fundamental counting principle is a rule that is used to count the total number of possible outcomes in a given situation.
![7. Take the Fibonacci sequence 1 1 2 3 5 8 13 etc. and divide
the first term by 100, the second by 1000, the third by 10000, etc. and then add them all up (to
infinity)-the sum is 1/89. Wow.
[Hint: The standard approach to finding the sum of an infinite geometric series is to multiply the
series by something (r) and then subtract the two versions of the series, one from the other, and
see what we get. The same type of trick might work here.]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbea2a903-864b-44da-915f-4d3ef2476ba0%2F3eaf5ec6-b987-4aa0-89b9-d0a054c13800%2Faxb2wra_processed.jpeg&w=3840&q=75)
Step by step
Solved in 2 steps with 1 images
