More problems in 2016 part 3

d 67363 d ϕ ( d ) = p q \large\sum_{d\mid 67363}\frac{d}{\phi(d)}=\dfrac{p}{q}

Given that p p and q q are coprime positive integers, find p + q p + q .

Notation


Try similar problems : 1 , 2 and 3 .


The answer is 38747.

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

Otto Bretscher
Dec 29, 2015

Nice problem!

The functions d d and ϕ ( d ) \phi(d) are multiplicative, and so is their quotient d ϕ ( d ) \frac{d}{\phi(d)} and their divisor sum f ( n ) = d n d ϕ ( d ) f(n)=\sum_{d|n}\frac{d}{\phi(d)} . Thus f ( 67362 ) = f ( 31 41 53 ) = p f ( p ) = p ( 1 ϕ ( 1 ) + p ϕ ( p ) ) = p ( 1 + p p 1 ) = 34587 4160 f(67362)=f(31*41*53)=\prod_pf(p)=\prod_p\left(\frac{1}{\phi(1)}+\frac{p}{\phi(p)}\right)=\prod_p\left(1+\frac{p}{p-1}\right)=\frac{34587}{4160}

where the products are taken over p = 31 , 41 , 53 p=31,41,53 . The answer is 34587 + 4160 = 38747 34587+4160=\boxed{38747}

Thank you Sir.May I make set of all this totient problems including your problems ? @Otto Bretscher

A Former Brilliant Member - 5 years, 5 months ago

Log in to reply

Sure... it's a lovely topic!

Otto Bretscher - 5 years, 5 months ago

Sir is it always necessary to take any aq.free no ?

A Former Brilliant Member - 5 years, 5 months ago

Log in to reply

The method works for all positive integers... just compute f ( p k ) f(p^k)

Otto Bretscher - 5 years, 5 months ago

Can this function exist ? @Otto Bretscher

O ( 1 ) = 1 i f O ( n ) = n i s a p e r f e c t s q . o t h e r t h a n 1 , o t h e r w i s e ( 1 ) q + p } = O ( n ) \left.\begin{matrix} & O(1)=1 & \\ & if O(n) = n is a perfect sq. other than 1 , & \\ & otherwise (-1)^{q+p} & \end{matrix}\right\}= O(n)

also , if p= any prime number , then O(p)=p

Where p and q are largest an smallest prime factors of n respectively

also see this

A Former Brilliant Member - 5 years, 5 months ago

Log in to reply

What would be O ( 24 ) O(24) ?

Otto Bretscher - 5 years, 5 months ago

Log in to reply

( 1 ) 5 (-1)^5 @Otto Bretscher

A Former Brilliant Member - 5 years, 5 months ago

Log in to reply

@A Former Brilliant Member Why not 0? What's with the p 3 n p^3|n rule? The function does not seem to be well-defined.

Otto Bretscher - 5 years, 5 months ago

Log in to reply

@Otto Bretscher P should be a perfect cube , such that , 2.2.2 =8 = O(8)=0 but 3.3.3.2 wont be equal to 0 as it is not a perfect cube. Now is it a valid function ? @Otto Bretscher I know it wont be a multiplicative function , right ?

A Former Brilliant Member - 5 years, 5 months ago

Log in to reply

@A Former Brilliant Member You have to change the definition then. Do you want to say p 3 = n p^3=n in case 2? In case 3 you would have to say "otherwise". (No, it's certainly not multiplicative)

Otto Bretscher - 5 years, 5 months ago

Log in to reply

@Otto Bretscher I am working on the case of n=any prime number , what can be for prime numbers ? @Otto Bretscher

A Former Brilliant Member - 5 years, 5 months ago

how is it now ? how can we prove the existence of this function ? @Otto Bretscher

A Former Brilliant Member - 5 years, 5 months ago

How can the existence of this function be proved ? @Otto Bretscher ?

A Former Brilliant Member - 5 years, 5 months ago

Log in to reply

In the second case I would say " O ( n ) = 0 O(n)=0 if n n is a perfect square other than 1.

Otto Bretscher - 5 years, 5 months ago

Log in to reply

Can it have any applications ? @Otto Bretscher

A Former Brilliant Member - 5 years, 5 months ago

Please do tell is that function well defined ? How can the existence of that function be proved ? @Otto Bretscher

A Former Brilliant Member - 5 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...