NotesFAQContact Us
Collection
Advanced
Search Tips
Publication Date
In 20250
Since 20240
Since 2021 (last 5 years)0
Since 2016 (last 10 years)0
Since 2006 (last 20 years)4
Source
College Mathematics Journal4
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Showing all 4 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Frederickson, Greg N. – College Mathematics Journal, 2012
How many rods does it take to brace a square in the plane? Once Martin Gardner's network of readers got their hands on it, it turned out to be fewer than Raphael Robinson, who originally posed the problem, thought. And who could have predicted the stunning solutions found subsequently for various generalizations of the problem?
Descriptors: Geometric Concepts, Plane Geometry, Problem Solving, Generalization
Peer reviewed Peer reviewed
Direct linkDirect link
Barker, Andrew T. – College Mathematics Journal, 2009
The traveler's dilemma is a generalization of the prisoner's dilemma which shows clearly a paradox of game theory. In the traveler's dilemma, the strategy chosen by analysis and theory seems obviously wrong intuitively. Here we develop a measure of evolutionary stability and show that the evolutionarily stable equilibrium is in some sense not very…
Descriptors: Game Theory, Mathematics Instruction, Mathematical Concepts, College Mathematics
Peer reviewed Peer reviewed
Direct linkDirect link
Koshy, Thomas – College Mathematics Journal, 2009
A. Lobb discovered an interesting generalization of Catalan's parenthesization problem, namely: Find the number L(n, m) of arrangements of n + m positive ones and n - m negative ones such that every partial sum is nonnegative, where 0 = m = n. This article uses Lobb's formula, L(n, m) = (2m + 1)/(n + m + 1) C(2n, n + m), where C is the usual…
Descriptors: Geometric Concepts, Generalization, Problem Solving, Mathematics Instruction
Peer reviewed Peer reviewed
Direct linkDirect link
Benjamin, Arthur T.; Quinn, Jennifer J. – College Mathematics Journal, 2008
Positive sums count. Alternating sums match. Alternating sums of binomial coefficients, Fibonacci numbers, and other combinatorial quantities are analyzed using sign-reversing involutions. In particular, we describe the quantity being considered, match positive and negative terms through an Involution, and count the Exceptions to the matching rule…
Descriptors: Numbers, Mathematics Instruction, College Mathematics, Problem Solving