Buy New
$31.81
Qty:1
  • List Price: $46.50
  • Save: $14.69 (32%)
FREE Shipping on orders over $35.
Temporarily out of stock.
Order now and we'll deliver when available.
Order now and we'll deliver when available. We'll e-mail you with an estimated delivery date as soon as we have more information. Your account will only be charged when we ship the item.
Details
Ships from and sold by Amazon.com.
Gift-wrap available.
Oval Track and Other Perm... has been added to your Cart
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Oval Track and Other Permutation Puzzles: And Just Enough Group Theory to Solve Them (Classroom Resource Materials) Paperback – July 1, 2003

ISBN-13: 978-0521619745 ISBN-10: 0521619742

Buy New
Price: $31.81
13 New from $31.81 12 Used from $9.66
Amazon Price New from Used from
Paperback
"Please retry"
$31.81
$31.81 $9.66
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Customers Who Viewed This Item Also Viewed

NO_CONTENT_IN_FEATURE

Best Books of the Month
Best Books of the Month
Want to know our Editors' picks for the best books of the month? Browse Best Books of the Month, featuring our favorite new books in more than a dozen categories.

Product Details

  • Series: Classroom Resource Materials
  • Paperback: 304 pages
  • Publisher: The Mathematical Association of America (July 2003)
  • Language: English
  • ISBN-10: 0521619742
  • ISBN-13: 978-0521619745
  • ASIN: 0883857251
  • Product Dimensions: 0.8 x 9.8 x 6.7 inches
  • Shipping Weight: 1.3 pounds (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #2,770,682 in Books (See Top 100 in Books)

Editorial Reviews

Book Description

Popular puzzles such as the Rubik's cube and so-called oval track puzzles give a concrete representation to abstract mathematics. This book and CD show how the theory of permutation groups can be used to solve a range of puzzles. Ideal for students of algebra or anyone with an interest in puzzles.

About the Author

John O. Kiltinen is a native of Marquette,Michigan. He earned his Bachelor of Arts degree at Northern MichiganUniversity in 1963 and his Doctor of Philosophy in mathematics at DukeUniversity in 1967. After teaching at the University of Minnesota for four years, he returned in 1971 to his undergraduate alma mater, where he has been a faculty member ever since. He was a visiting professor during1978-79 in Finland, spending half of the year at the University of Joensuu,and half at the Tampere University of Technology. For the first half ofhis year in Finland, he held a Fulbright Lectureship.

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

5.0 out of 5 stars
5 star
1
4 star
0
3 star
0
2 star
0
1 star
0
See the customer review
Share your thoughts with other customers

Most Helpful Customer Reviews

1 of 1 people found the following review helpful By Charles Ashbacher HALL OF FAMETOP 500 REVIEWERVINE VOICE on October 9, 2008
Format: Paperback
This package of book and software presents three fundamental puzzles that can be solved using permutations. The first is called the "Oval Tracks" puzzles and consists of an oval-shaped track that contains numbered disks. There are two fundamental operations that can be performed on the disks:

*) All can be rotated around the track a certain number of positions in either direction. This movement will maintain the fundamental order of the disks.
*) A certain set of permutations can be performed on a small number of the disks.

The second category of puzzle is the "slide puzzles." In this case there is a rectangular grid where each cell of the grid contains a single disk. There is an empty cell and the disks are moved one at a time into the unoccupied cell, creating a different unoccupied cell. Variations of this puzzle have cells marked with an X that are rigid and cannot be moved.
The third category of puzzles is called the "Hungarian Rings." In this case, the puzzle is constructed from two interlocking rings of disks that are either numbered or colored. The disks share two locations and are separately movable so the only operations are rotating the disks.
In all cases, the player is given start and final configurations and the goal is to move from the start to the final state. The software can be used to execute a random rearrangement of the disks at the start of the game. Undo buttons and the ability to create complex macro operations are available.
Using the fundamentals of group theory as it is applied to permutation groups, you can solve all of these games. Therefore, after the initial descriptions of the games, there is an introduction to group theory and permutations.
Read more ›
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again