We use a novel approach to evaluate the indefinite integral of 1/(1 + x4) and use this to evaluate the improper integral of this integrand from 0 to [infinity]. Our method has advantages over other methods in ease of implementation and accessibility.

To understand better some of the classic knights and knaves puzzles, we count them. Doing so reveals a surprising connection between puzzles and solutions, and highlights some beautiful combinatorial identities.

The numerical range, easy to understand but often tedious to compute, provides useful information about a matrix. Here we describe the numerical range of a 3 x 3 magic square. Applying our results to one of the most famous of those squares, the Luoshu, it turns out that its numerical range is a piece of cake--almost.

Using calculus only, we find the angles you can rotate the graph of a differentiable function about the origin and still obtain a function graph. We then apply the solution to odd and even degree polynomials.

We show that inside every triangle the locus of points satisfying a natural proportionality relationship is a parabola and go on to describe how this triangle-parabola relationship was used by Archimedes to find the area between a line and a parabola.

Sets in the game "Set" are lines in a certain four-dimensional space. Here we introduce planes into the game, leading to interesting mathematical questions, some of which we solve, and to a wonderful variation on the game "Set," in which every tableau of nine cards must contain at least one configuration for a player to pick up.

"Instant Insanity II" is a sliding mechanical puzzle whose solution requires the special alignment of 16 colored tiles. We count the number of solutions of the puzzle's classic challenge and show that the more difficult ultimate challenge has, up to row permutation, exactly two solutions, and further show that no…

How many ways may one climb an even number of stairs so that left and right legs are exercised equally, that is, both legs take the same number of strides, take the same number of total stairs, and take strides of either 1 or 2 stairs at a time? We characterize the solution with a difference equation and find its generating function.

An idempotent satisfies the equation x[superscript 2] = x. In ordinary arithmetic, this is so easy to solve it's boring. We delight the mathematical palette here, topping idempotents off with modular arithmetic and a series of exercises determining for which n there are more than two idempotents (mod n) and exactly how many there are.

Euler's method for solving initial value problems is an excellent vehicle for observing the relationship between discretization error and rounding error in numerical computation. Reductions in stepsize, in order to decrease discretization error, necessarily increase the number of steps and so introduce additional rounding error. The problem is…

Social scientists use adjacency tables to discover influence networks within and among groups. Building on work by Moler and Morrison, we use ordered pairs from the components of the first and second singular vectors of adjacency matrices as tools to distinguish these groups and to identify particularly strong or weak individuals.

In this paper, we review the rules and game board for "Chutes and Ladders", define a Markov chain to model the game regardless of the spinner range, and describe how properties of Markov chains are used to determine that an optimal spinner range of 15 minimizes the expected number of turns for a player to complete the game. Because the Markov…

We provide several constructions, both algebraic and geometric, for determining the ratio of the radii of two circles in an Apollonius-like packing problem. This problem was inspired by the art deco design in the transom window above the Shadek Fackenthal Library door on the Franklin & Marshall College campus.

Many optimization problems can be solved without resorting to calculus. This article develops a new variational method for optimization that relies on inequalities. The method is illustrated by four examples, the last of which provides a completely algebraic solution to the problem of minimizing the time it takes a dog to retrieve a thrown ball,…

The title question has at least two natural answers, one "global" and one "local." Global: "when they can be made to coincide by a rigid motion of the whole plane;" local: "when there is a one-to-one distance preserving mapping of one onto the other." Self-evidently global implies local. We show that in fact these different notions lead to…