Searching for n n

Find the number of positive integers n n such that n ! n! is divisble by 4 7 6770 47^{6770} , but not by 4 7 6771 47^{6771} .


The answer is 0.

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

Consider the number 3 × 4 7 3 = 311469 3\times 47^3 = 311469 . The number of factor 47 present in it is 311469 / 47 + 311469 / 4 7 2 + 311469 / 4 7 3 = 6771 311469/47 + 311469/47^2+311469/47^3=6771 . Note that this is the minimum value of n n that results in it being divisible by 4 7 6771 47^{6771} . However, observe that 311468 ! = 311469 ! / 311469 311468! = 311469!/311469 which results in elimination of 3 powers of 47 from its prime factorization. 311468! and factorials of positive integers smaller than 311468 are now at most divisible by 4 7 6768 47^{6768} . Hence the conditions stated in the question cannot be satisfied by any natural number so the answer is 0.

How did you found the value 311469 311469 , though? Is it by trial and error? Is there any optimisation?

Christopher Boo - 4 years, 6 months ago

Log in to reply

I tried multiples of 47, 4 7 2 47^2 and 4 7 3 47^3 until the power of 47 in the prime factorization exceeds 6770.

A Former Brilliant Member - 4 years, 6 months ago

Log in to reply

I see, that's a pretty systematic approach!

Christopher Boo - 4 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...