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

Home > Numbers
Tetra-productial numbers (Posted on 2003-05-13) Difficulty: 3 of 5
Show that there are infinitely many integers n such that:

1) All digits of n in base 10 are strictly greater than 1.
2) If you take the product of any 4 digits of n, then it divides n.

See The Solution Submitted by Fernando    
Rating: 2.2500 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts Puzzle Thoughts Comment 7 of 7 |
(10^27- 1)/3 = 3333333333333333333333333 which is 
divisible by 3*3*3*3= 81
We could vary the value of n , whenever (10^(27*n) -1)/27, and get an infinity of many integers satisfying the given conditions.

  Posted by K Sengupta on 2023-05-02 23:43:29
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 (9)
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