BrainDen.com - Brain Teasers
• 0

# 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.

## Recommended Posts

• 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 on other sites

• 0

once you know the sum as 36 and the product as 18144, how do you figure out the number as 1687392?

## Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

×   Pasted as rich text.   Paste as plain text instead

Only 75 emoji are allowed.

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.