The Solution of Equation Involving the Euler Function
Zhao Jiao-lian
Abstract
Zhao Jiao-lian
Abstract
For any positive integer n,the Smarandache LCM function is defined as the smallest positive integer k such as n | [1,2,,k ],where[1,2,,k ]denotes the most common multiple of 1,2,,k.Euler's totient function is defined as the number of positive integers 1,2,3,,n-1 that are reciprocal prime to n.In this paper,using the elementary methods and classification discussion the solvability of SL(n) = φ(n) were studied.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For any positive integer n,the Smarandache LCM function is defined as the smallest positive integer k such as n | [1,2,,k ],where[1,2,,k ]denotes the most common multiple of 1,2,,k.Euler's totient function is defined as the number of positive integers 1,2,3,,n-1 that are reciprocal prime to n.In this paper,using the elementary methods and classification discussion the solvability of SL(n) = φ(n) were studied.
Key concepts: Euler's totient function, Mathematics, Integer (computer science), Reciprocal, Euler's formula, Prime (order theory), Function (biology), Combinatorics