THE MONOTONY OF SMARANDACHE FUNCTIONS OF FIRST KIND

Similar documents
SMARANDACHE NOTIONS JOURNAL

On certain generalizations of the Smarandache. function

NUMERICAL FUNCTIONS AND TRIPLETS

HISTORY OF THE SMA RAN D A C H E. Department of Mathematics, University of Craiova Str. AI. 1. Cuza 13, Craiova lloo, Romania

1 Vectors and Tensors

arxiv: v1 [math.ac] 11 Dec 2013

Matrix Differentiation

Bulletin of the. Iranian Mathematical Society

EN221 - Fall HW # 1 Solutions

Chapter 18 Section 8.5 Fault Trees Analysis (FTA) Don t get caught out on a limb of your fault tree.

FLORENTIN SMARANDACHE A Function in the Number Theory

Years. Marketing without a plan is like navigating a maze; the solution is unclear.

Intro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin

4.3 Z BUS formation considering mutual coupling between elements

Add-on unidirectional elastic metamaterial plate cloak

Chapter V DIVISOR GRAPHS

ON THE DIVISOR PRODUCTS AND PROPER DIVISOR PRODUCTS SEQUENCES*

arxiv: v1 [math.dg] 1 Jul 2014

Advanced Quantum Mechanics

A L A BA M A L A W R E V IE W

and ttuu ee 2 (logn loglogn) 1 J

UNIVERSITY OF NORTH CAROLINA Department of Statistics Chapel Hill, N. C.

1981] 209 Let A have property P 2 then [7(n) is the number of primes not exceeding r.] (1) Tr(n) + c l n 2/3 (log n) -2 < max k < ir(n) + c 2 n 2/3 (l

Math 203, Solution Set 4.

A.1 Appendix on Cartesian tensors

Primitive Matrices with Combinatorial Properties

A Note on the Distribution of Numbers with a Minimum Fixed Prime Factor with Exponent Greater than 1

A NOTE ON THE SMARANDACHE PRIME PRODUCT SEQTJENCE A.A.K.~AR. Department of Mathematics, Jahangimagar University, Savar, Dhaka 1342, Bangladesh

(1) The open and short circuit required for the Z and Y parameters cannot usually be

MATH 564/STAT 555 Applied Stochastic Processes Homework 2, September 18, 2015 Due September 30, 2015

Boxing Blends Sub step 2.2 Focus: Beginning, Final, and Digraph Blends

INEQUALITIES OF THE HILBERT TYPE IN R n WITH NON-CONJUGATE EXPONENTS

t-deformations of Grothendieck rings as quantum cluster algebras

LECTURE 16: LIE GROUPS AND THEIR LIE ALGEBRAS. 1. Lie groups

» 2016 MEDIA KIT KIT» 2016 MEDIA KIT. 125 Park St., Suite 155 Traverse City, MI mynorth.

GENERALIZATION OF PARTITION FUNCTION, INTRODUCING SMARANDACHE FACTOR PARTITION

OF THE PEAKON DYNAMICS

Diameter of the Zero Divisor Graph of Semiring of Matrices over Boolean Semiring

Homework 3 Solutions

FUNCTIONS OVER THE RESIDUE FIELD MODULO A PRIME. Introduction

Existence of Optimal Strategies in Markov Games with Incomplete Information

~,. :'lr. H ~ j. l' ", ...,~l. 0 '" ~ bl '!; 1'1. :<! f'~.., I,," r: t,... r':l G. t r,. 1'1 [<, ."" f'" 1n. t.1 ~- n I'>' 1:1 , I. <1 ~'..

Spheres with maximum inner diameter

BRUNO L. M. FERREIRA AND HENRIQUE GUZZO JR.

Bulletin of the Transilvania University of Braşov Vol 9(58), No Series III: Mathematics, Informatics, Physics, 67-82

Reasoning in knowledge bases with extrenal and internal uncertainties

Procedure for Measuring Swing Bearing Movement on 300 A Series Hydraulic Excavators {7063}

Today we will prove one result from probability that will be useful in several statistical tests. ... B1 B2 Br. Figure 23.1:

On asymptotic behavior of a finite Markov chain

ON PRIMALITY OF THE SMARANDACHE SYMMETRIC SEQUENCES. Sabin TABIRCA, Tatiana TABIRCA

TOEPLITZ KNEADING SEQUENCES AND ADDING MACHINES

Hecke Operators, Zeta Functions and the Satake map

Future Self-Guides. E,.?, :0-..-.,0 Q., 5...q ',D5', 4,] 1-}., d-'.4.., _. ZoltAn Dbrnyei Introduction. u u rt 5,4) ,-,4, a. a aci,, u 4.

MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS

For Sale: 4.6 Acres of Land on the Brewster / Orleans Town Line $750,000 Approved 8-Lot Subdivision

Multi-join Query Evaluation on Big Data Lecture 2

ALGEBRAIC PROPERTIES OF THE LATTICE R nx

Review for Geometry Midterm 2015: Chapters 1-5

Representing Independence Models with Elementary Triplets

Explicit evaluation of the transmission factor T 1. Part I: For small dead-time ratios. by Jorg W. MUller

On some special vector fields

Cartesian Tensors. e 2. e 1. General vector (formal definition to follow) denoted by components

Model reduction of coupled systems

Sieving 2m-prime pairs

Problem Set 2. Assigned: Mon. November. 23, 2015

Implicit Solutions of PDE s

Properties of Regular Languages. BBM Automata Theory and Formal Languages 1

A PROBLEM IN ADDITIVE NUMBER THEORY*

k 6, then which of the following statements can you assume to be

PROPERTIES OF THE l'4'ljmerical FliNCTION Fs

Playing Ball with the Largest Prime Factor

On Representability of a Finite Local Ring

TCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis

Hyperbolic Geometric Flow

Determinants of Partition Matrices

OH BOY! Story. N a r r a t iv e a n d o bj e c t s th ea t e r Fo r a l l a g e s, fr o m th e a ge of 9

t"''o,s.t; Asa%oftotal no. of oustanding Totalpaid-up capital of the csashwfft ilall Sompany Secretrry & Compliance Oflhor ACS.

ON THE MATRIX EQUATION XA AX = X P

Matrices over Hyperbolic Split Quaternions

Multivariate Statistical Analysis

f;g,7k ;! / C+!< 8R+^1 ;0$ Z\ \ K S;4 i!;g + 5 ;* \ C! 1+M, /A+1+> 0 /A+>! 8 J 4! 9,7 )F C!.4 ;* )F /0 u+\ 30< #4 8 J C!

Construction of latin squares of prime order

I ,.,., -_ IiiiiiiiiiiiiiI ~ ... IX Gloria Patri ,...,._ "'p. f.. ~: -;..-:-:;!": ~

FLORENTIN SMARANDACHE Numeralogy (I) or Properties of Numbers

o Alphabet Recitation

the king's singers And So It Goes the colour of song Words and Vusic by By Joel LEONARD Arranged by Bob Chilcott

On Berwald Spaces which Satisfy the Relation Γ k ij = p k g ij for Some Functions p k on TM

Horizontal Alignment Review Report

arxiv: v3 [math.cv] 5 Sep 2018

Commutators in the Steenrod algebra

G METHOD IN ACTION: FROM EXACT SAMPLING TO APPROXIMATE ONE

Disjoint paths in tournaments

SOME REMARKS ON NUMBER THEORY BY P. ERDŐS 1. Let ABSTRACT This note contains some disconnected minor remarks on number theory. (1) Iz j I=1, 1<j<co be

The number of sumsets in a finite field

Constructing Tight Gabor Frames using CAZAC Sequences

SHT 1 OF 3 SHT 2 AND 3 ARE -A- SIZE

INTEGER ALGORITHMS TO SOLVE LINEAR EQUATIONS AND SYSTEMS

Lecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321

Mathematical Logic and Linguistics

Multi-colouring the Mycielskian of Graphs

Transcription:

THE MONOTONY OF SMARANDACHE FUNCTONS OF FRST KND by on Bllcenoiu Department of Mathematics, University of Craiova Craiova (J 100). Romania Smarandache functions offirst kind are defined in [J thus: S,,:~ ~~, ~(k) = 1 and S,,(k) = max {Sp. (ij.k)}, l:5jsr J where n = p~t. Jlz.2,, 1: and SPi are functions defined in [4]. They L 1 - standardise (~, +) in (~, 50, +) in the ~ense that L : max {S,,(a),S,,(b)} 50 S,,(a +b) 50 S,,(a) + S,,(b) foreverya,bejr add k2-standardise (~,+) in (~,5o,.) by L2: max (S,,(a),S,,(b)} s. S,,(a+b) 50 S,,(a) S,,(b), for every a,b ENe n [2] it is prooved that the functions S" are increasing and the sequence {S,J }ien- also increasing. t is also proved that if p. q are prime numbers., then is wherei e~. t would be used in this paper the formula 1. Proposition. Let p be a prime number and kl,k" e ~. f e,. < k" then itt S. i t2 where itt,it,. are defined by (1). Proof t is known that S,:~ ~ ~ and S,(k) = pk for k s. p. f S,(k) = mpa with m, a e ~,(m, p) = 1. there exist a consecutive numbers: n,n +,...,n+ a- so that k e{n.n+... n+ a-} and S,(n) = S,(n+ 1) =... = S(n+ a-), 39

this means that S p is stationed the a- steps (k ~ k + 1). f k, < s and Sp(k,) = Sp('s). because Sp(k,) = p(k, -ik,). Sp('s) = p(1s -i's) it results it. < it:. f e, < e,. and S p (e, ) < Sp ('s). it is easy to see that we can write: it, = /3, + r ( a-) '" mp'" <Sp(k,)' then /3 1 E{O,1.2... a-l} and where mp'" <Sp(ls) A E{O.1.2... a-l}. where Now is obviously that e, <e,. and Sp(le,) <Sp(le,.) ~ it,s-it:. We note that, for e, < e,. it. = it: iff Sp(k l ) < Sp(le,.) and {mp"'la> 1 and mp'" S- Sp(e,)} = {mp"'la> 1 and mp'" <Sp(le,.)} 2. Proposition.Jfp is a prime number and p ~ S. then Sp > S~l and Sp > Sp+l' Proof Because p - 1 < p it results that Sri < S p' Of course p + 1 is even and so: (i) if p + 1 = Z. then i > 2 and because 2i < Z -1 = P we have Sp+l < Sp- (11) if p+ 1 ~ i. let p+ 1 = p~1. p;2.. P';. then Sp+(k) = max{s 'j (k)} = S i. (k) = SJs" P j p. = Sp. (i", k). Sp+l < Sp- Because p", i", S : S- p+ 1 < P it results that S i 2 P: (k) < Sp(k) for k eff, so that 3. Proposition. Let p.q be prime numbers and the sequences of functions f p < q and i S j, then S; < SqJ. Proof Evidently, if p < q and i S j, then for every k e Jt so. S (k) S S pi (k) < Sqj (k) S < SqJ 4. Definition. Let p.q be prime numbers. We consider a function Sr' a sequence of junctions {S; }iene, and we note: i(j) = ~{is; <Sr} 40

then {k E Nli U ) < k < P )} = ~r J = ~(. ) defines the interference zone of the junction S J (q ) J q with the sequence {S }. P len" 5. Renuuqlle. a) f S qj < S, for i EN", then no\\ exists tlj and pj= 1. and we say that S qj is separately of the sequence of functions {S }. P len" b) f there exist k EN" so that S,t < SqJ < S,t+1, then ~,(qj> = 0 and say that the function S qj does not interfere with the sequence of functions { S lien". 6. Definition. The sequence {x,,} is generaly increasing if "en "n E V 3mo E V so that x". ~ x" for m ~ mo. 7. Renuuqlle. f the sequence {.r"},,en0 with x" ~ 0 is genera1y increasing and boundled, then every subsequence is genera1y increasing and boundled. 8. Proposition. The sequence {S" (k)} "en"' where k E V. is in generaiy increasing and boundjed Proof Because SlCk) = S,,1t (1), it results that {S,,(k)}"eN" is a subsequence of {Sill (1)} H!N"' The sequence {S(l)}H!N" is genera1y increasing and boundled because: From the remarque 7 it results that the sequence {S" (k)} is genera1y increasing "V boundled. 9. Proposition. The sequence offimctions {S"}"eN" is generaly increasing boundled Proof Obviously, the zone of interference of the function Sill with {Sll is the set "en,fill> = min{n EN"S <Sll. 41

The interference zone.1.11(",) is nonemty because S", E.1.11(",) and finite for S\ ::; S", ::; Sp. where P is one prime number greater than m. Because {S,,(1)} is generaly increasing it results: 'rim e~ 3/0 en- so that Sr(1) ~ S",{l) for "it ~ to. For ro = to + r-"') we have S,. ~ S", ~ S",(1) for "ir ~ro. so that {S"}"eN. is generaly increasing boundled. 10. Re1lllUt{1lt!. a) For n = p~1. ii... i: are posible the following cases: 1) 3 k E{1.2... r}so that S.J ::; S '. for j E {1.2... r}. 'j p. then S" = S ik and t is named the dominant factor for n. Pk 2) 3 k\.k.z,... k'" E {1.2... r} so that : "ite1.m 3qrE~ sothats,,{q,)=sit, (q,) and Pk r forn. We shall name {p~~r t E l.m} the active factors, the others wold be name passive factors b) We consider For n en PlPl appear the following situations: 1) il E{O.i:;Z)], this means that p~1 is a pasive factor and Pi is an active factor. 2) (' ;(;.,» this that il d ~. fact '1 E ' 1 (;2),11 - means P an Pi. are acnve ors. 3) i l E[lii2 ). co) this means that p;1 is a active factor and Jl,,2 is a pasive factor. 42

For P < P2 the repartion of exponents is representjy in following scheme: 2 : The zcme of e:ltpocds...... " n : for numbers of type )................................. The ZOC of ~ for numbers of type 3) c) consider that where Pt < P2 < PJ are prime numbers. Exist the following situations: ) n e NPj,j = 1.2.3 this means that pi is active factor. 2) n e NPjPt, j ~ k; j,k e {1.2.3}. this means that lj,p~ are active filctors. 3) n e NPlPlPJ, this means that pit,[i.l.~3 are active factors. NPl'ZPl is named the S active cone for N P 'Z Pl. Obviously NPl'ZPl = {n= p.t~2~lil,~,i3 elf and it E(i1c(lj),11 ij» where j~ k;j,k E{.2.3}}. The reparrision of exponents is represented in the following scheme:

For P < P2 the repartion of exponents is representjy in following scheme: 2 : The zcme of e:ltpocds...... " n : for numbers of type )................................. The ZOC of ~ for numbers of type 3) c) consider that where Pt < P2 < PJ are prime numbers. Exist the following situations: ) n e NPj,j = 1.2.3 this means that pi is active factor. 2) n e NPjPt, j ~ k; j,k e {1.2.3}. this means that lj,p~ are active filctors. 3) n e NPlPlPJ, this means that pit,[i.l.~3 are active factors. NPl'ZPl is named the S active cone for N P 'Z Pl. Obviously NPl'ZPl = {n= p.t~2~lil,~,i3 elf and it E(i1c(lj),11 ij» where j~ k;j,k E{.2.3}}. The reparrision of exponents is represented in the following scheme:

d) Generaly, consider N P Pl. p,. = {n = fll. pi... 1: i' ~,..., ir E Jr}, where P < P2 <... < Pr are prime numbers. On N P Pl.. _p,. exist the following relation of equivalence: This have the following clases: - NPj}, where jl E{1.2... r}. n E NPj} <=> n base only P~~ n pm<=> n and m have the same active factors. active factor - NPj}Pn., where jl ;:C j" and jl,j" E{1.2... r}. n E NPj}Pn. <=> n has only pij} pin. active factors 11' 12. NPlPl Prwich is named S-active cone. N PlPl _ P,. - {n EN n has pil pil.;,. "-;"e factors}. - PlPl. P,. ' ",,Yr ca."" Obvi o us! y, if n E N PlPl-Pr, th en ':. E (. :(ij),ll:.(ij») with k. d k. { 2 } ;:C j an,j E,... r. REFERENCES [1] 1. Bilacenoiu, Smarandache Numerical Functions, Smarandache Function Journal, Vol. 4-5, No.1, (1994), p.6-13. [2] 1. Bliacenoiu, V. Seleacu Some proprieties of Smarandache functions of the type Smarandache Function Journal, Vol. 6. (1995). [3] P. Gronas [4] F. Smarandache A proof of the non-existence of "Somma". Smarandache Function Journal, VoL 4-5. No.1. (1994), p.22-23. Afunction in the Number Theory. An.Univ.Timi~ara. seria slmat. Vol.xvrr. fase. 1, p.79-88. 1980.