Even! Evenly divisible upon prime

N = 10 ! 11 N = 10 ! M 11 N = \dfrac{10!}{11}\qquad \overline{N} = \dfrac{10!-M}{11} The number ( N ) (N) above doesn't leave remainder 0. However, N \overline{N} leaves 0 remainder when M M is subtracted from 10 ! 10! . Find the largest possible value of M < 10 ! M<10! .


Bonus (if interested): Find the total such M M such that N \overline{N} is evenly divisible by 11.


The answer is 3628789.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

X X
Jun 16, 2018

10 ! M 10!-M must be positive and a multiple of 11,so the minimum value of 10 ! M 10!-M is 11 11 , M = 10 ! 11 M=10!-11

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...