A game of sequences, consider the following routine. If a number is even, divide it by two, if a number is odd, multiply by 3 then add 1 to it. Example 20-10-5-16-8-4-2-1, once a sequence reaches 1, we stop. Select the true A) 38 ends in1 B) 139 ends in 1 C) I searched and found a natural number that does not end in 1 D) 31 ends in 1 E) 193 ends in 1 statement/s. F) 43 ends in 1 G) 53 ends in 1 H) 223 ends inr I) none of these
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.
Step by step
Solved in 2 steps with 2 images
