Jump to content
BrainDen.com - Brain Teasers
  • 0
Sign in to follow this  
jasen

alphametic with modulo

Question

Solve this alphametic (replacing letters with digits)

ABCDEFG mod (A×B×C×D×E×F×G)=0

example :

ABCDE mod (A×B×C×D×E)=0
13248 mod (1×3×2×4×8)=0

Note :

  • Do not replace any letter with 0.
  • Each letter represent different digit.
  • There is only one solution.

Share this post


Link to post
Share on other sites

2 answers to this question

  • 0

ABCDEFG is a multiple of the product of its digits, so it must be divisible by each of its digits. With at least two even digits, it is an even number. It is not divisible by 10, and is therefore not divisible by 5. At least two digits are multiples of 3, so the number and the sum of its digits are multiples of 9. The sum must be 36, and the digits are 1, 2, 3, 6, 7, 8 and 9.

The product is 18,144 and the number is 1,687,392.

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

Sign in to follow this  

  • Recently Browsing   0 members

    No registered users viewing this page.

×