A Java Concurrent Program for the Smarandache Function
by
Sabin Tabirca
University College Cork, Computer Science Department
Coauthors: David Powel, University College Cork, Computer Science Department

A Java Concurrent Program for the Smarandache Function David Powel and Sabin Tabirca University College Cork, Computer Science Department s.Tabirca@cs.ucc.ie Many algorithms for computing the Smarandache function have been proposed so far. Tabirca [1998] proposed a simple computation based on the function definition. Ibstedt [1998] proposed a more power algorithm that was implemented Basic. No parallel or concurrent algorithm has been developed so far.

The paper proposes a Java concurrent algorithm for the Smarandache function. The starting point of this algorithm is given by the property ‘(a,b)=1 => S(ab)=max{S(a),S(b)}’. Based on the Java threads the function is computed. Finally, some computational results are presented in order to justify the efficiency of our method.

H. Ibstedt (1997) Surfing on the ocean of numbers; A few Smarandache notions and similar topics, Erhus University Press, Vail, USA.

S. Tabirca and T. Tabirca (1998) Some computation aspect of the Smarandache function, Proceedings of the First International Conference on Smarandache type notions, Craiova.

Keywords: Java, thread, the Smarandache function.

Date received: November 20, 2000