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

Home > Numbers
A Factorial Triplet Puzzle (Posted on 2007-01-31) Difficulty: 3 of 5
Determine all possible triplets of integers (n,m,k) satisfying 1!+2!+3!+...+n!=mk, where n, m and k are greater than 1.

See The Solution Submitted by K Sengupta    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: some thoughts | Comment 4 of 5 |
(In reply to some thoughts by Vishal Gupta)

Though we are given that n, m and k are greater than 1, in order for n to satisfy the equation 1!+2!+3!+...+n! = mk, n must be greater than 3. The factorials for 1, 2 and 3 are already included and the notation in the equation is written that indicates n as some number greater than 3, with mk equal to the summation of all the factorials of the integers from 1 to n.
  Posted by Dej Mar on 2007-02-02 00:24:59

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


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

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information