This article presents a method of reducing fractions without factoring. The ideas presented may be useful as a project for motivated students in an undergraduate number theory course. The discussion is related to the Euclidean Algorithm and its variations may lead to projects or early examples involving efficiency of an algorithm.

A student noticed an interesting fact about the base two numerals for perfect numbers. Mathematical explanations for some questions are given. (MNS)

Representation of integers in various bases is explored, with a proof. (MNS)

Describes examples of rational representation as a guide for translating terminology and information encountered in manuals for computers. Discusses four limitations of the representation. (YP)

Discusses arithmetic during long-multiplications and long-division. Provides examples in decimal reciprocals for the numbers 1 through 20; connection with divisibility tests; repeating patterns; and a common fallacy on repeating decimals. (YP)

This paper takes a known point from Brocard geometry, a known result from the geometry of the equilateral triangle, and bring in Euler's [empty set] function. It then demonstrates how to obtain new Brocard Geometric number theory results from them. Furthermore, this paper aims to determine a [triangle]ABC whose Crelle-Brocard Point [omega]…

Presented are the mathematical explanation of the algorithm for representing rational numbers in base two, paper-and-pencil methods for producing the representation, some patterns in these representations, and pseudocode for computer programs to explore these patterns. (MNS)

Mathematical historians place Heron in the first century. Right-angled triangles with integer sides and area had been determined before Heron, but he discovered such a "non" right-angled triangle, viz 13, 14, 15; 84. In view of this, triangles with integer sides and area are named "Heron triangles." The Indian mathematician Brahmagupta, born in…

The sequence 1, 1, 2, 3, 5, 8, 13, 21, ..., known as Fibonacci sequence, has a long history and special importance in mathematics. This sequence came about as a solution to the famous rabbits' problem posed by Fibonacci in his landmark book, "Liber abaci" (1202). If the "n"th term of Fibonacci sequence is denoted by [f][subscript n], then it may…

A study of a class of numbers called 'Good numbers' can provide students with many opportunities for investigation, conjecture, and proof. Definitions and proofs are presented along with suggested questions. (MNS)

The historical origin of star-polygons is noted and the mathematics of them presented, with illustrations. Seven theorems are included, as well as a computer program designed to classify star-polygons. (MNS)

The Euclidean algorithm for finding the greatest common divisor is presented. (MNS)

Questions students raise about the meaning of zero to the zero power present an opportunity for mathematics teachers to involve students in active participation in exploring mathematical relationships. Calculators are the needed tool to make this exploration accessible to students. How they can be used is described. (MNS)

Identifies and proves two theorems related to expressing rational numbers in decimal form for any natural base m>1. Includes two BASIC computer programs with sample runs. (MVL)