Project Euler Problem #14

February 21, 2009

(This article was first published on The Research Kitchen Weblog » R, and kindly contributed to R-bloggers)

Problem 14 on the Project Euler site asks us to find the longest chain under 1 million created using the Collatz mapping. This is fairly straightforward, although performance again is not great: ## Problem 14 # Collatz conjecture problem14 <- function(N) {         maxChain <- 0         chains <- rep(0,N)         x <- 1         for (i in 1:N) {                 n <- i                 chain <- 0                 while(n > 1) {                         n <- ifelse(n %% 2 == 0, n/2, 3*n+1)                         chain <- chain + 1                         if (n < N && chains[n] > […]

To leave a comment for the author, please follow the link and comment on their blog: The Research Kitchen Weblog » R. offers daily e-mail updates about R news and tutorials on topics such as: Data science, Big Data, R jobs, visualization (ggplot2, Boxplots, maps, animation), programming (RStudio, Sweave, LaTeX, SQL, Eclipse, git, hadoop, Web Scraping) statistics (regression, PCA, time series, trading) and more...

If you got this far, why not subscribe for updates from the site? Choose your flavor: e-mail, twitter, RSS, or facebook...

Tags: , ,

Comments are closed.


Never miss an update!
Subscribe to R-bloggers to receive
e-mails with the latest R posts.
(You will not see this message again.)

Click here to close (This popup will not appear again)