Department of Mathematics,
|
Searching through the Archives of the |
|
I found interesting sequences of numbers and problems |
|
related to them. I display some of them, and the readers |
|
are welcome to contribute with solutions or ideas. |
Key words:
|
Smarandache P-digital subsequences, Smarandache P-partial subsequences, |
|
Smarandache type partition, Smarandache S-sequences, |
|
Smarandache uniform sequences, Smarandache operation sequences. |
Let { an }, n > 1 be a sequence
defined by a property (or a relationship involving its terms P.) Now, we screen
this sequence, selecting only its terms whose digits hold the property (or
relationship involving the digits) P.
The new sequence obtained is called:
(1) Smarandache P-digital subsequences.
For example:
(a) Smarandache square-digital subsequence:
0, 1, 4, 9, 49, 100, 144, 400, 441, . . .
i.e. from 0, 1, 4, 9, 16, 25, 36, ..., n2, ... we choose only
the terms whose digits are all perfect squares
(therefore only 0, 1, 4, and 9).
Disregarding the square numbers of the form
|
___________ |
|
N0 . . . 0, |
|
2k zeros |
where N is also a perfect square, how many
other numbers belong to this sequence?
(b) Smarandache cube-digital subsequence:
0, 1, 8, 1000, 8000, . . .
i.e. from 0, 1, 8, 27, 64, 125, 216, . . . , n3, . . . we choose
only the terms whose digits are all perfect cubes
(therefore only 0, 1 and 8).
Similar question, disregarding the cube numbers of the form
|
___________ |
|
M0 . . . 0, |
|
3k zeros |
where M is a perfect cube.
(c) Smarandache prime digital subsequence:
2, 3, 5, 7, 23, 37, 53, 73, . . .
i.e. the prime numbers whose digits are all primes.
Conjecture: this sequence is infinite.
In the same general conditions of a given sequence, we screen it selecting only
its terms whose groups of digits hold the property (or relationship involving
the groups of digits) P.
[ A group of digits may contain one or more digits, but not the whole term.]
The new sequence obtained is called:
(2) Smarandache P-partial digital subsequence.
Similar examples:
(a) Smarandache square-partial-digital subsequence:
49, 100, 144, 169, 361, 400, 441, . . .
i.e. the square members that is to be partitioned into groups of digits which
are also perfect squares.
(169 can be partitioned as 16 = 42 and 9 = 32, etc.)
Disregarding the square numbers of the form
|
___________ |
|
N0 . . . 0, |
|
2k zeros |
where N is also a perfect square, how many
other numbers belong to this sequence?
(b) Smarandache cube-partial digital subsequence:
1000, 8000, 10648, 27000, . . .
i.e. the cube numbers that can be partitioned into groups of digits which are
also perfect cubes.
(10648 can be partitioned as 1 = 13, 0 = 03, 64 = 43,
and 8 = 23).
Same question: disregarding the cube numbers of the form:
|
___________ |
|
M0 . . . 0, |
|
3k zeros |
where M is also a perfect cube, how many
other numbers belong to this sequence.
(c) Smarandache prime-partial digital subsequence:
23, 37, 53, 73, 113, 137, 173, 193, 197, . . .
i.e. prime numbers, that can be partitioned into groups of digits which are
also prime,
(113 can be partitioned as 11 and 3, both primes).
Conjecture: this sequence is infinite.
(d) Smarandache Lucas-partial digital sunsequence
123, . . .
i.e. the sum of the two first groups of digits is equal to the last group of
digits, and the whole number belongs to Lucas numbers:
2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, . . .
(beginning at 2 and L(n+2) = L(n+1) + L(n), n > 1) ( 123 is partitioned as
1, 2 and 3, then 3 = 2 + 1). Is 123 the only Lucas number that verifies a
Smarandache type partition?
Study some Smarandache P - (partial) - digital subsequences associated to:
- Fibonacci numbers (we were not able to find any Fibonacci number verifying a
Smarandache type partition, but we could not investigate large numbers; can
you? Do you think none of them would belong to a Smarandache F - partial-
digital subsequence?
- Smith numbers, Eulerian numbers, Bernoulli numbers,
Mock theta numbers, Smarandache type sequences etc.
Remark: Some sequences may not be smarandachely
partitioned (i.e. their associated Smarandache type subsequences are empty).
If a sequence {an }, n >= 1 is defined by an = f(n) (
a function of n), then Smarandache f-digital subsequence is obtained by
screening the sequence and selecting only its terms that can be partitioned in
two groups of digits g1 and g2 such that
g2 = f(g1 ).
For example:
(a) If an = 2n, n >= 1, then
Smarandache even-digital subsequence is:
12, 24, 36, 48, 510, 612, 714, 816, 918, 1020, 1122, 1224, . . .
(i.e. 714 can be partitioned as g1 = 7, g2 = 14, such
that 14 = 2*7, etc. )
(b) Smarandache lucky-digital subsequence
37, 49, . . .
(i.e. 37 can be partitioned as 3 and 7, and L3 = 7; the lucky
numbers are
1, 3, 7, 9, 13, 15, 21, 25, 31, 33, 37, 43, 49, 51, 63, . . .
How many other numbers belong to this subsequence? Study the Smarandache
f-digital subsequence associated to other well-known sequences.
(3) Smarandache odd sequence:
1, 3, 135, 1357, 13579, 1357911, 135791113, 13579111315, 1357911131517, ...
How many of them are prime?
(4) Smarandache even sequence:
2, 24, 246, 2468, 246810, 24681012, 2468101214, 246810121416, . . .
Conjecture: None of them is a perfect power!
(5) Smarandache prime sequence:
2, 23, 235, 2357, 235711, 23571113, 2357111317, 235711131719,
23571113171923, . . .
How many of them are prime?
(Conjecture: a finite number).
(6) Smarandache S-sequence:
General definition:
Let S1 , S2 , S3 , . . . , Sn
, . . . be an infinite integer sequence (noted by S). Then
|
|
___ |
______ |
|
_______________ |
|
|
S1, |
S1S2, |
S1S2,S3 |
. . . |
S1S2,S3 . . . Sn |
. . |
is called the Smarandache S-sequence.
Question:
(a) How many of the Smarandache S-sequence belong
to the initial S sequence?
(b) Or, how many of the Smarandache S-sequence verify the relation of other
given sequences?
For example:
If S is the sequence of odd numbers 1, 3, 5, 7, 9, . . . then the Smarandache
S-sequence is 1, 13, 135, 1357, . . . [(i.e.1)] and all the other terms are
odd;
Same if S is the sequence of even numbers [(i.e. 2)]
The question (a) is trivial in this case.
But,when S is the sequence
of primes [i.e. 3], the question becomes much harder.
Study the case when S (replaced by F) is the Fibonacci sequence (for one
example):
1, 1, 2, 3, 5, 8, 13, 21, . . . .
Then the Smarandache F - sequence
1, 11, 112, 1123, 11235, 112358, . . .
How many primes does it contain?
(7) Smarandache uniform sequences:
General definition:
Let n be an integer not equal to zero and d1 , d2 , . . .
, dr digits in a base B
(of course r < B).
Then: multiples of n, written with digits d1 ,
d2 , . . . ,dr only (but all r
of them), in base B, increasingly ordered, are called the Smarandache uniform
sequence.
As a particular case it's important to study the multiples written with one
digit only (when r = 1).
Some examples (in base 10):
(a) Multiples of 7 written with digit 1 only:
111111, 111111,111111, 111111,111111,111111, 111111,111111,111111,111111, ...
(b) Multiples of 7 written with digit 2 only:
222222, 222222222222, 222222222222222222, 222222222222222222222222, ...
(c) Multiples of 79365 written with digit 5 only:
555555, 555555555555, 555555555555555555, 555555555555555555555555, ...
For some cases, the Smarandache uniform sequence may be empty (impossible):
(d) Multiples of 79365 written with digit 6 only (because any multiple of 79365
will end in 0 or 5.
Remark: If there exists at least a multiple m of n, written with digits d1
,d2 , . . ., dr only, in base
B, then there exists an infinite number of multiples of n (they have the form:
|
|
___ |
____ |
_____ |
|
m, |
mm, |
mmm, |
mmmm, . . . |
With a computer program it's easy to select all multiples (written with
certain digits) of a given number - up to some limit.
Exercise: Find the general term expression for multiples of 7 written with digits
1, 3, 5 only in base 10.
(8) Smarandache operation sequences:
General definition:
Let E be an ordered set of elements, E = { e1 ,e2 , . . .
} and O a set of binary operations well-defined for these elements.
Then: a1 is an element of { e1
,e2 , . . . }.
an+1 = min { e1 O1
e2 O2 . . . On en+1 } > an
, for n > 1.
where all Oi are
operations belonging to O, is called the Smarandache operation sequence.
Some examples:
(a) When E is the natural number set, and O is formed by the four arithmetic operations:
+, -, *, /.
Then: a1 = 1
an+1 = min { 1 O1 2 O2
. . . On (n+1) } > an , for n > 1,
(therefore, all Oi may be chosen among
addition, subtraction, multiplication or division in a convenient way).
Questions: Find this Smarandache arithmetics operation
infinite sequence. Is it possible to get a general expression formula for
this sequence (which starts with 1, 2, 3, 5, 4,?
(b) A finite sequence
a1 = 1
an+1 = min { 1 O1 2 O2
... O98 99 } > an
for n > 1, where all Oi are elements of
{ +, -, *, / }.
Same questions for this Smarandache arithmetics
operation finite sequence.
(c) Similarly for Smarandache algebraic operation infinite sequence
a1 = 1
an+1 = min { 1 O1 2 O2 . . . On
(n+1) } > an for n > 1,
where all Oi are elements of { +, -, *, /,
**, ysqrtx }
( X**Y means XY and ysqrtx means the yth root of x).
The same questions become harder but more exciting.
(d) Similarly for Smarandache algebraic operation finite sequence:
a1 = 1
an+1 = min { 1 O1 2 O2 . . . O98
99} > an , for n > 1,
where all Oi are elements of { +, -, *, /,
**, ysqrtx }
( X**Y means XY and ysqrtx means the yth root of x).
Same questions.
More generally: one replaces "binary operations" by "Ki -ary
operations"
where all Ki are integers >= 2).
Therefore, ai is an element of
{ e1 , e2 , . . . },
|
an+1
= min{ 1 O1(K1)2O1(K1)
. . . O1(K1) K1
O2(K2)(K2+1O2( |
|
O1(K1)
is K1 - ary
O2(K2) is |
|
|
|
|
|
(n+2-Kr)Or(Kr) . . . Or(Kr)(n+1)} > an, for n > 1 |
Of course K1 + (K2 - 1) + . . .+
(Kr - 1) = n+1.
Remark: The questions are much easier when O = { +,-};
study the Smarandache operation type sequences in this case.
(9) Smarandache operation sequences at random:
Same definitions and questions as for the previous sequences, except that
an+1 = { e1 O1 e2 O2 . .
. On en+1 } > an , for n > 1,
(i.e. it's no "min" any more, therefore an+1 will
be chosen at random, but greater than an , for any n > 1). Study
these sequences with a computer program for random variables (under weak
conditions).
1. Smarandache, F. (1975) "Properties of the Numbers", Arhivele Statului,
Filiala Valcea, Rm. Valcea, Romania,
[see also
* Originally appeared in Bulletin of Pure and Applied Sciences, Vol. 15 E (No. 1), 1996; pp. 101-107.