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

Home > Numbers
Product of odd primes with distinct digits (Posted on 2021-07-23) Difficulty: 2 of 5
(1): Consider the set of the smallest 6 odd primes: {3,5,7,11,13,17}.
What is the largest multiple of this product which has distinct digits ?

(2) What is the maximum number of digits a square-free integer (whether even or odd) can have if its digits are all distinct?

(3) What is the largest odd square-free integer with distinct digits having exactly n prime factors for n = 1,2,3,4,5? You can extend this to larger numbers of factors if you wish.

Note: a square-free integer is one whose prime factorization has exactly one factor for each prime that appears in it.

See The Solution Submitted by Larry    
Rating: 5.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Question 2 and 3 answers. | Comment 1 of 5
If all digits 0-9 are present in a number with distinct digits then that number must be a multiple of 9, as the sum of digits is 45.  That number cannot be squarefree.  Then the number of digits a squarefree number can have with distinct digits is at most 9.

Removing one digit (not 0 or 9) will avoid the number being a multiple of 9.  Its pretty easy to find 987654310 = 2 x 5 x 98765431 (prime factorization) as the largest squarefree number with distinct digits. This satisfies n=3 in Question 3.

Moving on, the number 987654302 = 2 x 347 x 661 x 2153 satisfies n=4
Then 987654301 = 2029 x 486769 satisfies n=2.
987654230 = 2 x 5 x 73 x 419 x 3229 satisfies n=5.
And 987654103 is prime (n=1).

  Posted by Brian Smith on 2021-07-23 12:16:36
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
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