Abstract
Let [Formula: see text] be a positive integer and let [Formula: see text] be the set of positive integers less than [Formula: see text] that are relatively prime to [Formula: see text]. If [Formula: see text] can be partitioned into two subsets of equal sum, then [Formula: see text] is called a super totient number. In this paper, we generalize this concept by considering when [Formula: see text] can be partitioned into [Formula: see text] subsets of equal sum. Integers that admit such a partition are called [Formula: see text]-fold super totient numbers. In this paper, we prove that for every odd positive integer [Formula: see text], there exists an integer [Formula: see text] such that for all [Formula: see text], [Formula: see text] is a [Formula: see text]-fold super totient numbers provided that some trivial necessary condition is satisfied. Furthermore, we determine the smallest allowable values for [Formula: see text] and [Formula: see text].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
