Le Monde puzzle [#824]

June 13, 2013

(This article was first published on Xi'an's Og » R, and kindly contributed to R-bloggers)

A rather dull puzzle this week:

Show that, for any integer y, (√3-1)2y+(√3+1)2y is an integer multiple of a power of two.

I just have to apply Newton’s binomial theorem to obtain the result. What’s the point?!

Filed under: Books, Kids, R Tagged: Binomial theorem, Isaac Newton, Le Monde, mathematical puzzle

To leave a comment for the author, please follow the link and comment on their blog: Xi'an's Og » R.

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...

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)