Project Euler problem 44: sums and differences of pentagonal numbers – codereview.stackexchange.com 01:58 Posted by Unknown No Comments This is my code for solving the pentagonal number problem on Project Euler: Pentagonal numbers are generated by the formula, \$P_n=n\dfrac{3n−1}{2}\$. The first ten pentagonal numbers are: ... from Hot Questions - Stack Exchange OnStackOverflow via Blogspot Share this Google Facebook Twitter More Digg Linkedin Stumbleupon Delicious Tumblr BufferApp Pocket Evernote Unknown Artikel TerkaitHow to properly use std::string on utf-8 in C++? – stackoverflow.comHow to imply that the gift is meant for the two of us – interpersonal.stackexchange.comDiscontinuous function with bounded variation – math.stackexchange.comEx-manager was demoted and moved under me, how to deal with them not following my direction? – workplace.stackexchange.comTwo forms to choose from, choose only one – ux.stackexchange.comSupermassive black holes at the centre of Milky way: What is the compelling evidence? – physics.stackexchange.com
0 Comment to "Project Euler problem 44: sums and differences of pentagonal numbers – codereview.stackexchange.com"
Post a Comment