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

Home > Numbers
Powers of 5 (Posted on 2024-10-05) Difficulty: 3 of 5
Call a positive integer totally odd if all of its decimal digits are odd.

Show that for any positive integer k there is a k-digit totally odd integer which is a multiple of 5k.

*** Adapted from a problem which appeared at the USA Mathematical Olympiad in 2003.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
limited solutionsSteven Lord2024-10-17 12:35:48
SolutionSolutionBrian Smith2024-10-06 10:47:16
Some Thoughtsalso no proof, but a conjectureLarry2024-10-06 09:13:18
Some Thoughtsno proof, but a pattern in the first 16 productsCharlie2024-10-06 09:04: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