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)

Possible ways of mechanization for counting using a binary system are discussed. Shows a binary representation of the numbers and geometric models having eight triples of lamps. Provides three problem sets. (YP)

Discrete mathematics and finite mathematics differ in a number of ways. First, finite mathematics has a longer history and is therefore more stable in terms of course content. Finite mathematics courses emphasize certain particular mathematical tools which are useful in solving the problems of business and the social sciences. Discrete mathematics…

Outlines various subtraction methods, such as the decomposition method, equal-addends method, and low-stress algorithm. Describes a subtraction method by addition of complements. Discusses the advantages and disadvantages of the method. (YP)

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)

Presents a public-key cryptosystem application to introduce students to several topics in discrete mathematics. A computer algorithms using recursive methods is presented to solve a problem in which one person wants to send a coded message to a second person while keeping the message secret from a third person. (MDH)

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)

Discusses how to express an n factorial as a product of powers of primes. Provides two examples and answers. Presents four related suggestions. (YP)

Shows a series of Euclidean equations using the Euclidean algorithm to get the greatest common divisor of two integers. Describes the use of the equations to generate a series of circles. Discusses computer generation of Euclidean circles and provides a BASIC program. (YP)

The rule of 78 is used by banks and loan companies to compute the amounts due when installment loans are paid early. Describes an unexpected case of negative amortization when the rule is applied. Presents an actual problem and discusses the case. (YP)

Presents an easy method for constructing magic squares from three-by-three to general squares. Provides a computer program generating odd-order magic squares. Six references are listed. (YP)

Presented is a scheduling algorithm that uses all the busses at each step for any rectangular array. Included are two lemmas, proofs, a theorem, the solution, and variations on this problem. (KR)

Defines M-demand as the maximum number of schemes that the subject must activate simultaneously in the course of executing a task. Discusses the effect of M-demand on problem solving. Uses algorithms to reduce M-demand. Describes the role of algorithms in problem solving. (MVL)

This document serves as Volume II of a two-part course designed to improve mathematical proficiency and understanding as the student is given practice in relevant problem-solving situations. It includes the mathematics skills needed to make sound consumer decisions. The purpose of this course is to review, reinforce and extend concepts learned in…