A Candy Lover Learns to Optimize
| dc.contributor.author | Do, Anh Phuong | |
| dc.contributor.author | Rashid, Mamunur | |
| dc.contributor.author | Sarkar, Jyotirmoy | |
| dc.contributor.department | Mathematical Sciences, School of Science | |
| dc.date.accessioned | 2024-12-13T21:48:07Z | |
| dc.date.available | 2024-12-13T21:48:07Z | |
| dc.date.issued | 2023-03 | |
| dc.description.abstract | A container has two types of candies: Type A and Type B. Concerned about her child's well-being, a wise mom pronounces, “Each day, you can choose two candies from the container random. If they are of different types, you can eat them both. If they are of the same type, eat only one and return the other to the container.” We analyze the expected number of days needed to eat all candies in the container and the proportion of days the child eats two candies. Several other variations are either worked out or left for readers to solve. | |
| dc.eprint.version | Final published version | |
| dc.identifier.citation | Do, A. P., Rashid, M., & Sarkar, J. (2023). A Candy Lover Learns to Optimize. Journal of Probability and Statistical Science, 21(1), Article 1. https://doi.org/10.37119/jpss2023.v21i1.678 | |
| dc.identifier.uri | https://hdl.handle.net/1805/45066 | |
| dc.language.iso | en | |
| dc.publisher | University of Regina | |
| dc.relation.isversionof | 10.37119/jpss2023.v21i1.678 | |
| dc.relation.journal | Journal of Probability and Statistical Science | |
| dc.rights | Attribution 4.0 International | en |
| dc.rights.uri | https://creativecommons.org/licenses/by/4.0 | |
| dc.source | Publisher | |
| dc.subject | random sampling without replacement | |
| dc.subject | probability distribution | |
| dc.subject | recursive relation | |
| dc.title | A Candy Lover Learns to Optimize | |
| dc.type | Article |