3 views

Uploaded by Mia Amalia

Eight particular, Smarandache Recurrence Sequences and a Smarandache General-Recurrence Sequence are defmed below and exemplified (found in State Archives, Rm, Valcea, Romania).

save

- secuence and series
- unit 2 3 acc scope and sequence
- 6) C1 Sequences and Series Questions
- Recitation 5
- Sequence & Series Theory_e
- Derivatives of Regular Expressions
- Dll Format_demo Teaching
- On a Smarandache Partial Perfect Additive Sequence, by H.Ibstedt
- Sequences and Patterns
- PI Programming Questions VII
- Sequences
- Scribd Drivel and Chemistry
- C1 Sequences and Series Questions
- Pattern Signs Screen
- L.No.14
- 6_Adesh kumar Tripathi
- olympiad book
- SMO2010OpenW
- festo-grafcet.pdf
- Indices C1 Edexcel
- PCS1314 Algebra I Chapter 3 Test KEY
- Chap0Lec1
- Theorist's Toolkit Lecture 8: High Dimensional Geometry and Geometric Random Walks
- PRACH
- tableofspecificationpreparation-170812124918
- Description
- 10th Mathematics Matriculation Level
- Curriculum Audit q1 g 10 Bugetted Lesson
- Infinite Series
- Neutrosophic Crisp Bi-Topological Spaces
- Rough Neutrosophic Multisets Relation with Application in Marketing Strategy
- Fuzzy Neutrosophic Alpha m-Closed Sets in Fuzzy NeutrosophicTopological Spaces
- Multi-Objective Portfolio Selection Model with Diversification by Neutrosophic Optimization Technique
- Single Valued Neutrosophic Numbers and Analytic Hierarchy Process for Project Selection
- On Geodesics of the Tangent and Normal Surfaces Defined by TN-Smarandache Curve According to Frenet Frame
- Pest Analysis Based on Neutrosophic Cognitive Maps: A Case Study for Food Industry
- Neutrosophic Units of Neutrosophic Rings and Fields
- Smarandache Curves According to q-Frame in Euclidean 3-Space
- On Neutrosophic Crisp Semi Alpha Closed Sets
- A Revisit to NC-VIKOR Based MAGDM Strategy in Neutrosophic Cubic Set Environment
- An Inventory Model under Space Constraint in Neutrosophic Environment: A Neutrosophic Geometric Programming Approach
- Neutrosophic Triplet Normed Ring Space
- Bi-level Linear Programming Problem with Neutrosophic Numbers
- On Smarandache Curves of Involute-evolute Curve According to Frenet Frame in Minkowski 3-space
- Different Forms of Triangular Neutrosophic Numbers, De-Neutrosophication Techniques, and their Applications
- Fixed Point Theorem for Neutrosophic Triplet Partial Metric Space
- Dual Generalized Nonnegative Normal Neutrosophic Bonferroni Mean Operators and Their Application in Multiple Attribute Decision Making
- Design of Fuzzy Cognitive Model of Mutual Influence and Connectivity of Innovative Technologies
- Smarandache Curves of Bertrand Curves Pair According to Frenet Frame
- A Forecasting Model Based on Multi-Valued Neutrosophic Sets and Two-Factor, Third-Order Fuzzy Fluctuation Logical Relationships
- A Generalization of Surfaces Family with Common Smarandache Asymptotic Curves in Galilean Space
- SINGLE-VALUED NEUTROSOPHIC HYPERGRAPHS
- Some Generalized Dice Measures for Double-Valued Neutrosophic Sets and Their Applications
- An OWA Distance-Based, Single-Valued Neutrosophic Linguistic TOPSIS Approach for Green Supplier Evaluation and Selection in Low-Carbon Supply Chains
- A Neutrosophic Set Based Fault Diagnosis Method Based on Multi-Stage Fault Template Data
- Fundamental Homomorphism Theorems for Neutrosophic Extended Triplet Groups
- Research on Construction Engineering Project Risk Assessment with Some 2-Tuple Linguistic Neutrosophic Hamy Mean Operators
- Some Generalized Dice Measures for Double-Valued Neutrosophic Sets and Their Applications
- Different Methodologies in Treating Uncertainty

*

Mihaly Beneze Brasov, Romania

ABSTRACT

Eight particular, Smarandache Recurrence Sequences and a Smarandache General-Recurrence Sequence are defmed below and exemplified (found in State Archives, Rm, Valcea, Romania).

A. 1,2,5,26,29,677,680, 701, 842, 845, 866, 1517,458330,458333,458354, ... (ss2(n) is the smallest nwnber, strictly greater than the previous one, which is the squares swn of two previous distinct terms of the sequence; in our particular case the first two terms are I and 2.) Recurrence definition:

(1) The nwnbers a ~ b belong to SS2; (2) Ifb, c belong to SS2, then b2 + c2 belongs to SS2 too; (3) Only nwnbers, obtained by rules [(1) and/or (2)] applied a fmite nwnber oftimes, belong to SS2.

The sequence (set) SS2 is increasingly ordered. [ Rule (1) may be changed by: the given nwnbers ab a2, a3, ... , ak, where k 2: 2, belongs to SS2.] B.l, 1,2,4,5,6, 16, 17, 18,20,21,22,25,26,27,29,30,31,36,37,38,40,41,42,43,45,46, ... (SS I(n) is the smallest nwnber, strictly greater than the previous one, (for n 2: 3), which is the squares swn of one or more previous distinct terms of the sequence; in our particular case the first term is I.) Recurrence defmition: (I) The nwnber a belongs to SS 1; (2) Ifb b b2, ... , bk belong to SS 1, where k 2: 1, then b l 2 + ~ 2 + ... +b/ belongs to SS 1 too; (3) Only nwnbers, obtained by rules [(1) and/or (2)] applied a finite number oftimes, belong to SS!. The sequence (set) SS 1 is increasingly ordered. [Rule (1) may be changed by: the given nwnbers ab a2, ... , ax, where k 2: 1, belong to SS!.] C. 1,2,3,4,6,7,8,9,11, 12, 14,15,16,18,19,21, ... (NSS2(n) is the smallest nwnber, strictly greater than the previous one, which is NOT the squares swn of two previous distinct terms of the sequence; in our particular case the first two terms are 1 and 2.) Recurrence defmition:

(1) The nwnbers a ~ b belong to NSS2; (2) If b, c belong to NSS2, then b2+ c2 DOES NOT belong to NSS2; any other nwnbers belong to NSS2; (3) Only nwnbers, obtained by rules [(1) and/or (2)] applied a finite nwnber oftimes, belong to NSS2.

99

The sequence (set) NSS2 is increasingly ordered. [Rule (1) may be changed by; the given numbers ai, a2, ... , ak, where k ~ 2, belong to NSS2.] D. 1,2,3,6,7,8,11,12,15,16,17, 18, 19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35, 38,39,42,43,44,47, .. ,

(NSS 1(n) is the smallest number, strictly greater than the previous one, which is NOT the squares sum of one or more of the previous distinct terms of the sequence; in our particular case the first term is 1.) Recurrence defmition: (1) The number a belongs to NSS 1; (2) lfbl> b2, ... , bk belong to NSSl, where k ~ 1, then b/ + b/ + ... +bk2 DOES NOT belong to NSS 1; any other numbers belong to NSS 1; (3) Only numbers, obtained by rules [(1) and/or (2)] applied a finite number oftimes, belong to NSS1. [Rule (I) may be changed by: the given numbers aj, a2, ... , ak, where k ~ 1, belong to NSS1.] E. 1,2,9,730,737,389017001,389017008,389017729, ... (CS2(n) is the smallest number, strictly greater than the previous one, which is the cubes sum of two previous distinct terms of the sequence; in our particular case the first two terms are 1 and 2.) Recurrence defmition: (I) The numbers a ::; b belong to CS2; (2) If c,d belong to CS2, then c3 + d3 belongs to CS2 too; (3) Only numbers, obtained by rules [(1) and/or (2)] applied a fmite number oftimes, belong to CS2. The sequence (set) CS2 is increasingly ordered. [ Rule (1) may be changed by: the given numbers a\, a2, ... , ak, where k ~ 2, belong to CS2.j F. I, 1,2,8,9,10,512,513,514,520,521,522,729,730,731, 737, 738,739, 1241, ... (CS 1(n) is the smallest number, strictly greater than the previous one (for n ~ 3), which is the cubes sum of one or more previous distinct terms of the sequence; in our particular case the first term is 1; Recurrence defmition: (1) The number a belongs to CS 1; (2) lfbj,~, ... , bk belong to CSI, where k ~ 1, then b l 3 + b23 + ... + bk3 belongs to CS2 too; (3) Only numbers, obtained by rules [(1) and/or (2)] applied a finite number oftimes, belong to CSI. The sequence (set) CS 1 is increasingly ordered. [Rule (1) may be changed by: the given numbers aj, a2, ... , a., where k G.

~

2, belong to CSl.]

1,2,3,4,5,6,7,8,10,11,12,13,14,15,16,17, 18, 19,20,21,22,23,24,25,26,27,29,30,31,32, 33,34,36,37,38, ...

(NCS2(n) is the smallest number, strictly greater than the previous one, which is NOT the cubes sum of

100

two previous distinct tenns of the sequence; in our particular case the first two tenns are 1 and 2.) Recurrence definition:

(1) The numbers a

~ b belong to NCS2. (2) If c,d belong to NCS2, then c 3 + d3 DOES NOT belong to NCS2; any other numbers do belong to NCS2. (3) Only numbers, obtained by rules [(1) and/or (2)] applied a fmite number oftimes, belong to NCS2.

The sequence (set) NCS2 is increasingly ordered. [ Rule (1) may be changed by: the given numbers at. a2, ... , lik, where k ~ 2, belong to NCS2.]

H.I,2,3,4,5,6, 7,10,11,12,13,14,15,16,17, 18, 19,20,21,22,23,24,25,26,29,30,31,32,33,34, 37,38,39, ...

(NCS 1(n) is the smallest number, strictly greater than the previous one, which is NOT the cubes sum of one or more previous distinct tenns of the sequence; in our particular case the first tenn is 1.) Recurrence defmition: (2) Ifbt. b2, ... , bk belong to NCS1, where k ~ 1, then b 12 + b/ + ... + bk 2 DOES NOT belong to NCS1. (3) Only numbers, obtained by rules [(1) and/or (2)] applied a finite number oftimes, belong to NCS 1. The sequence (set) NCS 1 is increasingly ordered. [ Rule (1) may be changed by: the given numbers a\, a2, ... , lik, where k ~ 2, belong to NCS 1.]

1. General recurrence type sequence:

(1) The number a belongs to NCS1.

General recurrence defmition: Let k ~j be natural numbers, and at. a2, ... , ak be given elements, and Raj-relationship (relation among j elements). Then: (I) The elements at. a2, ... , ak belong to SGR. (2) Ifmb m2, ... , mj belong to SGR, then R(mb m2, ... , m) belongs to SGR too. (3) Only numbers, obtained by rules [(1) and/or (2)] applied a finite number oftimes, belong to SGR. The sequence (set) SGR is increasingly ordered. Method of construction of the general recurrence sequence: -level I: the given elements ab a2, ... , ak belong to SGR; -level 2: apply the relationship R for all combinations ofj elements among ab a2, ... ,~; the results belong to SGR too; order all elements of levels 1 and 2 together,

101

-level i+ 1:

ifbI.~' ... , bm are all elements of levels 1,2, ... , i-I and CI. C2, ... , C n are all elements of level i, then apply the relationship R for all combinations ofj elements among bI. b2, ... , bm, CI. C2, ... , C n such that at least an element is from the level i;

the results belong to SGR too; order all elements of levels i and i+ I together; and so on ...

* Originally appeared in Bulletin of Pure and Applied Sciences, Vol. 16 E(No. 2) 1997; P. 231-236.

102

- secuence and seriesUploaded byArmando Lios
- unit 2 3 acc scope and sequenceUploaded byapi-270891801
- 6) C1 Sequences and Series QuestionsUploaded byTim
- Recitation 5Uploaded bystlonginus1942
- Sequence & Series Theory_eUploaded bythinkiit
- Derivatives of Regular ExpressionsUploaded byDan Piponi
- Dll Format_demo TeachingUploaded byJames Gabriel DC Tiongson
- On a Smarandache Partial Perfect Additive Sequence, by H.IbstedtUploaded byscience2010
- Sequences and PatternsUploaded byLate791
- PI Programming Questions VIIUploaded byDushyant Goyal
- SequencesUploaded byTitser Laarni
- Scribd Drivel and ChemistryUploaded byThe_buzzcut
- C1 Sequences and Series QuestionsUploaded byquantock_
- Pattern Signs ScreenUploaded byshailesh_shiral6022
- L.No.14Uploaded bygogoagone
- 6_Adesh kumar TripathiUploaded byiiste
- olympiad bookUploaded byacanubhav
- SMO2010OpenWUploaded byWai-Yen Chan
- festo-grafcet.pdfUploaded byAnonymous UdyvGlT8m
- Indices C1 EdexcelUploaded byash256
- PCS1314 Algebra I Chapter 3 Test KEYUploaded byTim Ricchuiti
- Chap0Lec1Uploaded byjwalantdesa
- Theorist's Toolkit Lecture 8: High Dimensional Geometry and Geometric Random WalksUploaded byJeremyKun
- PRACHUploaded bySiddharth Jain
- tableofspecificationpreparation-170812124918Uploaded byEbb Lian Anino
- DescriptionUploaded byNovie Mae Huelar Jimena
- 10th Mathematics Matriculation LevelUploaded bybresks
- Curriculum Audit q1 g 10 Bugetted LessonUploaded byJoel Huelgas Villegas
- Infinite SeriesUploaded bygrvmaurya999

- Neutrosophic Crisp Bi-Topological SpacesUploaded byMia Amalia
- Rough Neutrosophic Multisets Relation with Application in Marketing StrategyUploaded byMia Amalia
- Fuzzy Neutrosophic Alpha m-Closed Sets in Fuzzy NeutrosophicTopological SpacesUploaded byMia Amalia
- Multi-Objective Portfolio Selection Model with Diversification by Neutrosophic Optimization TechniqueUploaded byMia Amalia
- Single Valued Neutrosophic Numbers and Analytic Hierarchy Process for Project SelectionUploaded byMia Amalia
- On Geodesics of the Tangent and Normal Surfaces Defined by TN-Smarandache Curve According to Frenet FrameUploaded byMia Amalia
- Pest Analysis Based on Neutrosophic Cognitive Maps: A Case Study for Food IndustryUploaded byMia Amalia
- Neutrosophic Units of Neutrosophic Rings and FieldsUploaded byMia Amalia
- Smarandache Curves According to q-Frame in Euclidean 3-SpaceUploaded byMia Amalia
- On Neutrosophic Crisp Semi Alpha Closed SetsUploaded byMia Amalia
- A Revisit to NC-VIKOR Based MAGDM Strategy in Neutrosophic Cubic Set EnvironmentUploaded byMia Amalia
- An Inventory Model under Space Constraint in Neutrosophic Environment: A Neutrosophic Geometric Programming ApproachUploaded byMia Amalia
- Neutrosophic Triplet Normed Ring SpaceUploaded byMia Amalia
- Bi-level Linear Programming Problem with Neutrosophic NumbersUploaded byMia Amalia
- On Smarandache Curves of Involute-evolute Curve According to Frenet Frame in Minkowski 3-spaceUploaded byMia Amalia
- Different Forms of Triangular Neutrosophic Numbers, De-Neutrosophication Techniques, and their ApplicationsUploaded byMia Amalia
- Fixed Point Theorem for Neutrosophic Triplet Partial Metric SpaceUploaded byMia Amalia
- Dual Generalized Nonnegative Normal Neutrosophic Bonferroni Mean Operators and Their Application in Multiple Attribute Decision MakingUploaded byMia Amalia
- Design of Fuzzy Cognitive Model of Mutual Influence and Connectivity of Innovative TechnologiesUploaded byMia Amalia
- Smarandache Curves of Bertrand Curves Pair According to Frenet FrameUploaded byMia Amalia
- A Forecasting Model Based on Multi-Valued Neutrosophic Sets and Two-Factor, Third-Order Fuzzy Fluctuation Logical RelationshipsUploaded byMia Amalia
- A Generalization of Surfaces Family with Common Smarandache Asymptotic Curves in Galilean SpaceUploaded byMia Amalia
- SINGLE-VALUED NEUTROSOPHIC HYPERGRAPHSUploaded byMia Amalia
- Some Generalized Dice Measures for Double-Valued Neutrosophic Sets and Their ApplicationsUploaded byMia Amalia
- An OWA Distance-Based, Single-Valued Neutrosophic Linguistic TOPSIS Approach for Green Supplier Evaluation and Selection in Low-Carbon Supply ChainsUploaded byMia Amalia
- A Neutrosophic Set Based Fault Diagnosis Method Based on Multi-Stage Fault Template DataUploaded byMia Amalia
- Fundamental Homomorphism Theorems for Neutrosophic Extended Triplet GroupsUploaded byMia Amalia
- Research on Construction Engineering Project Risk Assessment with Some 2-Tuple Linguistic Neutrosophic Hamy Mean OperatorsUploaded byMia Amalia
- Some Generalized Dice Measures for Double-Valued Neutrosophic Sets and Their ApplicationsUploaded byMia Amalia
- Different Methodologies in Treating UncertaintyUploaded byMia Amalia