Over at /r/math , Darksteve writes of “A problem I came up with, and haven’t been able to solve for many years:” I would like to present a mathematical problem that I came up with some years ago, and haven’t yet found a solution for: If you take all the numbers that contain the digits 1 to 9 exactly once, and you write down the prime factorization of all those numbers, which one has the smallest biggest prime factor? To illustrate what I mean, the number 879456123 contains the prime factors 3 7 13 and 491; making 491 this numbers biggest prime factor.
Read full article from Programming Praxis | A collection of etudes, updated weekly, for the education and enjoyment of the savvy programmer
No comments:
Post a Comment