All categories

4 years ago

The nth term of a sequence is 3n+4 explain why 21 is not a term of this sequence

1 answer:

6 0

In this sequence, n can only be a natural number. So, if you plug in 5 for n, then you get 19. Also, if you plug in 6 for n, you get 24. Since no natural number can be replaced with n to get 21, it isn’t a term in the sequence

You might be interested in

There are 52 cards in a standard deck: 13 hearts, 13 clubs, 13 diamonds , and 13 spades. Timothy draws four cards at random from

siniylev [52]

Answer:

$\dfrac{1}{4}$

Step-by-step explanation:

Total number of cards in a standard deck = 52

Number of hearts in the deck = 13

Number of clubs in the deck = 13

Number of diamonds in the deck = 13

Number of spades in the deck = 13

Four cards are drawn at random by Timothy.

These four cards are drawn from each one of the suits.

And the cards are not replaced.

Therefore, now cards remaining in each suit:

Remaining number of hearts in the deck = 12

Remaining number of clubs in the deck = 12

Remaining number of diamonds in the deck = 12

Remaining number of spades in the deck = 12

Formula for probability of an event E can be observed as:

$P(E) = \dfrac{\text{Number of favorable cases}}{\text {Total number of cases}}$

Here, number of favorable cases are 12 (i.e. number of hearts)

Total number of cases = 12 $\times$ 4 = 48

Therefore, the required probability is:

$\dfrac{12}{48} = \bold{\dfrac{1}4}$

7 0

3 years ago

3164 divide 45 fast plz fast

Anna11 [10]

Answer:

70.31

Step-by-step explanation:

3164/31=70.31

3 0

3 years ago

20 POINTS !!!!!!!

Nata [24]

Point A'(4, 3)

Point B'(9, 7)

Point C'(6, 7)

Point D'(-8, -2)

Point E'(2, -4)

Point F'(8, 2)

Hope this helps! :)

7 0

3 years ago

What is the height of spanning tree obtained from Wn by the breadth-first search, starting at the central vertex of Wn?

Alex73 [517]

Answer:

The height of the spanning tree is one by the breadth-first search at the central vertex of Wn.

Step-by-step explanation:

The graph is connected and has a spanning tree where the tree can build using a depth-first search of the graph. Start with chosen vertex, the graph as the root, and root add vertices and edges such as each new edge is incident with vertex and vertices are not in path. If all vertices are included, it will do otherwise, move back to the next level vertex and start passing. It is for depth-first search. For breadth-first search, start with chosen vertex add all edges incident to a vertex. The new vertex is added and becomes the vertices at level 1 in the spanning tree, and each vertex at level 1 adds each edge incident to vertex and other vertex connected to the edge of the tree as long as it does not produce.

4 0

3 years ago

25 POINTS!! PLEASE HELP!

Anvisha [2.4K]

Answer:

The length of TQ is 14.

Step-by-step explanation:

The length of SV and VS are the same.

4x - 1 = 15

4x = 16

x = 4

Similarly, the length of TS and TQ are the same.

3x + 2 = 3(4) + 12 = 14

6 0

3 years ago