SMARANDACHE ROUTE SEQUENCES

Consider a rectangular city with a mesh of tracks which are of equal length and which are either horizontal or vertical and meeting at nodes. If one row contains m tracks and one column contains n tracks then there are (m+l)(n+-l) nodes. To begin with let the city be of a square shape ie. m= n

SMARANDACHE RECIPROCAL FUNCTION AND AN ELEMENTARY INEQUALITY

The Smarandache Function is defined as S(n) = k . Where k is the smallest integer such that n divides k

ALGORITHM FOR LISTING OF SMARANDACHE FACTOR PARTITIONS

In this note an algorithm to list out all the SFPs of a number without missing any is developed

SOME MORE CONJECTURES ON PRIMES AND DIVISORS

There are an innumerable numbers of conjectures and unsolved problems in number theory predominantly on primes which have been giving sleepless nights to the mathematicians allover the world for centuries

A GENERAL RESULT ON THE SMARANDACHE STAR FUNCTION

In this paper, the result ( theorem-2.6) Derived in REF. [2], the paper "Generalization Of Partition Function, Introducing 'Smarandache Factor Partition' which has been observed to follow a beautiful pattern has been generalized

DEPASCALISATION OF SMARANDACHE PASCAL DERIVED SEQUENCES AND BACKWARD EXTENDED FIBONACCI SEQUENCE

We call the process of extracting the base sequence from the Pascal derived sequence as Depascalisation. The interesting observation is that this again involves the Pascal's triangle though with a difference