Main menu
Click categories to expand
A-Z listingplugin-autotooltip__plain plugin-autotooltip_bigA-Z listing
This is an alphabetical index of all content pages.
Other categories
Utilities
Also see
Importance Ratings
News
Legal
Donate/Sponsor
Curator's rationale
AI Policy
Twitter feed ð•
Feeds + s.e.o. etc.
rss / xml feed 
sitemap file
A-Z listing (archived)
The totient function φ(n), also called Euler's totient function, is defined as the number of positive integers ≤ n that are relatively prime to (i.e., do not contain any factor in common with) n, where 1 is counted as being relatively prime to all numbers.
Source : Wolfram MathWorld
In other words, it is the number of integers k in the range 1 ≤ k ≤ n for which the greatest common divisor gcd(n, k) is equal to 1.
Source : Wikipedia
In 1932, American mathematician D.H Lehmer outlined his 'Totient Problem', which links the totient function to properties of composite numbers.
Lehmer's totient problem asks if there exist any composite numbers n such that φ (n) | (n-1) where φ (n) is the totient function.
Source : Wolfram MathWorld
The problem remains unresolved.
For an example of current research on the problem see : The spanning method and the Lehmer totient problem arXiv: 2003.13055 (math)
Ideas for new topics, and suggested additions / corrections for older ones, are always welcome.
If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !
Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.
( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)
You are currently viewing an auto-translated version of Wikenigma
Please be aware that no automatic translation engines are 100% accurate, and so the auto-translated content will very probably feature errors and omissions.
Nevertheless, Wikenigma hopes that the translated content will help to attract a wider global audience.
DOKUWIKI IMPLEMENTATION DESIGN BY UNIV.ORG.UK DECEMBER 2023