ProjectEuler-Problem 46

June 21, 2011
By

(This article was first published on YGC, and kindly contributed to R-bloggers)

It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a prime and twice a square.

9 = 7 + 2×12
15 = 7 + 2×22
21 = 3 + 2×32
25 = 7 + 2×32
27 = 19 + 2×22
33 = 31 + 2×12

It turns out that the conjecture was false.

What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?

—————-

Referring to http://learning.physics.iastate.edu/hodges/mm-1.pdf, this problem is very famous.

Using brute-force is the solution I can only think of. Surprisingly, it turns out very fast.

?View Code RSPLUS
1
2
3
4
5
6
7
8
9
10
11
12
13
14
require(gmp)
n <- 1:10000
p <- n[as.logical(isprime(n))]
 
for (i in seq(3,10000,2)) {
    if (any(p==i))
        next
    x <- sqrt((i-p[p<i])/2)
    if (any(round(x) == x)) {
        next
    } else {
        cat (i, "\n")
    }
}

Related Posts

To leave a comment for the author, please follow the link and comment on their blog: YGC.

R-bloggers.com 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.

Sponsors

Mango solutions



RStudio homepage



Zero Inflated Models and Generalized Linear Mixed Models with R

Quantide: statistical consulting and training

datasociety

http://www.eoda.de





ODSC

ODSC

CRC R books series





Six Sigma Online Training









Contact us if you wish to help support R-bloggers, and place your banner here.

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)