| Nama Pengarang | : | Marcin Kulczycki |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 125 (No. 2) |
| Nomor Halaman | : | 141-148 |
| Abstraksi Narasi | : | We introduce a new family of shift spaces—the subordinate shifts. Using subordinate shifts, we prove in an elementary way that for every nonnegative real number t there is a shift space with entropy t. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 125 (No. 2) |
| Nomor Halaman | : | 130-140 |
| Abstraksi Narasi | : | Using an equivalence relation on the hyperreals called approximation, a new extension of the Riemann integral is motivated and introduced in which every bounded function is integrable and for which there exists a function g: [0, 1] → R simultaneously satisfying (1) g is integrable, (2) g is unbounded on every subinterval of [0, 1], and (3) g is identical to its average value function. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 125 (No. 2) |
| Nomor Halaman | : | 115-129 |
| Abstraksi Narasi | : | We define Pascal functions by adapting the arithmetic rule that creates the Pascal triangle. By developing and applying properties of Pascal functions, we discover new identities and find new perspectives of old identities. The identities all involve binomial coefficients, with some also involving Stirling numbers, Stirling polynomials, associated Stirling numbers of the second kind, or Bell numbers. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 125 (No. 2) |
| Nomor Halaman | : | 99-114 |
| Abstraksi Narasi | : | Let r2(n) denote the number of representations of the positive integer n as a sum of two squares, and let d(n) denote the number of positive divisors of n. Gauss and Dirichlet were evidently the first mathematicians to derive asymptotic formulas for ∑n ? xr2(n) and ∑n ? xd(n), respectively, as x tends to infinity. But what is the error made in such approximations? Number theorists have been attempting to answer these two questions for over one and one-half centuries, and although we think that we essentially “know” what these errors are, progress in proving these conjectures has been agonizingly slow. Ramanujan had a keen interest in these problems, and although, to the best of our knowledge, he did not establish any bounds for the error terms, he did give us identities that have been used to derive bounds, and two further identities that might be useful, if we can figure out how to use them. In this paper, we survey what is known about these two famous unsolved problems, with a moderate emphasis on Ramanujan's contributions. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 125 (No. 3) |
| Nomor Halaman | : | 245-256 |
| Abstraksi Narasi | : | We present an easily defined countable family of permutations of the natural numbers for which explicit rearrangements (i.e., the sums induced by the permutations) can be computed. The digamma function proves to be the key tool for the computations found here for the alternating harmonic series. The permutations φ under consideration are simple in the sense that φ?φ is the identity function. We show that the countable set of rearrangements obtained from the permutations considered below is dense in the reals. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 125 (No. 3) |
| Nomor Halaman | : | 231-244 |
| Abstraksi Narasi | : | In this article, we use elementary methods to investigate continuous binomial coefficients: functions of the real variable x defined by way of the gamma function with y a fixed real number. We begin with a brief qualitative description of these functions and then derive several interesting representations of them including an infinite product and Taylor series. We also prove various integral formulas involving continuous binomial coefficients, many of which remarkably mirror summation formulas of the familiar binomial coefficients. We conclude by proving a continuous analog of the binomial theorem. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 125 (No. 3) |
| Nomor Halaman | : | 223-230 |
| Abstraksi Narasi | : | All of us learn and teach matrix multiplication using rows times columns. Those inner products are the entries of AB. But to go backward—to factor a matrix into triangular or orthogonal or diagonal matrices—outer products are much better. Now AB is the sum of columns of A times rows of B: rank one matrices. Our goal is to produce those columns and rows as simply as possible for A = LU (elimination) and A = CE (echelon form) and A = QR (Gram–Schmidt). Diagonalization by eigenvectors and by singular vectors is also expressed by columns times rows. |
| Nama Pengarang | : | Russell A. Gordon |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 125 (No. 3) |
| Nomor Halaman | : | 207-221 |
| Abstraksi Narasi | : | We present a collection of simple construction problems and determine conditions for which the construction can be carried out with compass and straightedge. Since the problems reduce to finding the roots of quartic polynomials, it is not sufficient to show that the polynomials are irreducible to conclude that the roots are not constructible. Some interesting results appear as we discover general conditions that determine when the solutions are or are not constructible. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 125 (No. 3) |
| Nomor Halaman | : | 198-206 |
| Abstraksi Narasi | : | We relate how the Worpitzky number triangle emerges in the setting of a novel counting problem that involves placing up- and right-arrows in a rectangular grid in a polite manner. We next survey various properties, relying on a mixture of combinatorial argument and the functional equation for Worpitzky polynomials. We conclude with a short proof of the Von Staudt–Clausen theorem, a context in which Worpitzky numbers arose. |
| Nama Pengarang | : | - |
| Nama Majalah/Jurnal | : | The American Mathematical Monthly |
| Volume / Nomor Edisi | : | 125 (No. 4) |
| Nomor Halaman | : | 339-346 |
| Abstraksi Narasi | : | It is a challenge to define an uncountable set of real numbers that is dense in the real line and whose complement is also uncountable and dense. In this article we specify, for any positive integer k, a partition of the real line into k + 1 sets that are uncountable and dense; moreover, every real number is a condensation point for each of these sets. We show that one of these sets has measure one when restricted to the unit interval, while each of the others has measure zero. We then define a function that is continuous on the set of measure 1 but discontinuous elsewhere. |