We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
HINT : Pandigital primes are painful to find. Just generate them all at first.
Use permutations of strings ("123" gives "123" "132" "213" ...) ==> Look they are all pandigitals !
thanks for your good idea , first time,i use fermat theorem , but warning "This method is a probabilistic method" ! after i test all numbers found , i just realize i wrong 2 number in all numbers i find before , anyway i thanks you ! :)
Project Euler #41: Pandigital prime
You are viewing a single comment's thread. Return to all comments →
HINT : Pandigital primes are painful to find. Just generate them all at first. Use permutations of strings ("123" gives "123" "132" "213" ...) ==> Look they are all pandigitals !
thanks for your good idea , first time,i use fermat theorem , but warning "This method is a probabilistic method" ! after i test all numbers found , i just realize i wrong 2 number in all numbers i find before , anyway i thanks you ! :)