![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextgreen.png)
![Open Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_open_medium.gif)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltextred.png)
![Restricted Access](https://i-scholar.in/lib/pkp/templates/images/icons/fulltext_restricted_medium.gif)
On Euler's Φ-Function and its Extensions
Subscribe/Renew Journal
The type of argument given in text-books to derive the form of Φ(n)-the number of numbers less than n and prime to n, is as follows. If n be the given number and p1, p2,...,pq be the different prime factors of n, then there are n/Pi numbers divisible by pi, n/pj numbers divisible by pj, and so on. Generally there are n/pipjpk..... numbers divisible by pi, pj, pk,......, simultaneously.
Subscription
Login to verify subscription
User
Font Size
Information
![](https://i-scholar.in/public/site/images/abstractview.png)
Abstract Views: 194
![](https://i-scholar.in/public/site/images/pdfview.png)
PDF Views: 0