Le Monde puzzle [#1139]
[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 weekly Monde current mathematical puzzle that reminded me of an earlier one (but was too lazy to check):
The integer n=36 enjoys the property that all the differences between its ordered divisors are also divisors of 36. Find the only 18≤m≤100 that enjoys this property such that all its prime dividers areof multiplicity one. Are there other such m’s?
The run of a brute force R search return 42 as the solution (codegolf welcomed!)
y=z=1:1e5 for(x in y)z[y==x]=!sum(x%%diff((1:x)[!x%%(1:x)])) y=y[z==1] for(k in generate_primes(2,max(y)))y=y[!!y%%k^2]
where generate_primes is a primes R function. Increasing the range of y’s to 10⁵ exhibits one further solution, 1806.
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.