| Nama Pengarang | : | |
| Nama Majalah/Jurnal | : | Intisari |
| Volume / Nomor Edisi | : | (No. 727) |
| Nomor Halaman | : | 8-21 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | J.A. Telnoni |
| Nama Majalah/Jurnal | : | Forum Biblika: Jurnal Ilmiah Populer |
| Volume / Nomor Edisi | : | -14 (No. 0) |
| Nomor Halaman | : | 32-40 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Surip Stanislaus |
| Nama Majalah/Jurnal | : | Forum Biblika: Jurnal Ilmiah Populer |
| Volume / Nomor Edisi | : | -14 (No. 0) |
| Nomor Halaman | : | 15-31 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Robert Setio |
| Nama Majalah/Jurnal | : | Forum Biblika: Jurnal Ilmiah Populer |
| Volume / Nomor Edisi | : | -14 (No. 0) |
| Nomor Halaman | : | 5-14 |
| Abstraksi Narasi | : | - |
| Nama Pengarang | : | Iosif Pinelis |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 131 (No. 7) |
| Nomor Halaman | : | 627-628 |
| Abstraksi Narasi | : | It is shown that 1/2 is the exact upper bound on the difference |
| Nama Pengarang | : | Lazhar Bougoffa |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 131 (No. 7) |
| Nomor Halaman | : | 624-625 |
| Abstraksi Narasi | : | In this short note, we present a generalization of Wayment’s Mean Value Theorem for Integrals. |
| Nama Pengarang | : | Mathew Kushelman & Peter McGrath |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 131 (No. 7) |
| Nomor Halaman | : | 619-623 |
| Abstraksi Narasi | : | A theorem of Liouville asserts that the simplest angle-preserving transformations on Euclidean space—translations, dilations, reflections, and inversions—generate all angle-preserving transformations when the dimension is at least 3. This note gives a proof which uses only elementary multivariable calculus and simplifies a differential-geometric argument of Flanders. |
| Nama Pengarang | : | Shamil Asgarli, Michael Hartglass, Daniel Ostrov & Byron Walden |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 131 (No. 7) |
| Nomor Halaman | : | 608-617 |
| Abstraksi Narasi | : | Two possibly unfair n-sided dice, both labeled 1,2,…,????, are rolled, and the sum is recorded. How should the dice’s sides be weighted so that the resulting sum is closest to the uniform distribution on 2,3,…,2?????? We answer this question by explicitly identifying the optimal pair of dice. This resolves a question raised by Gasarch and Kruskal in 1999 in a surprising way. We present additional results for the case of more than two possibly unfair n-sided dice and for the hypothetical case where the weights on each die are permitted to be negative, but must still sum to one. |
| Nama Pengarang | : | Michael Purcell |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 131 (No. 7) |
| Nomor Halaman | : | 595-607 |
| Abstraksi Narasi | : | We define what it means for a set of dice to be m/n permutation fair. We show how some collections of sets of m/n permutation-fair dice can be combined to create new sets of dice that are (????+1)/???? permutation fair. By applying this method recursively, we show that our method is generic. That is, it can be used to create sets of dice that are m/n permutation fair for all m and n. We show that our method is more efficient than what we call the concatenation construction, which is the only other known generic method for constructing sets of permutation-fair dice. We conclude by demonstrating how our method can be used to construct a set of five 120-sided dice that is permutation fair. |
| Nama Pengarang | : | Mathias Sonnleitner |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 131 (No. 7) |
| Nomor Halaman | : | 581-594 |
| Abstraksi Narasi | : | Combination locks are widely used to secure bicycles. We consider a combination lock consisting of adjacent rotating dials with the first nonnegative integers printed on each of them. Assuming that we know the correct combination and we start from an incorrect combination, what is the minimal number of steps to arrive at the correct combination if in each step we are allowed to turn an arbitrary number of adjacent dials once in a common direction? We answer this question using elementary methods and show how this is related to a variation of (multivariate) functions. |