Answer:
The number of pages that Polina read was 90 and the number of pages that Marcus read was 18
Step-by-step explanation:
Let
x -----> number of pages that Polina read
y ----> number of pages that Marcus read
we know that
x+y=108 ----> equation A
x=5y -----> equation B
substitute equation B in equation A and solve for y
Find the value of x
therefore
The number of pages that Polina read was 90 and the number of pages that Marcus read was 18
The answer is that he will have to sprint 44 times in order for Scott to have sprinted 2 miles
Answer:
f(n)=-5-3n
Step-by-step explanation:
Given the recursive formula of a sequence
f(1)=−8
f(n)=f(n−1)−3
We are to determine an explicit formula for the sequence.
f(2)=f(2-1)-3
=f(1)-3
=-8-3
f(2)=-11
f(3)=f(3-1)-3
=f(2)-3
=-11-3
f(3)=-14
We write the first few terms of the sequence.
-8, -11, -14, ...
This is an arithmetic sequence where the:
First term, a= -8
Common difference, d=-11-(-8)=-11+8
d=-3
The nth term of an arithmetic sequence is determined using the formula:
T(n)=a+(n-1)d
Substituting the derived values, we have:
T(n)=-8-3(n-1)
=-8-3n+3
T(n)=-5-3n
Therefore, the explicit formula for f(n) can be written as:
f(n)=-5-3n
I assume the answer is 180 but u have not put a question
Answer:
<h2>
3,654 different ways.</h2>
Step-by-step explanation:
If there are 30 students in a class with natasha in the class and natasha is to select four leaders in the class of which she is already part of the selection, this means there are 3 more leaders needed to be selected among the remaining 29 students (natasha being an exception).
Using the combination formula since we are selecting and combination has to do with selection, If r object are to selected from n pool of objects, this can be done in nCr number of ways.
nCr = n!/(n-r)!r!
Sinca natasha is to select 3 more leaders from the remaining 29students, this can be done in 29C3 number of ways.
29C3 = 29!/(29-3)!3!
29C3 = 29!/(26!)!3!
29C3 = 29*28*27*26!/26!3*2
29C3 = 29*28*27/6
29C3 = 3,654 different ways.
This means that there are 3,654 different ways to select the 4 leaders so that natasha is one of the leaders
