NotesFAQContact Us
Collection
Advanced
Search Tips
Showing 1 to 15 of 43 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Skurnick, Ronald – Mathematics and Computer Education, 2011
This classroom note is presented as a suggested exercise--not to have the class prove or disprove Goldbach's Conjecture, but to stimulate student discussions in the classroom regarding proof, as well as necessary, sufficient, satisfied, and unsatisfied conditions. Goldbach's Conjecture is one of the oldest unsolved problems in the field of number…
Descriptors: Mathematical Formulas, Numbers, Number Concepts, High School Students
Peer reviewed Peer reviewed
Direct linkDirect link
Carley, Holly – Mathematics and Computer Education, 2011
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.
Descriptors: Number Concepts, Mathematics, Mathematical Concepts, Mathematics Instruction
Peer reviewed Peer reviewed
Travis, David L. – Mathematics and Computer Education, 1983
A student noticed an interesting fact about the base two numerals for perfect numbers. Mathematical explanations for some questions are given. (MNS)
Descriptors: College Mathematics, Computers, Higher Education, Mathematics
Peer reviewed Peer reviewed
Direct linkDirect link
Arzt, Joshua; Gaze, Eric – Mathematics and Computer Education, 2004
Divisibility tests for digits other than 7 are well known and rely on the base 10 representation of numbers. For example, a natural number is divisible by 4 if the last 2 digits are divisible by 4 because 4 divides 10[sup k] for all k equal to or greater than 2. Divisibility tests for 7, while not nearly as well known, do exist and are also…
Descriptors: Number Concepts, Mathematics Education, Arithmetic, Number Systems
Peer reviewed Peer reviewed
Bosse, Michael J. – Mathematics and Computer Education, 2001
This brief investigation exemplifies such considerations by relating concepts from number theory, set theory, probability, logic, and calculus. Satisfying the call for students to acquire skills in estimation, the following technique allows one to "immediately estimate" whether or not a number is prime. (MM)
Descriptors: Mathematics Education, Number Concepts, Prime Numbers, Probability
Peer reviewed Peer reviewed
Dence, Thomas P. – Mathematics and Computer Education, 1983
Representation of integers in various bases is explored, with a proof. (MNS)
Descriptors: College Mathematics, Higher Education, Integers, Mathematics
Peer reviewed Peer reviewed
Direct linkDirect link
Zelator, Konstantine – Mathematics and Computer Education, 2005
This paper is written on a level accessible to college/university students of mathematics who are taking second-year, algebra based, mathematics courses beyond calculus I. This article combines material from geometry, trigonometry, and number theory. This integration of various techniques is an excellent experience for the serious student. The…
Descriptors: Geometric Concepts, Numbers, Number Concepts, Calculus
Peer reviewed Peer reviewed
Direct linkDirect link
Skurnick, Ronald – Mathematics and Computer Education, 2007
The Pythagorean Theorem, arguably one of the best-known results in mathematics, states that a triangle is a right triangle if and only if the sum of the squares of the lengths of two of its sides equals the square of the length of its third side. Closely associated with the Pythagorean Theorem is the concept of Pythagorean triples. A "Pythagorean…
Descriptors: Geometric Concepts, Arithmetic, Number Concepts, Mathematical Formulas
Peer reviewed Peer reviewed
Direct linkDirect link
Sastry, K. R. S. – Mathematics and Computer Education, 2007
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]…
Descriptors: Geometric Concepts, Number Concepts, Geometry, Theories
Peer reviewed Peer reviewed
Schoaff, Eileen; Rising, Gerald – Mathematics and Computer Education, 1990
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)
Descriptors: Algorithms, Computation, Decimal Fractions, Mathematical Applications
Peer reviewed Peer reviewed
Anderson, Oliver D. – Mathematics and Computer Education, 1990
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)
Descriptors: Arithmetic, Computation, Decimal Fractions, Division
Peer reviewed Peer reviewed
Joyner, Virginia G.; Haggard, Paul W. – Mathematics and Computer Education, 1990
Discusses how to express an n factorial as a product of powers of primes. Provides two examples and answers. Presents four related suggestions. (YP)
Descriptors: Algorithms, College Mathematics, Computation, Division
Peer reviewed Peer reviewed
Direct linkDirect link
Osler, Thomas J.; Stugard, Nicholas – Mathematics and Computer Education, 2006
In some elementary courses, it is shown that square root of 2 is irrational. It is also shown that the roots like square root of 3, cube root of 2, etc., are irrational. Much less often, it is shown that the number "e," the base of the natural logarithm, is irrational, even though a proof is available that uses only elementary calculus. In this…
Descriptors: Geometric Concepts, Transformations (Mathematics), Calculus, Number Concepts
Peer reviewed Peer reviewed
Schmalz, Rosemary – Mathematics and Computer Education, 1987
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)
Descriptors: Algorithms, College Mathematics, Computer Software, Higher Education
Peer reviewed Peer reviewed
Direct linkDirect link
Ayoub, Ayoub B. – Mathematics and Computer Education, 2006
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…
Descriptors: Mathematical Concepts, History, Mathematics, Problem Solving
Previous Page | Next Page ยป
Pages: 1  |  2  |  3