| Nama Pengarang | : | David L. Finn & Todd Will |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Nomor Edisi | : | 99 (No. 2) |
| Nomor Halaman | : | 125-133 |
| Abstraksi Narasi | : | We consider a variation of Stokes theorem to consider the outward flux through the boundary curve to a region on a surface. This is equivalent to the divergence theorem in Riemannian geometry, but suitable for calculus students. |
| Nama Pengarang | : | Wagner Oliveira Costa Filho |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Nomor Edisi | : | 99 (No. 2) |
| Nomor Halaman | : | 123-124 |
| Abstraksi Narasi | : | Deskripsi abstrak ringkas tidak tersedia untuk artikel ini. |
| Nama Pengarang | : | Casey Douglas & Alex Meadows |
| Nama Majalah/Jurnal | : | Mathematics Magazine |
| Volume / Nomor Edisi | : | 99 (No. 2) |
| Nomor Halaman | : | 109-122 |
| Abstraksi Narasi | : | Eigenmetric curves are planar curves that are as long as they are encompassing, enclosing a given area with an equal amount of arc-length. We study these peculiar objects and find necessary conditions for their existence when measuring lengths with an arbitrary norm. |
| Nama Pengarang | : | Emil Daniel Schwab & Gabriela Schwab |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 10) |
| Nomor Halaman | : | 1030-1041 |
| Abstraksi Narasi | : | In this paper we examine two arithmetic identities, which come from distinct chapters of elementary number theory. They are: “the Honsberger Fibonacci number identity” and the “Busche-Ramanujan ????-identity”. The interplay between the two is just the beginning of bridging the gap between the theory of Fibonacci numbers and the theory of multiplicative arithmetic functions. |
| Nama Pengarang | : | Jaume Llibre |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 10) |
| Nomor Halaman | : | 1023-1029 |
| Abstraksi Narasi | : | Until now all the examples of polynomial differential systems in ?3 exhibiting an invariant sphere have degree larger than one. In this note we show, for the first time, that the polynomial differential systems in ?3 of degree one can exhibit invariant spheres. Moreover, for such polynomial differential systems we also describe their phase portraits on the invariant sphere. |
| Nama Pengarang | : | Jean-Francois Burnol |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 10) |
| Nomor Halaman | : | 995-1006 |
| Abstraksi Narasi | : | We obtain for the Kempner series (i.e., harmonic series where certain digits are excluded from all denominators, for example the digit 9 in base 10) new representations as geometrically convergent series. The coefficients for these representations involve the power sums on the allowed digits and the moments of an explicitly described measure on the unit interval. These moments can be computed numerically by recurrence. We establish a priori lower and upper bounds for them. This allows converting the theoretical formulas into an efficient numerical algorithm. |
| Nama Pengarang | : | Jan De Neve, Ferre Vanden Kerchove, Didier Colle, Wouter Tavernier & Mario Pickavet |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 10) |
| Nomor Halaman | : | 1007-1022 |
| Abstraksi Narasi | : | The Chromatic Number of the Plane (CNP) problem can be generalized to the CNP with two forbidden distances. This problem seeks the smallest number of colors sufficient for coloring the Euclidean plane such that no two points at distance 1 or at distance d have the same color. A lower bound of six has previously been established for ????=1+√52 and ????=2 by constructing a 6-chromatic 2-distance graph with edge lengths 1 and d. Here, we construct a 6-chromatic 2-distance graph for two new values, ????=√2+√62 and ????=√3. This way, the lower bound for the CNP with two forbidden distances 1 and d is raised to six, for the two new values of d. We then minimize the number of vertices in our 6-chromatic 2-distance graphs. For ????=√2+√62 and ????=√3, the smallest results are a 117-vertex graph and a 33-vertex graph, respectively. The latter graph has only two vertices more than the smallest known 6-chromatic 2-distance graph. Both the verification of the 6-chromaticity and the graph minimization process were assisted by the use of a SAT solver. |
| Nama Pengarang | : | Brayden Casella, Philip M. Anderson, Michael Kleber, Richard P. Mann, Reed Nessler, William Rucklidge, Samuel G. Williams & Nicolas Wu |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 10) |
| Nomor Halaman | : | 978-994 |
| Abstraksi Narasi | : | We demonstrate the existence of a non-terminating game of Beggar-My-Neighbor discovered by lead author Brayden Casella. We detail the method for constructing this game and identify a cyclical structure of 62 tricks that is reached by 30 distinct starting hands. We further present a short history of the search for this solution since the problem was posed, and a record of previously found longest terminating games. The existence of this non-terminating game provides a solution to a long-standing question which John H. Conway called an “anti-Hilbert problem.” |
| Nama Pengarang | : | Will Traves |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 132 (No. 10) |
| Nomor Halaman | : | 960-977 |
| Abstraksi Narasi | : | Will Traves and David Wehlau [Citation1] recently gave a straightedge construction that checks whether 10 points lie on a plane cubic curve. They also highlighted several open problems in the synthetic geometry of cubics. Hermann Grassmann investigated incidence relations among points on cubic curves in three papers [Citation2–4] appearing in Crelle’s Journal from 1846 to 1856. Grassmann’s methods give another way to check whether 10 points lie on a cubic. Using Grassmann’s techniques, we solve the synthetic geometry problems introduced by Traves and Wehlau. In particular, we give straightedge constructions that find the intersection of a line with a cubic, find the tangent line to a cubic at a given point, find the third point of intersection of this tangent line with the cubic. This leads to a straightedge construction of the base point of the family of elliptic curves through 8 points. We also construct the sixth point of intersection of a conic and cubic, as well as the line through the fifth and sixth points of intersection of a conic and a cubic. The paper ends by advertising some related open problems and connections to applications of geometric algebra. |
| Nama Pengarang | : | Haoran Chen |
| Nama Majalah/Jurnal | : | The College Mathematics Journal |
| Volume / Nomor Edisi | : | 56 (No. 5) |
| Nomor Halaman | : | 389-394 |
| Abstraksi Narasi | : | The original propeller problem states that if three equilateral triangles have a common vertex, then the midpoints of the three segments connecting the other six vertices always form another equilateral triangle. The result also applies to three similar triangles. In order to further generalize it to similar polygons, we use quadrilaterals to show in general that the new polygon must be constructed from the centroids of the corresponding vertices of the old ones. |