# Thread: Euler Phi primes with just definition of Phi

1. ## Euler Phi primes with just definition of Phi

So I was given a pretty easy problem
Calculate $\phi(2p)$ where $p$ is prime.
Which I can solve with what I have read online:
* Given $\phi(ab)$ if $(a,b)=1$, then $\phi(a) \phi(b)$

Then it's pretty easy:
$\phi(2p)$ and since $(2,p)=1$, then $\phi(2) \phi(p) = 1*(p-1) = p-1$

But the problem is, in class we haven't proved * ,so we can't use it. Pretty much all we know about $\phi(m)$ is that it is the number of positive integers wich are less than m and relatively prime to m. AND $\phi(p) = p-1$.

I'm just wondering how I would go about doing this?
Thanks

EDIT:
After some thought and more reading I came to this:

CASE 1 : if p != 2
$\phi(2p) = \phi(2^1p^1)=$
$2p(1-1/2)(1-1/p) = p-1$

Case 2: $p = 2$
$\phi(2*2) = \phi(4) =\phi(2^2)=$
$4(1-1/2) = 2$

Am I correct in my reasoning?

2. I think they are expecting you to calculate the value from the definition of $\phi(n)$.

How many numbers below 2p are coprime to 2?
How many numbers below 2p are coprime to p?

3. Originally Posted by SimonM
I think they are expecting you to calculate the value from the definition of $\phi(n)$.

How many numbers below 2p are coprime to 2?
How many numbers below 2p are coprime to p?
Hmm,
I get something like
when p != 2
How many numbers below 2p are coprime to 2? $2p-2$
How many numbers below 2p are coprime to p? $(1/2) 2p$
with overlapping = $p-1$, but I don't know how to show this other than example values of p?