Le Monde puzzle [#909]

Another of those “drop-a-digit” Le Monde mathematical puzzle:

Find all integers n with 3 or 4 digits, no exterior zero digit, and a single interior zero digit, such that removing that zero digit produces a divider of x.

As in puzzle #904, I made use of the digin R function:


and simply checked all integers up to 10⁶:

for (i in 101:10^6){
 if ((min(dive[1],rev(dive)[1])>0)&
 if (i==((i%/%dive)*dive)){

which leads to the output

> plura
1] 105 108 405 2025 6075 10125 30375 50625 70875
> plura/divid
[1] 7 6 9 9 9 9 9 9 9

leading to the conclusion there is no solution beyond 70875. (Allowing for more than a single zero within the inner digits sees many more solutions.)

5 Responses to “Le Monde puzzle [#909]”

  1. Doesn’t 100 technically qualify?

  2. Philip Whittall Says:

    So, are the following propositions true if we allow any number of digits …
    1> All solutions are divisible by 3.
    2> 108 is the only solution not divisible by 5.
    3> All solutions > 105 are divisible by 9


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.

%d bloggers like this: