Calculating The Smarandache Numbers
Jon Perry
Abstract
Open-access reader
Jon Perry
Abstract
Open-access reader
The Smarandache Numbers are: 1,2,3,4,5,3,7,4,6,5,11,4,13,7,5,6,17,6,19,5,7, 11 ,23,4,1 0, 1, 3, 9,7,29,5,31,8,11,17,7,6,37, 19,13,5,41,7,43,11,6,23,47,6,14,10,17,13,53,9,11 ,7, 19,29,59,5,61,31,7,8,13,11,67,17, 23,7,71,6,73,37,10,19,11,13,79,6,9,41,83,7, ... and defined as the smallest integer m such that n divides mt Finding the exact value of a(n) is an open problem, and this paper presents an effective algorithm for detennining the value of a(n).
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.
The Smarandache Numbers are: 1,2,3,4,5,3,7,4,6,5,11,4,13,7,5,6,17,6,19,5,7, 11 ,23,4,1 0, 1, 3, 9,7,29,5,31,8,11,17,7,6,37, 19,13,5,41,7,43,11,6,23,47,6,14,10,17,13,53,9,11 ,7, 19,29,59,5,61,31,7,8,13,11,67,17, 23,7,71,6,73,37,10,19,11,13,79,6,9,41,83,7, ... and defined as the smallest integer m such that n divides mt Finding the exact value of a(n) is an open problem, and this paper presents an effective algorithm for detennining the value of a(n).
Key concepts: Mathematics