I believe there is no such AP...
Recursively, this sequence is supposed to be given by
so that
has to be an integer, which means there are 4 possible cases.
Case 1: 
and 
. But
Case 2: 
and 
. But
Case 3: 
and 
. But
Case 4: 
and 
. But
Answer:
21,7 - yes
28,3 - no
17,3 - no
20,4 - yes
55,5 - yes
15,5 - yes
26,4 - no
32,8 - yes
48,7 no
60,2 - yes
79,4 - no
81,3 - yes
Step-by-step explanation:
hope that helps
Answer:
Thus the last row has 119 seats.
The total number of seats in 24 rows = 1476
Step-by-step explanation:
The number of seats in each row make an arithmetic series. We will use arithmetic equation to find the number of seats in last row:
An = a1+ (n-1)d
An = 4+(24-1)5
An = 4 + (23)(5)
An = 4 + 115
An = 119
Thus the last row has 119 seats.
Now to find the sum of seats we will apply the formula:
Sn = n(a1 + an)/2
Sn = 24(4+119)/2
Sn = 24(123) /2
Sn = 1476 .....
The total number of seats in 24 rows = 1476....
Answer:
6 times
Step-by-step explanation:
1/9 chance you get the orange marble. If you pick 54 times, you can expect to get the orange marble 6 times.
Associative property of multiplication which states :
(a * b) * c = a * (b * c)
