For any 10 digit natural number [tex]N[/tex] in which(adsbygoogle = window.adsbygoogle || []).push({});

the first digit corresponds to the total no of 1's.

the 2nd digit corresponds to the total no of 2's.

.

.

.

the 10th digit corresponds to the total no of 0's.

determine, with proof, if the number of such natural number [tex]N[/tex] is finite, and if proved true, find them all.

A generalization of

http://answers.yahoo.com/question/i...lB5DIp8Cxgt.;_ylv=3?qid=20080628051813AA0p296

Also, extend this to any numerical base [tex]M[/tex] such that the [tex]M^{th}[/tex] digit corresponds to the total number of 0's and [tex](M - 1)^{th}[/tex] digit corresponds to the total number of [tex](M - 1)[/tex]'s for any natural number [tex]M[/tex], etc.

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Very clever and difficult number theory puzzle (with generalization)

Loading...

Similar Threads - Very clever difficult | Date |
---|---|

How to solve a very large overdetermined system numerically? | May 8, 2015 |

2 very basic questions | Aug 13, 2013 |

Clever compound cartoon Dying to figure out the formula to calculate the ink used. | Aug 25, 2012 |

Help with factors (very basic) | Feb 12, 2012 |

Whats the best software to calculate very large numbers? | Dec 3, 2011 |

**Physics Forums - The Fusion of Science and Community**