# Project Euler #113: Non-bouncy numbers

# Project Euler #113: Non-bouncy numbers

+ 1 comment I feel that total such non bouncy numbers be 430 for nos less than 10^3. what am I missing?

+ 0 comments isn't the problem statement a little mis-written..

first two lines

the definition of increasing n decreasing number is clumpsy

pls have a look or correct me If I understood it wrong..

+ 1 comment In my algorithm I am always getting one extra number as bouncy number e.g. when input is 3, I am getting 475 and its 4, I am getting 1675 and when its 5, I am getting 4954.

Any Idea?

+ 1 comment I arrived at the formula (k+9)C9+(k+10)C10 - 10*k - 2 non bouncy numbers less than 10^k using pen and paper. (combinatorics)

Also number of increasing and decreasing non bouncy numbers won't be the same, some people might make that mistake.

+ 0 comments Seriously, putting two times the same number... just so you know for the ones that come after.

Sort 16 Discussions, By:

Please Login in order to post a comment