Is g(n)=8n/15 Only When n Is Divisible by 3 and 5?

  • Context: MHB 
  • Thread starter Thread starter Poirot1
  • Start date Start date
  • Tags Tags
    Function Proof
Click For Summary

Discussion Overview

The discussion revolves around the conditions under which the Euler totient function g(n) equals 8n/15, specifically focusing on whether this holds true only when n is divisible by 3 and 5 and by no other primes. The scope includes mathematical reasoning and proof strategies related to the properties of the totient function.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • One participant suggests rewriting n as a product of powers of 3 and 5 and using the multiplicative property of the totient function.
  • Another participant emphasizes that n must be divisible by 3 and 5 for g(n) to be an integer and explores the implications of including another prime p in the factorization of n.
  • A different participant reiterates the original question and proposes that the condition for g(n) to equal 8n/15 is satisfied only when n equals 15, based on the formula for the Euler totient function.
  • There is a mention of the product over primes in relation to the equation g(n) = 8n/15, indicating that specific conditions on the prime factors of n are necessary.

Areas of Agreement / Disagreement

Participants express differing views on the conditions required for g(n) to equal 8n/15. While some agree on the necessity of divisibility by 3 and 5, others introduce the possibility of additional primes affecting the outcome, leading to an unresolved discussion.

Contextual Notes

The discussion does not resolve the mathematical steps or assumptions regarding the inclusion of other primes in the factorization of n, leaving open questions about the implications of these factors on the totient function.

Poirot1
Messages
243
Reaction score
0

Show that g(n)=8n/15 iff n is divisible by 3 and 5 and by no other primes, where g is the euler totient function.

How to go about the proof?




 
Mathematics news on Phys.org
Re: totient function proof

Rewrite $N$ as a product of powers of $3$ and $5$. Use the multiplicative property, and what is the totient of a prime power?

Full derivation below.

If $N = 3^m \cdot 5^n$ then $\varphi(N) = \varphi(3^m \cdot 5^n)$. Using the multiplicative property:

$$\varphi(3^m \cdot 5^n) = \varphi(3^m) \cdot \varphi(5^n)$$
And you know that for prime $p$ we have:

$$\varphi(p^k) = p^{k - 1} \cdot (p - 1)$$
And so:

$$\varphi(3^m) \cdot \varphi(5^n) = \left ( 3^{m - 1} \cdot (3 - 1) \right ) \cdot \left ( 5^{n - 1} \cdot (5 - 1) \right ) = 8 \cdot 3^{m - 1} \cdot 5^{n - 1}$$
And...

$$3^m \cdot 5^n = N ~ ~ ~ \implies ~ ~ ~ 3^m \cdot 5^n \cdot \left ( 3^{-1} \cdot 5^{-1} \right ) = 3^{m - 1} \cdot 5^{n - 1} = N \cdot 15^{-1}$$
And we conclude:

$$\varphi(N) = 8 \cdot 3^{m - 1} \cdot 5^{n - 1} = 8 \cdot N \cdot 15^{-1} = \frac{8}{15} \cdot N$$
 
Last edited:
Re: totient function proof

first n should be divisible by 3 and 5 since phi(n) is the number of the positive integers relatively prime with n
so phi(n) is integer for all n.
suppose n is divisible by another prime p, say
n = 3^r 5^s p^t...(1)
g is multiplicative
g(n) = g(3^r)\cdot g(5^s)\cdot g(p^t)

g(n) = 3^r \left( 1 - \frac{1}{3} \right) 5^s \left(1 - \frac{1}{5} \right)g(p^t)

g(n) = 3^r \left( \frac{2}{3} \right) 5^s \left(\frac{4}{5} \right) g(p^t)

g(n) =3^r\cdot 5^s \left( \frac{8}{15} \right) g(p^t)

from (1)
3^r\cdot 5^s = \frac{n}{p^t}

g(n) = \frac{8n}{15} \frac{g(p^t)}{p^t}
we want p such that g(p^t) = p^t , that's true for 1 just
 
Poirot said:

Show that g(n)=8n/15 iff n is divisible by 3 and 5 and by no other primes, where g is the euler totient function.

How to go about the proof?


The basic formula of the Euler's Totiens Function is...

$\displaystyle \varphi (n) = n\ \prod _{p|n} (1-\frac{1}{p})$ (1)

... so that Your equation...

$\displaystyle \varphi(n)= \frac{8\ n}{15}$ (2)

... is satisfied if...

$\displaystyle \prod _{p|n} (1-\frac{1}{p}) = \frac{8}{15}$ (3)

... and that happens only for $\displaystyle n= 3 \cdot 5 = 15$ ...

Kind regards

$\chi$ $\sigma$
 

Similar threads

Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
6
Views
3K
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 55 ·
2
Replies
55
Views
6K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K