# project euler-Problem 41

[This article was first published on

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

**YGC » R**, 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.

We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime. What is the largest n-digit pandigital prime that exists?

using gmp and permute package, this problem is very straightforward, and easy to solve.

^{?}View Code RSPLUS

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 |
require(gmp) require(permute) maxP <- 0 vec2num <- function(vec) { m <- length(vec) n <- sum(10^(m:1-1) * vec) return(n) } for (j in 9:4) { p <- allPerms(j, max=prod(1:j)*j) pn <- sapply(1:nrow(p), function(i) vec2num(p[i,])) idx <- isprime(pn) !=0 if ( any(idx) ) { maxP <- max(pn[idx]) } if (maxP != 0) { cat("The larget n-digit pandigital prime is ", maxP, "\n") break } } |

> system.time(source("problem41.R")) The larget n-digit pandigital prime is 7652413 user system elapsed 20.95 0.03 20.99

#### Related Posts

To

**leave a comment**for the author, please follow the link and comment on their blog:**YGC » R**.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.