All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info
Home > Digest
Recently posted problems (3 days):
Show Digest for last: 2 Days | 3 Days | 5 Days | 1 Week | 2 Weeks
I have a positive integer X.

When I add all the positive integers from 1 to X, I get a result of YYY, where Y is a positive integer from 0 to 9.

What is X?
(No Solution Yet, 0 Comments) Submitted on 2019-04-18 by Danish Ahmed Khan    

For all positive integers k, define f(k)=k2+k+1. Compute the largest positive integer n such that

(No Solution Yet, 1 Comments) Submitted on 2019-04-17 by Danish Ahmed Khan    

The famous Kohinoor diamond has been put on display in a certain museum. The museum authorities have installed an electronic lock which has N buttons, each with a different symbol. To open the lock one must select the correct combination of the symbols, irrespective of the order in which the buttons are pressed. When each button is pressed it lights up. If the correct combination is lit, the lock immediately opens. On the side of the lock is a reset button which will turn off all the lights.

The Jewel Thief visited the museum and noted down all the symbols. That night, he returned to steal the precious gem. Due to shortage of time, he must open the lock as fast as possible.

What is the minimum number of presses needed to guarantee that the lock will open (including both symbols and reset)? Assume that all the lights are off when he arrives.
(No Solution Yet, 2 Comments) Submitted on 2019-04-17 by Danish Ahmed Khan    

Three families make a remarkable discovery. The sum of the ages of their members are all the same, the sum of the squares of the ages of their members are all the same, and the sum of the cubes of the ages of their members are all the same. Everyone in all 3 families has a different age, and nobody is more than 100 years old.

What is the smallest possible sum of their ages? Can this be done with 4 families?
(No Solution Yet, 3 Comments) Submitted on 2019-04-16 by Danish Ahmed Khan    

Four safety engineers set out to inspect a newly cut tunnel through Mt. Popocaterpillar in the Andes. Each person walks at a different constant integer speed measured in meters per minute. In the tunnel there is a mine car which travels along a fixed track, automatically going from end to end at a fixed integer speed. When people board the car they may reverse its direction, but cannot change its speed.

At noon on Monday all four engineers start at the south end, while the mine car starts at the north end. The first (fastest) engineer meets the car, and takes it some distance north. The engineer gets out and continues going north, while the car resumes heading south. Then the second engineer meets the car and also takes it some distance north. Likewise for the third and fourth engineers. All the people, and the mine car, travel continuously with no pauses. The inspectors always go north. Each person enters and exits the car at an integral number of minutes.

All four engineers reach the end of the tunnel simultaneously. What is the earliest time this could happen?
(No Solution Yet, 0 Comments) Submitted on 2019-04-16 by Danish Ahmed Khan    

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 (11)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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