⎝ ⎜ ⎛ lo g ϕ ( n ) d ∣ n ∏ ϕ ( d ) 1 ⎠ ⎟ ⎞ + ϕ ( τ ( n ) + σ ( n ) ) = ?
where n = 1 7 ∗ 2 3 ∗ 4 1 ∗ 4 3 .
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.
What does τ ( n ) denote?
Log in to reply
The number of positive integer divisors of n . Chinmay is using the symbol in his problem; that's why I did not explain it
Problem Loading...
Note Loading...
Set Loading...
We know that d ∣ n ∏ ϕ ( d ) = ( ϕ ( n ) ) τ ( n ) / 2
for a square-free n ; to prove this formula, just group the divisors in τ ( n ) / 2 pairs whose product is n . For the given n , with 4 prime divisors, we have τ ( n ) / 2 = 2 4 / 2 = 8 , so that the first term in our sum is − 8 .
A straightforward computation shows that the second summand is ϕ ( 2 4 + 1 8 ∗ 2 4 ∗ 4 2 ∗ 4 4 ) = 3 8 9 1 2 0 , for a grand total of 3 8 9 1 1 2