<em>HOPE</em><em> </em><em>THIS</em><em> </em><em>WILL</em><em> </em><em>HELP</em><em> </em><em>U</em><em>.</em><em>.</em><em>.</em><em>.</em>
Answer:
a) aₙ = 4.(2)^n-1
b) aₙ = 2+3(n-1)
c) aₙ = 3+4(n-1)
d) aₙ = 3.(4)^n-1
Step-by-step explanation:
a) a geometric sequence with first term of 4 and a common ratio of 2
aₙ = ar^n-1
where a is the first term and r is the common ratio
aₙ = 4.(2)^n-1
Comparing with the standard form:
1st term = 4
Common ratio = 2
b) an arithmetic sequence with a first term of 2 and a common difference of 3
The standard form of arithmetic sequence is:
aₙ = a₁ + d(n-1)
where a₁ is the first term and d is the common difference
Given: aₙ = 2+3(n-1)
Comparing with standard equation
First term = 2
Common difference = 3
c) an arithmetic sequence with a first term of 3 and a common difference of 4
The standard form of arithmetic sequence is:
aₙ = a₁ + d(n-1)
where a₁ is the first term and d is the common difference
Given: aₙ = 3+4(n-1)
Comparing with standard equation
First term = 2
Common difference = 3
d) a geometric sequence with first term of 3 and a common ratio of 4
aₙ = ar^n-1
where a is the first term and r is the common ratio
aₙ = 3.(4)^n-1
Comparing with the standard form:
1st term = 3
Common ratio = 4
Answer:
There are 60 tech workers altogether
Step-by-step explanation:
Let X be the total number of tech workers in the company
Out of X tech employees, 20 % applied for leaves
In totality, 12 tech employees are on leave
Thus,

On solving the above mathematical equation, we get -

Hence, there are 60 tech workers altogether

The answer is the third option, -7.
Hope this helps.
<u>Options</u>
- Counting rule for permutations
- Counting rule for multiple-step experiments
- Counting rule for combinations
- Counting rule for independent events
Answer:
(C)Counting rule for combinations
Step-by-step explanation:
When selecting n objects from a set of N objects, we can determine the number of experimental outcomes using permutation or combination.
- When the order of selection is important, we use permutation.
- However, whenever the order of selection is not important, we use combination.
Therefore, The counting rule that is used for counting the number of experimental outcomes when n objects are selected from a set of N objects where order of selection is not important is called the counting rule for combinations.