Every application of integration by parts can be done with a tabular method. The trick is to identify and consider each new integral in the table before deciding how to proceed. This paper supplements a classic introduction to integration by parts with a particular tabular method called Row Integration by Parts (RIP). Approaches to tabular methods…

In this paper, we first focus on the sum of powers of the first n positive odd integers, T[subscript k](n)=1[superscript k]+3[superscript k]+5[superscript k]+...+(2n-1)[superscript k], and derive in an elementary way a polynomial formula for T[subscript k](n) in terms of a specific type of generalized Stirling numbers. Then we consider the sum of…

In this paper, we examine the national curricula for primary mathematics for each of the four constituent nations of the United Kingdom (England, Northern Ireland, Scotland and Wales) for the estimation-related opportunities they offer children. Framed against four conceptually and procedurally different forms of estimation (computational,…

Despite the importance of computational estimation skill for the improvement of number sense, little research exists on preservice teachers' estimation skills and their view on estimation in the US context. This study examined the computational estimation skill of 58 preservice elementary teachers (PSTs) and its relationship to their views of the…

This paper explores how a young child (56 m) builds an understanding of the cardinality principle through communicative, touchscreen-based activities involving talk, gesture and body engagement working via multimodal, touchscreen interface using contemporary mobile technology. Drawing upon Nemirovsky's perceptuomotor integration theoretical lens…

We consider here the problem of calculating the moments of binomial random variables. It is shown how formulae for both the raw and the central moments of such random variables may be obtained in a recursive manner utilizing Stirling numbers of the first kind. Suggestions are also provided as to how students might be encouraged to explore this…

We compute closed forms for some parametric integrals. The tools used are MacLaurin developments and other infinite series. Finally, Stirling numbers appear. (Contains 1 figure.)

In this note, we introduce sequence factorial and use this to study generalized M-bonomial coefficients. For the sequence of natural numbers, the twin concepts of sequence factorial and generalized M-bonomial coefficients, respectively, extend the corresponding concepts of factorial of an integer and binomial coefficients. Some latent properties…

We present a sequence of improper integrals, for which a closed formula can be computed using Wallis formula and a non-straightforward recurrence formula. This yields a new integral presentation for Catalan numbers.

In computing real-valued functions, it is ordinarily assumed that the input to the function is known, and it is the output that we need to approximate. In this work, we take the opposite approach: we show how to compute the values of some transcendental functions by approximating the input to these functions, and obtaining exact answers for their…

This article investigates the numbers [image omitted], originally studied by Catalan. We re-confirm that they are indeed integers. Using the close relationship between them and the Catalan numbers C[subscript n], we develop some divisibility properties for C[subscript n]. In particular, we establish that [image omitted], where f[subscript k]…

We compute in three different ways the same definite parametric integral. By-products are the derivation of a combinatorial identity and two integral presentations of Catalan numbers. One of them leads to a presentation using the [gamma] function.

In this study, we show how to construct a function from the set N of natural numbers that explicitly counts the set Q[superscript +] of all positive rational numbers using a very intuitive approach. The function has the appeal of Cantor's function and it has the advantage that any high school student can understand the main idea at a glance…

A branch of mathematics commonly used in cryptography is Galois Fields GF(p[superscript n]). Two basic operations performed in GF(p[superscript n]) are the addition and the multiplication. While the addition is generally easy to compute, the multiplication requires a special treatment. A well-known method to compute the multiplication is based on…

Modern Hindu-Arabic numeration is the end result of a long period of evolution, and is clearly superior to any system that has gone before, but is it optimal? We compare it to a hypothetical base 5 system, which we dub Predator arithmetic, and judge which of the two systems is superior from a mathematics education point of view. We find that…