The letters of the word STAR are written on individual cards. If you always choose three cards and then put them back before the next set of three cards, how many different permutations will you have? List all the different permutations.

no links or I will report

, and

for

step-by-step explanation:

we can analyze the pattern at which the terms increase. let us denote , , , so that we can call

note the following:

the pattern: to get the next term value, we just add the next term number (e.g. 1st, 2nd, to the previous term value (term values are the given numbers in the question, 1, 3, 6, 10, 15,

from , to get to , we add

from , to get to , we add

etc.

we need to form a recursive formula, a formula that has the next term as a function of the previous term. so a possible recursive formula can be

, and for

wait nvm i know the correct answer now its 100%   81 square feet

~batmans wife dun dun

ending amount = beginning amount / (2^n)

where "n" = number of half-lives (or elapsed time / half-life)

ending amount = 50 mg / (2 ^10 / 5.3)

ending amount = 50 mg / (2 ^ 1.8867924528)

ending amount = 50 m / 3.6981210597

ending amount = 13.5203794557 mg

or about 13.5 mg remain

source:  

d secondary market mark brainliest