All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Getting Maps In 2080 (Posted on 2007-08-17) Difficulty: 4 of 5
Let S = {1; 2; 3; 4; 5; 6; 7}

Analytically determine the number of maps f from S to S such that f2080(x) = x for every x belonging to S.

Note: The iteration is denoted by the superscript, such that f1(x) = f(x) and
fn(x) = f(fn-1(x)) for all n > 1.

  Submitted by K Sengupta    
Rating: 4.3333 (3 votes)
Solution: (Hide)
The required number of maps is 2080.

A detailed explanation of the foregoing is furnished in Problem Number 2080 of journalsDotcmsDotmathDotca in this location.


For an alternative method, refer to the comments posted by Charlie in the comments section.

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Solutionone case missing--computer lists all combinationsCharlie2007-08-20 10:36:24
re(2): solutionCharlie2007-08-18 01:14:24
Some Thoughtsre: solutionFederico Kereki2007-08-17 18:44:22
SolutionsolutionCharlie2007-08-17 15:34:40
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information