Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Three friends start with these balances of a digital currency: Asha units, Bilal units, Carla units. The ledger then records four payments, in this order.
A payment is refused if the sender does not have enough at that moment. Find the three final balances, and say whether any payment was refused.
A digital currency only exists electronically: it is a record of who owns how much. It is used to pay for goods and services and to send money to people, through a device, often from a digital wallet. Every payment is a record in a ledger, and a balance is
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Plan. Keep a table of the three balances and update it after each payment.
Step 1. Asha has , so she can pay . Asha , Bilal , Carla .
Step 2. Bilal has , so he can pay . Asha , Bilal , Carla .
Step 3. Carla has , so she can pay . Asha , Bilal , Carla .
Step 4. Bilal has only , but the payment is . This payment is refused. The balances stay the same.
Answer: Asha , Bilal , Carla . One payment, payment 4, was refused.
Check. Money only moves between the three friends, so the total must stay the same: at the start and at the end.
Log in to join the discussion.
Loading…