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…

The aim of this study was to investigate second-grade elementary school students' performance related to their counting skills, place value understanding, and addition operation in natural numbers. A total of 205 second-grade elementary school students from Turkey participated in this study. The data were collected through a 'Personal Information…

Evaluation of the cosine function is done via a simple Cordic-like algorithm, together with a package for handling arbitrary-precision arithmetic in the computer program Matlab. Approximations to the cosine function having hundreds of correct decimals are presented with a discussion around errors and implementation.

This study investigated 11 pre-service middle school teachers' solution strategies for exploring their knowledge of fraction division interpretations. Each participant solved six fraction division problems. The problems were organized into two sets: symbolic problems (involving numbers only) and contextual problems (involving measurement…

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…

Separate a three-digit number into its component digits. After raising each digit to the third power and computing the sum of the cubes, determine how often the original number reappears. Modular arithmetic is used to reduce the number of potential solutions to a more manageable quantity. (Contains 4 tables.)

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…

We use the Implicit Function Theorem to establish a result of non-existence of limit to a certain class of functions of several variables. We consider functions given by quotients such that both the numerator and denominator functions are null at the limit point. We show that the non-existence of the limit of such function is related with the…

This paper concerns computer aided assessment (CAA) of mathematics in which a computer algebra system (CAS) is used to help assess students' responses to elementary algebra questions. Using a methodology of documentary analysis, we examine what is taught in elementary algebra. The STACK CAA system, http://www.stack.bham.ac.uk/, which uses the CAS…

The telescoping sum constitutes a powerful technique for summing series. In this note, this technique is illustrated by a series of problems starting off with some simple ones in arithmetic, then some in trigonometry, famous families of numbers, Apery-like formulas, and finally ending with a class of problems that are solved by computer.

An attempt is made to put the notion of sample quartiles on a mathematical footing in the light of ranks of observations, and equisegmentation property that the quartiles divide ordered sample observations into four segments leaving the same number of observations in each if all the observations are distinct. Sample quartiles provided by the…

Computer operations involving complex numbers, essential in such applications as Fourier transforms or image processing, are normally performed in a "divide-and-conquer" approach dealing separately with real and imaginary parts. A number of proposals have treated complex numbers as a single unit but all have foundered on the problem of the…