What can you buy with a debit card ?

Mathematics

2 answers:

Arturiano [62]4 years ago

8 0

Food, clothes, items, gaming supplies, a pillow, a pillowcase, water bottles, chips

FromTheMoon [43]4 years ago

6 0

Food,clothes,items, a lot of things

You might be interested in

6 x (12 - 7) Thanks for answering!

ludmilkaskok [199]

Answer:

Step-by-step explanation:

since 12 - 7 is in the- um- whatever these- ( )- things are called (I forgot), you do it first. 12 - 7 is 5.

Next you do 6 x 5 which gives you your final answer of 30.

(The upcoming and this sentence is pre-written and copy and pasted in every brainly question or comment I write or answer.) If this answer helped you please consider giving it brainliest. If my answer was wrong and you got marked wrong for it, I deeply apologize and hope you will forgive me, since everyone makes mistakes sometimes. If you need me to elaborate on my answer or give further explanation on it, please ask and I will do so. If you need to explain your reasoning on your work feel free to use my words- word for word- without crediting me, the answer was made for you anyways! Hope yall learn from my answer and it helps you in the future with assignments, quizzes, test’s, and more!

- •Trix•

( Yes I know my - •Trix• thingy is not my user but it’s what I would change it to if I could but I can't, please address me as Trix while commenting or talking to me here.)

8 0

3 years ago

A fair coin is tossed repeatedly with results Y0, Y1, Y2, . . . that are 0 or 1 with probability 1/2 each. For n ≥ 1 let Xn = Yn

Gekata [30.6K]

Answer:

False. See te explanation an counter example below.

Step-by-step explanation:

For this case we need to find:

$P(X_{n+1} = | X_n =i, X_{n-1}=i') =P(X_{n+1}=j |X_n =i)$ for all $i,i',j$ and for $X_n$ in the Markov Chain assumed. If we proof this then we have a Markov Chain

For example if we assume that $j=2, i=1, i'=0$ then we have this:

$P(X_{n+1} = | X_n =i, X_{n-1}=i') =\frac{1}{2}$

Because we can only have $j=2, i=1, i'=0$ if we have this:

$Y_{n+1}=1 , Y_n= 1, Y_{n-1}=0, Y_{n-2}=0$ , from definition given $X_n = Y_n + Y_{n-1}$

With $i=1, i'=0$ we have that $Y_n =1 , Y_{n-1}=0, Y_{n-2}=0$

So based on these conditions $Y_{n+1}$ would be 1 with probability 1/2 from the definition.

If we find a counter example when the probability is not satisfied we can proof that we don't have a Markov Chain.

Let's assume that $j=2, i=1, i'=2$ for this case in order to satisfy the definition then $Y_n =0, Y_{n-1}=1, Y_{n-2}=1$

But on this case that means $X_{n+1}\neq 2$ and on this case the probability $P(X_{n+1}=j| X_n =i, X_{n-1}=i')= 0$ , so we have a counter example and we have that:

$P(X_{n+1} =j| X_n =i, X_{n-1}=i') \neq P(X_{n+1} =j | X_n =i)$ for all $i,i', j$ so then we can conclude that we don't have a Markov chain for this case.