[This article was first published on R – Xi'an's Og, and kindly contributed to R-bloggers]. (You can report issue about the content on this page here)
Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.
Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.
A digital problem as Le Monde current mathematical puzzle:
Noble numbers are such that they only involve different digits and are multiple of all their digits. What is the largest noble number?
Hmmmm…. Brute force? Since the maximal number of digits is 10, one may as well try:
k=soz=9
for (t in 1:1e3){
sol=1
while (sol<10^(k-1)){
u=sample(0:8,k);i=digit2int(u)
if (max(i%%u[u>0])==0) soz=max(soz,sol<-i)}}
which returns 9875643120… (I made the conscious choice to exclude zero from the dividers. Which was not a choice spelled out in the original question.)
To leave a comment for the author, please follow the link and comment on their blog: R – Xi'an's Og.
R-bloggers.com offers daily e-mail updates about R news and tutorials about learning R and many other topics. Click here if you're looking to post or find an R/data-science job.
Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.