Discussed is how a separable field extension can play a major role in many treatments of Galois theory. The technique of diagonalizing matrices is used. Included are the introduction, the proofs, theorems, and corollaries. (KR)

Describes the application of the General Purpose Utility Problem-Solving technique that was developed at the University of Technology, Sydney, to the problem experienced by a satellite university campus library where there were periodic shelving backlogs. Highlights include cluster methods, total quality management applications, and the use of…

This yearbook provides the mathematics education community with specific perceptions about discrete mathematics concerning its importance, its composition at various grade levels, and ideas about how to teach it. Many practical suggestions with respect to the implementation of a discrete mathematics school program are included. A unifying thread…

Explains that primitive living structures furnish real-world problems that are solvable using mathematics and computer-modeling techniques. (KHR)

That the principal axis theorem does not extend to any finite field is demonstrated. Presented are four examples that illustrate the difficulty in extending the principal axis theorem to fields other than the field of real numbers. Included are a theorem and proof that uses only a simple counting argument. (KR)

Described is a geometric view of Singular Value Theorem. Included are two theorems, one which is a pure matrix version of the above and the other that leads to the orthogonal diagonalization of certain matrices, i.e., the Spectral Theorem. Also included are proofs and remarks. (KR)

Described is a decomposition theory from which the Cayley-Hamilton theorem, the diagonalizability of complex square matrices, and functional calculus can be developed. The theory and its applications are based on elementary polynomial algebra. (KR)

Order Analysis is a multidimensional scaling (MDS) technique for determining order among items. This paper reviews articles by different authors describing various components of ordering theory. A common nomenclature is constructed to link together the various ideas and is applied to a fairly simple set of data. Topics discussed include a more…

This document is designed to provide a concise introduction to the theory of generalized inverses of matrices that is accessible to undergraduate mathematics majors. The approach used is to: (1) develop the material in terms of full-rank factorizations and to relegate all discussions using eigenvalues and eigenvectors to exercises, and (2) include…

The use of a "2 x 2" matrix for introspection is described. Columns are labelled "Like" and "Don't Like" and rows are labelled "Have" and "Don't Have"; items are jotted down in each of the quadrants. Discussion includes self-diagnosis of responses, cooperative brainstorming and analysis, additional applications, and suggestions for filling out…

Confirmatory factor analysis was used to test first- and second-order factor models on cognitive abilities and their invariance across samples of 234 male and 225 female secondary school students. Factor models suggest that males and females may use different problem-solving strategies for spatial analogies, matrices, and numerical problems. (SLD)

Abstract ideas in linear algebra are illustrated at different levels of difficulty through the investigation of the solution to a well-known puzzle. Matrices are used to model the puzzle and the concepts of rank, underdetermined systems, and consistency are employed in the solution to the problem. (MDH)

Counterintuitive moments in the classroom challenge common sense and practice and can be used to help mathematics students appreciate the need to explore, reflect, and reason. Proposed are four examples involving geometry, systems of equations, and matrices as counterintuitive instances. (MDH)

Cryptography is the science that renders data unintelligible to prevent its unauthorized disclosure or modification. Presents an application of matrices used in linear transformations to illustrate a cryptographic system. An example is provided. (17 references) (MDH)

This paper proposes a methodology to calculate both the difficulty of the basic problems and the difficulty of solving a problem. The method to calculate the difficulty of problem is according to the process of constructing a problem, including Concept Selection, Unknown Designation, and Proposition Construction. Some necessary measures observed…