Jun 24, 2013

Problem:
Find a nine digit number abcdefghi that uses all the digits 1,2,3,...9 exactly once and satisfies:
a is divisible by 1
ab (2 digit number with digits a and b) is divisible by 2
abc (3 digit number with digits a, b and c) is divisible by 3
.......
.......
abcdefghi is divisible by 9.

Update (29/06/2013):Solution: Posted by JDGM, Anti, Meghana Kolan, Shwetabh Sameer and Unknown in comments! A more detailed solution provided by me in comments!

Amazon.com Mathematics Bestsellers

Buy me Coffee / Beer via Paypal/BTC

Pages

Search This Blog

Follow by Email!

About Me

I am an early stage technology investor at Nexus Venture Partners. Prior to this, I was a 3x product entrepreneur. Prior to this, I worked as a private equity analyst at Blackstone and as a quant analyst at Morgan Stanley. I graduated from Department of Computer Science and Engineering of IIT Bombay. I enjoy Economics, Dramatics, Mathematics, Computer Science and Business.

Disclaimer

This is a personal blog. Any views or opinions represented in this blog are personal and belong solely to the blog owner and do not represent those of people, institutions or organizations that the owner may or may not be associated with in professional or personal capacity. Any views or opinions are not intended to malign any religion, ethnic group, club, organization, company, or individual.

All content provided on this blog is for informational purposes only. The owner of this blog makes no representations as to the accuracy or completeness of any information on this site or found by following any link on this site. The owner will not be liable for any errors or omissions in this information nor for the availability of this information. The owner will not be liable for any losses, injuries, or damages from the display or use of this information.