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
For all positive integers n, the function rev(n) reverses the digits of n. For example, rev(205) = 502 and rev(12340) = 04321 = 4321. Compute the least positive integer m such that gcd(m, rev(m)) = 13.
(No Solution Yet, 0 Comments) Submitted on 2025-03-22 by Danish Ahmed Khan    

If n is an integer greater than 1, then show that nnāˆ’1āˆ’1 is divisible by (nāˆ’1)2.
(No Solution Yet, 2 Comments) Submitted on 2025-03-21 by Danish Ahmed Khan    

If:
2a = 3
3b = 4
4c = 5
5d = 6
Then, find the value of a*b*c*d
(No Solution Yet, 2 Comments) Submitted on 2025-03-20 by K Sengupta    

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

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