All categories

2 years ago

Algebra 1:

2 answers:

3 0

The nth term can be expressed as 16n-70.
So, if we solve
122=16n-70
we find n=12.
Thus, 122 is the 12th term in the sequence.

SSSSS [86.1K]2 years ago

3 0

122 is the 12th term in the sequence.

You might be interested in

Is 19 equal to 4.358

AURORKA [14]

Answer:

Step-by-step explanation:

19=19 and 4.358=4.358

7 0

2 years ago

What are the leading coefficient and degree of the polynomial? 15w – w ⁸ - 5 + w ⁹

Sauron [17]

Answer:

leading coefficient is 1

degree is 9

7 0

3 years ago

Read 2 more answers

If p varies inversely with q, and p = 2 when q = 1, find the equation that relates p and q.

NeTakaya

Answer:

p = $\frac{2}{q}$

Step-by-step explanation:

Given that p varies inversely with q then the equation relating them is

p = $\frac{k}{q}$ ← k is the constant of variation

To find k use the condition p = 2 when q = 1, thus

k = pq = 2 × 1 = 2

p = $\frac{2}{q}$ ← equation of variation

3 0

3 years ago

A one year member ship to your local gym costs $539. there is an initial fee of $35. write an equation tou can use to fund out h

stich3 [128]

$539 - $35 = $504

$504 : 12 = $42

Per month you pay $42.

4 0

2 years ago

A playground is being designed where children can interact with their friends in certain combinations. If there is 1 child, ther

mariarad [96]

<h2>Answer:</h2>

Recursive equation for the pattern followed is given by,

$a_{n}=a_{n-1}+(n-1)^{2}$

<h2>Step-by-step explanation:</h2>

In the question,

The number of interaction for 1 child = 0

Number of interactions for 2 children = 1

Number of interactions for 3 children = 5

Number of interaction for 4 children = 14

So,

We need to find out the pattern for the recursive equation for the given conditions.

So,

We see that,

$a_{1}=0\\a_{2}=1\\a_{3}=5\\a_{4}=14\\$

Therefore, on checking, we observe that,

$a_{n}=a_{n-1}+(n-1)^{2}$

On checking the equation at the given values of 'n' of, 1, 2, 3 and 4.

At,

n = 1

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{1}=a_{1-1}+(1-1)^{2}\\a_{1}=0+0=0\\a_{1}=0$

which is true.

At,

n = 2

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{2}=a_{2-1}+(2-1)^{2}\\a_{2}=a_{1}+1\\a_{2}=1$

Which is also true.

At,

n = 3

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{3}=a_{3-1}+(3-1)^{2}\\a_{3}=a_{2}+4\\a_{3}=5$

Which is true.

At,

n = 4

$a_{n}=a_{n-1}+(n-1)^{2}\\a_{4}=a_{4-1}+(4-1)^{2}\\a_{4}=a_{3}+9\\a_{4}=14$

This is also true at the given value of 'n'.

Therefore, the recursive equation for the pattern followed is given by,

$a_{n}=a_{n-1}+(n-1)^{2}$

3 0

2 years ago