A brief account on Smarandache 2-2 subtractive relationships Henry Ibstedt
Abstract: An analysis of the number of relations of the type S(n} S(n+l)=S(n+2}S(n+3) for n<108 where S(n) is the Smarandache function leads to the plausible conclusion that there are infinitely many of those.
This briefnote on Smarandache 2-2 subtractive relationships should be seen in relation to the article on Smarandache k-k additive relationships in this issue of SNJ [1]. A Smarandache 2-2 subtractive relationship is defined by 8(n)-8(n+ 1)=S(n+2)-S(n+3) where Sen) denotes the Smarandache function. In an article by Bencze [2] three 2-2 subtractive relationships are given 8(1)-8(2)=S(3)-S(4), 1-2=3-4 8(2)-S(3)=8(4)-8(5), 2-3=4-5 S(49)-S(50)=S(51 )-S( 52), 14-10=17-13 The first of these solutions must be rejected since S(I)=O not 1. The question raised in the article is ''How many quadruplets verify a Smarandache 2-2 subtractive relationship?' As in the case of Smarandache 2-2 additive relationships a search was carried for ~108. In all 442 solutions were found. The first 50 of these are shown in table 1. Table 1. The 50 first 2-2 subtractive relations. # 1 2 3 4 5 6 7 8 9 10 11 12 13 14
15 16 17 18 19 20 21 22
n 2 40 49 107 2315 3913 4157 4170 11344 11604 11968 13244 15048 19180 19692 26219 29352 29415 43015 44358 59498 140943
S(n) 2 5 14 107 463 43 4157 139 709 967 17 43 19 137 547 167 1223 53 1229 7393 419 4271
S(n+1) 3 41 10 9 193 103 11 97 2269 211 11969 883 149 19181 419 23 197 3677 283 6337 601 383
99
S(n+3) 4 7 17 109 331 29 4159 149 61 829 19 179 43 139 229 2017 1129 1279 1103 1109 17 4027
S(n+4) 5 43 13 11 61 89 13 107 1621 73 11971 1019 173 19183 101 1873 103 4903 157 53 199 139