Jump to content
BrainDen.com - Brain Teasers
  • 0
BMAD

50% increase

Question

Find the smallest positive integer such that if the ones digit is moved (from the right) all the way to the left, the resulting number is exactly 50% more than the original number.

Share this post


Link to post
Share on other sites

5 answers to this question

  • 0

Let's the value be m and its shifted version n.

2/3*n = m

m and n are both integers, so n-m=1/3*n is also an integer.

Therefore 3 | n .

As their digits have the same sum, 3 | m.

Therefore 3 | n-m --> 3 | 1/3*n --> 9 | n.

As their digits have the same sum, 9 | m.

Following similar logic from above, above 9 | n-m --> 9 | 1/3*n --> 27 | n.

So you need only account for 1/27 of the integers for a brute strength solution (which speeds it up significantly)

I got 285714 and 571428.

Share this post


Link to post
Share on other sites
  • 0

Let's the value be m and its shifted version n.

2/3*n = m

m and n are both integers, so n-m=1/3*n is also an integer.

Therefore 3 | n .

As their digits have the same sum, 3 | m.

Therefore 3 | n-m --> 3 | 1/3*n --> 9 | n.

As their digits have the same sum, 9 | m.

Following similar logic from above, above 9 | n-m --> 9 | 1/3*n --> 27 | n.

So you need only account for 1/27 of the integers for a brute strength solution (which speeds it up significantly)

I got 285714 and 571428.

brilliant observation

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now


  • Recently Browsing   0 members

    No registered users viewing this page.

×