DIGITAL DIVISION

It is another good puzzle so to arrange the nine digits (the nought excluded) into two groups so that one group when divided by the other produces a given number without remainder. For example, `1` `3` `4` `5` `8` divided by `6` `7` `2` `9` gives `2`. Can the reader find similar arrangements producing `3, 4, 5, 6, 7, 8`, and `9` respectively? Also, can he find the pairs of smallest possible numbers in each case? Thus, `1` `4` `6` `5` `8` divided by `7` `3` `2` `9` is just as correct for `2` as the other example we have given, but the numbers are higher.

主题:
算术 数论 -> 模算术/余数算术 -> 整除规则 -> 被3和9整除的规则 数论 -> 除法
来源:
There are no comments yet.
Authentication required

You must log in to post a comment.

Log in