| Nama Pengarang | : | George Stoica |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 491 |
| Abstraksi Narasi | : | Deskripsi abstrak ringkas tidak tersedia untuk artikel ini. |
| Nama Pengarang | : | David Miller & Sarah Hanusch |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 485-490 |
| Abstraksi Narasi | : | It is a common practice in upper-level mathematics proof courses for the professor to evaluate, grade, and comment on the proofs that students hand in for homework, quizzes, and exams. Their assessment consists of writing feedback on the students’ proofs, assigning a numerical score for the proof, and emphasizing good proof writing. We may ask: What do professors really want to see in the written proofs that students produce in upper-level mathematics courses? Do they want to see proofs written in complete sentences, using proper punctuation, having fluency and clarity in their proof writing, and demonstrating a good understanding of the material? Furthermore, do professors agree on how to score student proofs, and if not, how much do their scores vary? Moreover, what are the implications for undergraduate students if there are differences in how professors grade their proofs? |
| Nama Pengarang | : | Mohammad Javaheri |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 478-484 |
| Abstraksi Narasi | : | 2025 is an example of a torn number, a perfect square that is a fixed point of the following split-add-square procedure: the number is torn in half (as 20 and 25), then the two parts are added together (20+25=45), and finally the result is squared (452=2025). We show that there exist at least 2?????(????)−1 2k-digit torn numbers, ????≥1, where ?????(????) is the number of prime factors of 10????−1. Moreover, we show that the split-add-square procedure has infinitely many periodic points of any arbitrary period. |
| Nama Pengarang | : | Robert Beals |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 472-477 |
| Abstraksi Narasi | : | We consider the problem of testing whether a given ????×???? table for a binary operation ∗ defines a group. The existence of an identity element 1 is readily checked. Likewise, we can quickly verify that elements possess inverses. The apparent bottleneck is to test associativity, which naively seems to require checking (????∗????)∗????=????∗(????∗????) for all ????3 triples (????,????,????). We show that ????2+?????(????? log 2?????) carefully selected triples suffice to either prove that the table defines a group or to find a triple violating associativity. The bookkeeping cost of selecting which triples to check is ?????(????2), linear in the input length. |
| Nama Pengarang | : | Kimihiro Noguchi |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 471 |
| Abstraksi Narasi | : | Deskripsi abstrak ringkas tidak tersedia untuk artikel ini. |
| Nama Pengarang | : | Samuel Nicolay |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 466-470 |
| Abstraksi Narasi | : | The concept of prevalence provides a rigorous framework for identifying “large” sets in infinite-dimensional spaces, extending measure-theoretic ideas of negligibility beyond finite-dimensional contexts. This paper introduces the foundational definitions of prevalence, exploring its key properties and illustrating its relevance through examples in functional spaces. We also investigate the interplay between prevalent sets and Baire categories, emphasizing that while these notions share certain structural parallels, they are fundamentally distinct. |
| Nama Pengarang | : | https://maa.tandfonline.com/author/Cooper%2C+Thomas+E |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 452-465 |
| Abstraksi Narasi | : | In this article, we use the four semi-excircles of a general convex quadrilateral to define a Nagel point, and we examine the behavior of certain segments that divide the perimeter of a convex quadrilateral in half. Most notably, we classify all quadrilaterals that have concurrent splitters, and we find that a certain set of intersections involving the splitters are collinear with the Nagel point and the intersection of the diagonals in any convex quadrilateral. |
| Nama Pengarang | : | Geoffrey R. Grimmett |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 439-451 |
| Abstraksi Narasi | : | A neat question involving coin flips surfaced on ????, and generated an intensive “storm” of “social mathematics.” In a sequence of flips of a fair coin, Alice wins a point at each appearance of two consecutive heads, and Bob wins a point whenever a head is followed immediately by a tail. Who is more likely to win the game? The subsequent discussion illustrated conflicting intuitions, and concluded with the correct answer (it is a close thing). It is explained here why the context of the question is interesting and how it may be answered in a quantitative manner using the probabilistic techniques of reversal, coupling, and renewal. |
| Nama Pengarang | : | Uri Mendlovic |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 423-438 |
| Abstraksi Narasi | : | We improve on the solution of the classical prisoners and drawers riddle, where all prisoners can find their number using the pointer-following strategy, provided that the prisoners can send a spy to inspect all drawers and swap one pair of numbers. In the traditional approach, each prisoner may need to open up to half of the drawers. We show that this strategy is sub-optimal. Remarkably, a single swap allows all n prisoners to find their number by asymptotically opening only ???? ln  ln ???? ln ?????(1+?????(1)) drawers in the worst case. We show that no strategy can do better than this bound by a factor larger than two. Efficiently constructing such a strategy is harder, but we provide an explicit efficient strategy that requires opening only ?????(???? log  log ???? log ????) drawers by each prisoner in the worst case. |
| Nama Pengarang | : | Christopher J. Bishop |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 133 (No. 5) |
| Nomor Halaman | : | 407-421 |
| Abstraksi Narasi | : | We prove that any two polygons with the same area can be triangulated using the same set of triangles. This strengthens the 200-year-old Wallace–Bolyai–Gerwien theorem that equal area polygons have an equi-dissection. |