Talk: Euler's totient function

This is the talk page for discussing improvements to the Euler's totient function page.
Please sign and date your posts by typing four tildes (~~~~). Put new text under old text. Click here to start a new topic. If you're new to the wiki, please take a look at the talk page help.	Be polite Assume good faith Be welcoming

Proof of Euler's product formula

The proof of Euler's product formula here is invalid. To prove induction (which in this case is on the number of distinct prime factors of x) you need to prove a base case and inductive step (ie, true for k implies true for k + 1). What has been proved here is the base case, n=1, then n=2. That doesn't prove it for any other natural numbers. A true inductive proof involves a very messy inclusion-exclusion formula--Acer4666 (talk) 13:25, June 3, 2012 (UTC)