The Miller-Rabin test is a useful probabilistic method for finding large primes. In this paper, we explain the method in detail and give three variations on this test. These variations were originally developed as student projects to supplement a course in error correcting codes and cryptography.

In this note we demonstrate two instances where matrix multiplication can be easily verified. In the first setting, the matrix product appears as matrix element concatenation, and in the second, the product coincides with matrix addition. General proofs for some results are provided with a more complete description for 2×2 matrices. Suggested for…

Academic scholars face a difficult challenge when attempting to grasp the intricate world of mathematics. The complexity of mathematical concepts often lies hidden beneath layers of formulas and procedures, obscuring their true essence. Traditional educational resources often fall short in conveying the profound meaning behind these concepts,…

Discusses imprecision in multimedia data on the Web and proposes a formal framework in which to formulate powerful queries and presentations of the answers. Introduces a fuzzy-based algebra which allows user preferences, in the form of weights, to alter query expression, and presents algorithms for the evaluation of similarity-based queries.…

Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (JN)

Two mathematical topics are interpreted from the viewpoints of traditional (performing algorithms) and contemporary (creating algorithms and thinking in terms of them for solving problems and developing theory) algorithmic mathematics. The two topics are Horner's method for evaluating polynomials and Gauss's method for solving systems of linear…

Discusses a numerical technique called the method of adjoints, turning a linear two-point boundary value problem into an initial value problem. Described are steps for using the method in linear or nonlinear systems. Applies the technique to solve a simple pendulum problem. Lists 15 references. (YP)

Suggests and illustrates ways in which systematic consideration of selected unary operations can be facilitated by using electronic calculators. Emphasis is placed upon unary operations suitable for exploration and investigation at the pre-algebra level, using calculation algorithms as a basis for generating examples and non-examples to develop…

The "word problem" is stated for a given collection. Facts regarding Dehn's Algorithm, definition of Thue systems, a rewriting system, lemmas and corollaries are provided. The situation is examined where the monoid presented by a finite Thue system is a group. (DC)

Adapts Stanic and McKillip's ideas for the use of developmental algorithms to propose that the present emphasis on symbolic manipulation should be tempered with an emphasis on the conceptual understanding of the mathematics underlying the algorithm. Uses examples from the areas of numeric computation, algebraic manipulation, and equation solving…

Develops a general computer algorithm to obtain a magic square having a number of rows that is a multiple of four. Presents a BASIC program and sample runs. (YP)

Describes a prototype package that uses algorithms created within the symbolic algebra system Axiom, numerical routines from the NAG Libraries together with the easy-to-use facilities of modern graphical interfaces. Considers the implementation of different techniques, both symbolic and numeric, for the analysis and calculation of interpolating…

This paper outlines the development of an activity that uses the computer's unique capabilities to provide students with a meaningful and highly motivating experience with the graphing of equations. The basic design of the game calls for the computer to display a coordinate grid on which it graphs any equations that are typed in by the student.…

Examples are provided which demonstrate the use of the computer as an instructional aid for the algebra curriculum. While the basic content of an algebra course would remain intact, computer technology can enhance and expand methods of algebra instruction. (JN)

This article develops an algorithm to find all solutions to the problem, making all sums of a hexagram's nine lines the same. It shows how to exploit the geometric structure of the hexagram and its group of automorphisms. (YP)