Product of Totatives-II Googol

Number Theory Level pending

Let P \mathbb P be the product of all possible positive integers a 1 0 100 a\leq10^{100} such that gcd ( a , 1 0 100 ) = 1 \gcd(a,10^{100})=1 .

Enter sum of digits of R R , where R R is the remainder when P \mathbb P is divided by 1 0 100 10^{100} .


Notation: gcd ( ) \gcd(\cdot) denotes the greatest common divisor function.

Hint : If you're stuck, solving this first might give you some insights regarding how to proceed.


The answer is 1.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...