Primality tests for specific classes ofn = k 2 m ±1

Size: px
Start display at page:

Download "Primality tests for specific classes ofn = k 2 m ±1"

Transcription

1 Primality tests for specific classes ofn k 2 m ±1 Predrag Terzić Bulevar Pera Ćetkovića 19, Podgorica, Moteegro pedja.terzic@hotmail.com arxiv: v1 [math.nt] 10 Ju 2015 Abstract: Polyomial time primality tests for specific classes of umbers of the form k 2 m ±1 are itroduced. Keywords: Primality test, Polyomial time, Prime umbers. AMS Classificatio: 11A51. 1 Itroductio I 1856 Edouard Lucas developed primality test for Mersee umbers. The test was improved by Lucas i 1878 ad Derrick Hery Lehmer i the 190s, see [1].I 1960 Kusta Ikeri provided ucoditioal, determiistic, lucasia type primality test for Fermat umbers, see [2].I 1969 Has Riesel formulated primality test, see [] for umbers of the formk 2 1 withk odd ad k < 2. I 2006 Zhi-Hog Su provided geeral primality criterio for umbers of the form k 2 m ± 1,see [4]. I this ote I preset lucasia type primality tests for specific classes of k 2 m ±1. Throughout this paper we use the followig otatios: Z-the set of itegers, N-the set of positive itegers, a p -the Jacobi symbol, m,-the greatest commo divisor of m ad, S x-the sequece defied by S 0 x x ad S k+1 x S k x 2 2k 0. 2 Basic Lemmas ad Theorems Defiitio 2.1. ForP,Q Z the Lucas sequece{v P,Q} is defied by V 0 P,Q 2,V 1 P,Q P,V +1 P,Q PV P,Q QV 1 P,Q 1 Let D P 2 4Q. It is kow that V P,Q Lemma 2.1. Let P,Q Z ad N. The V P,Q [/2] r0 P+ D 2 + r r r P D 2 P 2r Q r 1

2 Theorem 2.1. Zhi-Hog Su For m {2,,4,...} let p k 2 m ± 1 with 0 < k < 2 m ad k odd. If b,c Z, 2c+b 2c b c p,c 1 ad the p is prime if ad oly if p S p p p m 2 x, where k 1/2 x c k V k b,c 2 k k r 1 r b/c k 2r k r r r0 For proof see Theorem.1 i [4]. Lemma 2.2. Let be odd positive umber, the 1 1, if 1 mod 4 1, if mod 4 Lemma 2.. Let be odd positive umber, the 2 1, if 1,7 mod 8 1, if,5 mod 8 Lemma 2.4. Let be odd positive umber, the case 1. 1 mod 4 case 2. mod 4 1 if 1 mod 0 if 0 mod 1 if 2 mod 1 if 2 mod 0 if 0 mod 1 if 1 mod Proof. Sice mod 4 if we apply the law of quadratic reciprocity we have two cases. If 1 mod 4 the ad the result follows. If mod 4 the ad the result follows. Lemma 2.5. Let be odd positive umber, the 5 1 if 1,4 mod 5 0 if 0 mod 5 1 if 2, mod 5 Proof. Sice 5 1 mod 4 if we apply the law of quadratic reciprocity we have 5 5 ad the result follows. Lemma 2.6. Let be odd positive umber, the case 1. 1 mod 4 2

3 1 if 1,11 mod 12 0 if,9 mod 12 1 if 5,7 mod 12 case 2. mod 4 Proof. 1 if 5,7 mod 12 0 if,9 mod 12 1 if 1,11 mod Applyig the law of quadratic reciprocity we have : if 1 mod 4 the. If mod 4 the. Applyig the Chiese remaider theorem i both cases several times we get the result. Lemma 2.7. Let be odd positive umber, the case 1. 1 mod 4 case 2. mod if 1,2,4 mod 7 0 if 0 mod 7 1 if,5,6 mod 7 1 if,5,6 mod 7 0 if 0 mod 7 1 if 1,2,4 mod 7 Proof. Sice 7 mod 4 if we apply the law of quadratic reciprocity we have two cases. If 1 mod 4 the 7 7 ad the result follows. If mod 4 the 7 7 ad the result follows. Lemma 2.8. Let be odd positive umber, the case 1. 1 mod 4 case 2. mod if 1,5,19,2 mod 24 0 if,9,15,21 mod 24 1 if 7,11,1,17 mod if 7,11,1,17 mod 24 0 if,9,15,21 mod 24 1 if 1,5,19,2 mod 24

4 Proof Applyig the law of quadratic reciprocity we have : if 1 mod 4 the. If mod 4 the. Applyig the Chiese remaider theorem i both cases several times we get the result. Lemma 2.9. Let be odd positive umber, the 10 1 if 1,,9,1,27,1,7,9 mod 40 0 if 5,15,25,5 mod 40 1 if 7,11,17,19,21,2,29, mod 40 Proof Applyig the law of quadratic reciprocity we have : 5 5. Applyig the Chiese remaider theorem several times we get the result. The Mai Result Theorem.1. Let N k 2 m 1such thatm > 2, k, 0 < k < 2 m ad k 1 mod 10 with m 2, mod 4 k mod 10 with m 0, mod 4 k 7 mod 10 with m 1,2 mod 4 k 9 mod 10 with m 0,1 mod 4 Let b ad S 0 x V k b,1, thus N is prime iff N S m 2 x Proof. Sice N mod 4 ad b from Lemma 2.2 we kow that N 1. Similarly, sice N 2 mod 5 or N mod 5 ad b from Lemma 2.5 we kow that 2+b N 1. From Lemma 2.1 we kow that Vk b,1 x. Applyig Theorem 2.1 i the case c 1 we get the result. Theorem.2. Let N k 2 m 1such thatm > 2, k, 0 < k < 2 m ad k mod 42with m 0,2 mod k 9 mod 42with m 0 mod k 15 mod 42with m 1 mod k 27 mod 42with m 1,2 mod k mod 42with m 0,1 mod k 9 mod 42with m 2 mod Let b 5 ad S 0 x V k b,1, thus N is prime iff N S m 2 x 4

5 Proof. Sice N mod 4 ad N 11 mod 12 ad b 5 from Lemma 2.6 we kow that N 1. Similarly, sicen mod 4 ad N 1 mod 7 orn 2 mod 7 or N 4 mod 7 ad b 5 from Lemma 2.7 we kow that 2+b N 1. From Lemma 2.1 we kow thatv k b,1 x. Applyig Theorem 2.1 i the case c 1 we get the result. Theorem.. Let N k 2 m +1 such thatm > 2, 0 < k < 2 m ad k 1 mod 42with m 2,4 mod 6 k 5 mod 42with m mod 6 k 11 mod 42with m,5 mod 6 k 1 mod 42with m 4 mod 6 k 17 mod 42with m 5 mod 6 k 19 mod 42with m 0 mod 6 k 2 mod 42with m 1, mod 6 k 25 mod 42with m 0,2 mod 6 k 29 mod 42with m 1,5 mod 6 k 1 mod 42with m 2 mod 6 k 7 mod 42with m 0,4 mod 6 k 41 mod 42with m 1 mod 6 Let b 5 ad S 0 x V k b,1, thus N is prime iff N S m 2 x Proof. Sice N 1 mod 4 ad N 5 mod 12 ad b 5 from Lemma 2.6 we kow that N 1. Similarly, sicen 1 mod 4 ad N mod 7 orn 5 mod 7 or N 6 mod 7 ad b 5 from Lemma 2.7 we kow that 2+b N 1. From Lemma 2.1 we kow thatv k b,1 x. Applyig Theorem 2.1 i the case c 1 we get the result. Theorem.4. Let N k 2 m +1 such thatm > 2, 0 < k < 2 m ad k 1 mod 6 ad k 1,7 mod 10 withm 0 mod 4 k 5 mod 6 ad k 1, mod 10 withm 1 mod 4 k 1 mod 6 ad k,9 mod 10 withm 2 mod 4 k 5 mod 6 ad k 7,9 mod 10 withm mod 4 Let b 8 ad S 0 x V k b,1, thus N is prime iff N S m 2 x Proof. Sice N 1 mod 4 ad N 17 mod 24 ad b 8 from Lemma 2.8 we kow that N 1. Similarly, sice N 17 mod 40 or N mod 40 ad b 8 from Lemma 2.9 we kow that 2+b N 1. From Lemma 2.1 we kow that Vk b,1 x. Applyig Theorem 2.1 i the casec 1 we get the result. 5

6 Refereces [1] Cradall, Richard; Pomerace, Carl 2001, Sectio 4.2.1: The Lucas-Lehmer test, Prime Numbers: A Computatioal Perspective 1st ed., Berli: Spriger, p [2] Ikeri, K., Tests for primality, A. Acad. Sci. Fe., A I 279, [] Riesel, Has 1969, Lucasia Criteria for the Primality ofn h 2 1, Mathematics of Computatio AmericaMathematical Society, 2 108: [4] Zhi-Hog Su, Primality tests for umbers of the formk 2 m ±1, The Fiboacci Quarterly, , o.2,

A Simple Derivation for the Frobenius Pseudoprime Test

A Simple Derivation for the Frobenius Pseudoprime Test A Simple Derivatio for the Frobeius Pseudoprime Test Daiel Loebeberger Bo-Aache Iteratioal Ceter for Iformatio Techology March 17, 2008 Abstract Probabilistic compositeess tests are of great practical

More information

PRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION. Predrag Terzic Podgorica, Montenegro

PRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION. Predrag Terzic Podgorica, Montenegro PRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION Predrag Terzic Podgorica, Montenegro pedja.terzic@hotmail.com Abstract. We present deterministic primality test for Fermat numbers, F

More information

Super congruences concerning Bernoulli polynomials. Zhi-Hong Sun

Super congruences concerning Bernoulli polynomials. Zhi-Hong Sun It J Numer Theory 05, o8, 9-404 Super cogrueces cocerig Beroulli polyomials Zhi-Hog Su School of Mathematical Scieces Huaiyi Normal Uiversity Huaia, Jiagsu 00, PR Chia zhihogsu@yahoocom http://wwwhytceduc/xsjl/szh

More information

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary

More information

Perfect Numbers 6 = Another example of a perfect number is 28; and we have 28 =

Perfect Numbers 6 = Another example of a perfect number is 28; and we have 28 = What is a erfect umber? Perfect Numbers A erfect umber is a umber which equals the sum of its ositive roer divisors. A examle of a erfect umber is 6. The ositive divisors of 6 are 1,, 3, ad 6. The roer

More information

SOME TRIBONACCI IDENTITIES

SOME TRIBONACCI IDENTITIES Mathematics Today Vol.7(Dec-011) 1-9 ISSN 0976-38 Abstract: SOME TRIBONACCI IDENTITIES Shah Devbhadra V. Sir P.T.Sarvajaik College of Sciece, Athwalies, Surat 395001. e-mail : drdvshah@yahoo.com The sequece

More information

Primality Test. Rong-Jaye Chen

Primality Test. Rong-Jaye Chen Primality Test Rog-Jaye Che OUTLINE [1] Modular Arithmetic Algorithms [2] Quadratic Residues [3] Primality Testig p2. [1] Modular Arithmetic Algorithms 1. The itegers a divides b a b a{ 1, b} If b has

More information

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play. Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers

More information

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163

More information

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun The Fibonacci Quarterly 44006, no., 11-130. PRIMALITY TESTS FOR NUMBERS OF THE FORM k m ± 1 Zhi-Hong Sun eartment of Mathematics, Huaiyin Teachers College, Huaian, Jiangsu 3001, P.R. China E-mail: zhsun@hytc.edu.cn

More information

Some identities involving Fibonacci, Lucas polynomials and their applications

Some identities involving Fibonacci, Lucas polynomials and their applications Bull. Math. Soc. Sci. Math. Roumaie Tome 55103 No. 1, 2012, 95 103 Some idetities ivolvig Fiboacci, Lucas polyomials ad their applicatios by Wag Tigtig ad Zhag Wepeg Abstract The mai purpose of this paper

More information

PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z

PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z PERIODS OF FIBONACCI SEQUENCES MODULO m ARUDRA BURRA Abstract. We show that the Fiboacci sequece modulo m eriodic for all m, ad study the eriod i terms of the modulus.. Prelimiaries Defiitio. A geeralized

More information

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun

COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q n } Sang Pyo Jun Korea J. Math. 23 2015) No. 3 pp. 371 377 http://dx.doi.org/10.11568/kjm.2015.23.3.371 COMPLEX FACTORIZATIONS OF THE GENERALIZED FIBONACCI SEQUENCES {q } Sag Pyo Ju Abstract. I this ote we cosider a geeralized

More information

Some p-adic congruences for p q -Catalan numbers

Some p-adic congruences for p q -Catalan numbers Some p-adic cogrueces for p q -Catala umbers Floria Luca Istituto de Matemáticas Uiversidad Nacioal Autóoma de México C.P. 58089, Morelia, Michoacá, México fluca@matmor.uam.mx Paul Thomas Youg Departmet

More information

The 4-Nicol Numbers Having Five Different Prime Divisors

The 4-Nicol Numbers Having Five Different Prime Divisors 1 2 3 47 6 23 11 Joural of Iteger Sequeces, Vol. 14 (2011), Article 11.7.2 The 4-Nicol Numbers Havig Five Differet Prime Divisors Qiao-Xiao Ji ad Mi Tag 1 Departmet of Mathematics Ahui Normal Uiversity

More information

Solutions to Math 347 Practice Problems for the final

Solutions to Math 347 Practice Problems for the final Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is

More information

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms. [ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural

More information

Some Results on Fermat's Theorem and Trial Division Method

Some Results on Fermat's Theorem and Trial Division Method Some Results o Fermat's Theorem ad Trial Divisio Method Sajda Kareem Radi, Nagham Ali Hameed Some Results o Fermat's Theorem ad Trial Divisio Method Sajda Kareem Radi, Nagham Ali Hameed Mechaical Eg. Det.,

More information

The log-behavior of n p(n) and n p(n)/n

The log-behavior of n p(n) and n p(n)/n Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity

More information

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S. Basic Sets Example 1. Let S = {1, {2, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 2. Compute the

More information

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS

ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS Joural of Algebra, Number Theory: Advaces ad Applicatios Volume, Number, 00, Pages 7-89 ON SOME DIOPHANTINE EQUATIONS RELATED TO SQUARE TRIANGULAR AND BALANCING NUMBERS OLCAY KARAATLI ad REFİK KESKİN Departmet

More information

(2) F j+2 = F J+1 + F., F ^ = 0, F Q = 1 (j = -1, 0, 1, 2, ). Editorial notes This is not our standard Fibonacci sequence.

(2) F j+2 = F J+1 + F., F ^ = 0, F Q = 1 (j = -1, 0, 1, 2, ). Editorial notes This is not our standard Fibonacci sequence. ON THE LENGTH OF THE EUCLIDEAN ALGORITHM E. P. IV1ERKES ad DAVSD MEYERS Uiversity of Ciciati, Ciciati, Ohio Throughout this article let a ad b be itegers, a > b >. The Euclidea algorithm geerates fiite

More information

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a. Departmet of Mathematical Scieces Istructor: Daiva Puciskaite Discrete Mathematics Fermat s Little Theorem 43.. For all a Z 3, calculate a 2 ad a 3. Case a = 0. 0 0 2-times Case a 0. 0 0 3-times a a 2-times

More information

Proc. Amer. Math. Soc. 139(2011), no. 5, BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS

Proc. Amer. Math. Soc. 139(2011), no. 5, BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS Proc. Amer. Math. Soc. 139(2011, o. 5, 1569 1577. BINOMIAL COEFFICIENTS AND THE RING OF p-adic INTEGERS Zhi-Wei Su* ad Wei Zhag Departmet of Mathematics, Naig Uiversity Naig 210093, People s Republic of

More information

On Some Properties of Digital Roots

On Some Properties of Digital Roots Advaces i Pure Mathematics, 04, 4, 95-30 Published Olie Jue 04 i SciRes. http://www.scirp.org/joural/apm http://dx.doi.org/0.436/apm.04.46039 O Some Properties of Digital Roots Ilha M. Izmirli Departmet

More information

A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION

A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II 1. INTRODUCTION A LIMITED ARITHMETIC ON SIMPLE CONTINUED FRACTIONS - II C. T. LONG J. H. JORDAN* Washigto State Uiversity, Pullma, Washigto 1. INTRODUCTION I the first paper [2 ] i this series, we developed certai properties

More information

Exam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False.

Exam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False. 1 (1 poits) Circle T if the correspodig statemet is True or F if it is False T F For ay positive iteger,, GCD(, 1) = 1 T F Every positive iteger is either prime or composite T F If a b mod p, the (a/p)

More information

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE

YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Crytograhy ad Comuter Security Notes 16 (rev. 1 Professor M. J. Fischer November 3, 2008 68 Legedre Symbol Lecture Notes 16 ( Let be a odd rime,

More information

The Structure of Z p when p is Prime

The Structure of Z p when p is Prime LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z

More information

EISENSTEIN S CRITERION, FERMAT S LAST THEOREM, AND A CONJECTURE ON POWERFUL NUMBERS arxiv: v6 [math.ho] 13 Feb 2018

EISENSTEIN S CRITERION, FERMAT S LAST THEOREM, AND A CONJECTURE ON POWERFUL NUMBERS arxiv: v6 [math.ho] 13 Feb 2018 EISENSTEIN S CRITERION, FERMAT S LAST THEOREM, AND A CONJECTURE ON POWERFUL NUMBERS arxiv:174.2885v6 [math.ho] 13 Feb 218 PIETRO PAPARELLA Abstract. Give itegers l > m >, moic polyomials X, Y, ad Z are

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 304: MIDTERM EXAM SOLUTIONS MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest

More information

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction

k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c 1. Introduction Acta Math. Uiv. Comeiaae Vol. LXXXVI, 2 (2017), pp. 279 286 279 k-generalized FIBONACCI NUMBERS CLOSE TO THE FORM 2 a + 3 b + 5 c N. IRMAK ad M. ALP Abstract. The k-geeralized Fiboacci sequece { F (k)

More information

Math 609/597: Cryptography 1

Math 609/597: Cryptography 1 Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, 2000 1 Itroductio We describe the Solovay-Strasse primality test. There is quite a bit

More information

AN APPLICATION OF HYPERHARMONIC NUMBERS IN MATRICES

AN APPLICATION OF HYPERHARMONIC NUMBERS IN MATRICES Hacettepe Joural of Mathematic ad Statitic Volume 4 4 03, 387 393 AN APPLICATION OF HYPERHARMONIC NUMBERS IN MATRICES Mutafa Bahşi ad Süleyma Solak Received 9 : 06 : 0 : Accepted 8 : 0 : 03 Abtract I thi

More information

Some sufficient conditions of a given. series with rational terms converging to an irrational number or a transcdental number

Some sufficient conditions of a given. series with rational terms converging to an irrational number or a transcdental number Some sufficiet coditios of a give arxiv:0807.376v2 [math.nt] 8 Jul 2008 series with ratioal terms covergig to a irratioal umber or a trascdetal umber Yu Gao,Jiig Gao Shaghai Putuo college, Shaghai Jiaotog

More information

SOLVED EXAMPLES

SOLVED EXAMPLES Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as

More information

The log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences

The log-concavity and log-convexity properties associated to hyperpell and hyperpell-lucas sequences Aales Mathematicae et Iformaticae 43 2014 pp. 3 12 http://ami.etf.hu The log-cocavity ad log-covexity properties associated to hyperpell ad hyperpell-lucas sequeces Moussa Ahmia ab, Hacèe Belbachir b,

More information

Continued Fractions and Pell s Equation

Continued Fractions and Pell s Equation Max Lah Joatha Spiegel May, 06 Abstract Cotiued fractios provide a useful, ad arguably more atural, way to uderstad ad represet real umbers as a alterative to decimal expasios I this paper, we eumerate

More information

PROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7).

PROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7). PROBLEM SET 5 SOLUTIONS 1 Fid every iteger solutio to x 17x 5 0 mod 45 Solutio We rove that the give cogruece equatio has o solutios Suose for cotradictio that the equatio x 17x 5 0 mod 45 has a solutio

More information

Pell and Lucas primes

Pell and Lucas primes Notes o Number Theory ad Discrete Mathematics ISSN 30 532 Vol. 2, 205, No. 3, 64 69 Pell ad Lucas primes J. V. Leyedekkers ad A. G. Shao 2 Faculty of Sciece, The Uiversity of Sydey NSW 2006, Australia

More information

On Generalized Fibonacci Numbers

On Generalized Fibonacci Numbers Applied Mathematical Scieces, Vol. 9, 215, o. 73, 3611-3622 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ams.215.5299 O Geeralized Fiboacci Numbers Jerico B. Bacai ad Julius Fergy T. Rabago Departmet

More information

Lower Bounds on Odd Order Character Sums

Lower Bounds on Odd Order Character Sums Iteratioal Mathematics Research Notices Advace Access published November 28, 20 L. Goldmakher ad Y. Lamzouri 20) Lower Bouds o Odd Order Character Sums, Iteratioal Mathematics Research Notices, rr29, 8

More information

On Divisibility concerning Binomial Coefficients

On Divisibility concerning Binomial Coefficients A talk give at the Natioal Chiao Tug Uiversity (Hsichu, Taiwa; August 5, 2010 O Divisibility cocerig Biomial Coefficiets Zhi-Wei Su Najig Uiversity Najig 210093, P. R. Chia zwsu@ju.edu.c http://math.ju.edu.c/

More information

Section 11.8: Power Series

Section 11.8: Power Series Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i

More information

SHARPENING PRIMES IS IN P FOR A LARGE FAMILY OF NUMBERS

SHARPENING PRIMES IS IN P FOR A LARGE FAMILY OF NUMBERS MATHEMATICS OF COMPUTATION Volume 74, Number 252, Pages 2043 2059 S 0025-5718(05)01727-8 Article electroically published o April 11, 2005 SHARPENING PRIMES IS IN P FOR A LARGE FAMILY OF NUMBERS PEDRO BERRIZBEITIA

More information

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples

An analog of the arithmetic triangle obtained by replacing the products by the least common multiples arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;

More information

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >

More information

Trial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014

Trial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014 Iteger Divisio Algorithm ad Cogruece Iteger Trial divisio,,, ad with itegers mod Iverses mod Multiplicatio ad GCD Iteger Christopher Koch 1 1 Departmet of Computer Sciece ad Egieerig CSE489/589 Algorithms

More information

On a Conjecture of Dris Regarding Odd Perfect Numbers

On a Conjecture of Dris Regarding Odd Perfect Numbers O a Cojecture of Dris Regardig Odd Perfect Numbers Jose Araldo B. Dris Departmet of Mathematics, Far Easter Uiversity Maila, Philippies e-mail: jadris@feu.edu.ph,josearaldobdris@gmail.com arxiv:1312.6001v9

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

International Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY

International Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY Iteratioal Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL TOPIC NUMBER THEORY METHODS OF PROOF. Couterexample - Cotradictio - Pigeohole Priciple Strog mathematical iductio 2 DIVISIBILITY....

More information

Applied Mathematics Letters. On the properties of Lucas numbers with binomial coefficients

Applied Mathematics Letters. On the properties of Lucas numbers with binomial coefficients Applied Mathematics Letters 3 (1 68 7 Cotets lists available at ScieceDirect Applied Mathematics Letters joural homepage: wwwelseviercom/locate/aml O the properties of Lucas umbers with biomial coefficiets

More information

On the Jacobsthal-Lucas Numbers by Matrix Method 1

On the Jacobsthal-Lucas Numbers by Matrix Method 1 It J Cotemp Math Scieces, Vol 3, 2008, o 33, 1629-1633 O the Jacobsthal-Lucas Numbers by Matrix Method 1 Fikri Köke ad Durmuş Bozkurt Selçuk Uiversity, Faculty of Art ad Sciece Departmet of Mathematics,

More information

Lucas Lehmer primality test - Wikipedia, the free encyclopedia

Lucas Lehmer primality test - Wikipedia, the free encyclopedia Lucas Lehmer primality test From Wikipedia, the free encyclopedia In mathematics, the Lucas Lehmer test (LLT) is a primality test for Mersenne numbers. The test was originally developed by Edouard Lucas

More information

Independence of the Miller-Rabin and Lucas Probable Prime Tests

Independence of the Miller-Rabin and Lucas Probable Prime Tests Idepedece of the Miller-Rabi ad Lucas Probable Prime Tests Alec Leg Metor: avid Corwi March 30, 017 1 Abstract I the moder age, public-key cryptography has become a vital compoet for secure olie commuicatio.

More information

Randić index, diameter and the average distance

Randić index, diameter and the average distance Radić idex, diameter ad the average distace arxiv:0906.530v1 [math.co] 9 Ju 009 Xueliag Li, Yogtag Shi Ceter for Combiatorics ad LPMC-TJKLC Nakai Uiversity, Tiaji 300071, Chia lxl@akai.edu.c; shi@cfc.akai.edu.c

More information

GAMALIEL CERDA-MORALES 1. Blanco Viel 596, Valparaíso, Chile. s: /

GAMALIEL CERDA-MORALES 1. Blanco Viel 596, Valparaíso, Chile.  s: / THE GELIN-CESÀRO IDENTITY IN SOME THIRD-ORDER JACOBSTHAL SEQUENCES arxiv:1810.08863v1 [math.co] 20 Oct 2018 GAMALIEL CERDA-MORALES 1 1 Istituto de Matemáticas Potificia Uiversidad Católica de Valparaíso

More information

COMMON FIXED POINT THEOREMS VIA w-distance

COMMON FIXED POINT THEOREMS VIA w-distance Bulleti of Mathematical Aalysis ad Applicatios ISSN: 1821-1291, URL: http://www.bmathaa.org Volume 3 Issue 3, Pages 182-189 COMMON FIXED POINT THEOREMS VIA w-distance (COMMUNICATED BY DENNY H. LEUNG) SUSHANTA

More information

Matrix representations of Fibonacci-like sequences

Matrix representations of Fibonacci-like sequences NTMSCI 6, No. 4, 03-0 08 03 New Treds i Mathematical Scieces http://dx.doi.org/0.085/tmsci.09.33 Matrix represetatios of Fiboacci-like sequeces Yasemi Tasyurdu Departmet of Mathematics, Faculty of Sciece

More information

On Prime Generation Through Primitive Divisors Of Recurrence Sequences

On Prime Generation Through Primitive Divisors Of Recurrence Sequences Uiversity of Cetral Florida Electroic Theses ad Dissertatios Masters Thesis (Ope Access) O Prime Geeratio Through Primitive Divisors Of Recurrece Sequeces 006 Richard Russell Uiversity of Cetral Florida

More information

A SOLUTION TO A TANTALIZING PROBLEM. GERT ALMKVIST Institute for Algebraic Meditation, PL 500, S HOOR, Sweden (Submitted November 1984)

A SOLUTION TO A TANTALIZING PROBLEM. GERT ALMKVIST Institute for Algebraic Meditation, PL 500, S HOOR, Sweden (Submitted November 1984) GERT ALMKVIST Istitute for Algebraic Meditatio, PL 500, S-43 00 HOOR, Swede (Submitted November 984) INTRODUCTION I a recet paper, R. Backstrom [] computed various sums of reciprocal Fiboacci ad Lucas

More information

THE DOUBLE ANGLE FORMULA

THE DOUBLE ANGLE FORMULA 05 HAWAII UNIVERSITY INTERNATIONAL CONERENCES S.T.E.A.. & EDUCATION JUNE 3-5, 05 ALA OANA HOTEL, HONOLULU, HAWAII S.T.E.A. & EDUCATION PUBLICATION: ISSN 333-496 (CD-RO ISSN 333-4908 (ONLINE THE DOUBLE

More information

Some Hankel determinants with nice evaluations. Johann Cigler Talk at the occasion of Peter Paule s 60 th birthday

Some Hankel determinants with nice evaluations. Johann Cigler Talk at the occasion of Peter Paule s 60 th birthday Some Hakel determiats with ice evaluatios Joha Cigler Talk at the occasio of Peter Paule s 6 th birthday Itroductio For each we cosider the Hakel determiat H ( a ) + = det. i j i, j= We are iterested i

More information

SOME RESULTS ON FIBONACCI QUATERNIONS MUTHULAKSHMI R. IYER Indian Statistical Institute, Calcutta, India

SOME RESULTS ON FIBONACCI QUATERNIONS MUTHULAKSHMI R. IYER Indian Statistical Institute, Calcutta, India SOME RESULTS ON FIBONACCI QUATERNIONS MUTHULAKSHMI R. IYER Idia Statistical Istitute, Calcutta, Idia 1. INTRODUCTION Recetly the author derived some results about geeralized Fiboacci Numbers [3J. I the

More information

Math 104: Homework 2 solutions

Math 104: Homework 2 solutions Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does

More information

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES

ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES Publ. Math. Debrece 8504, o. 3-4, 85 95. ON MONOTONICITY OF SOME COMBINATORIAL SEQUENCES QING-HU HOU*, ZHI-WEI SUN** AND HAOMIN WEN Abstract. We cofirm Su s cojecture that F / F 4 is strictly decreasig

More information

Linear recurrence sequences and periodicity of multidimensional continued fractions

Linear recurrence sequences and periodicity of multidimensional continued fractions arxiv:1712.08810v1 [math.nt] 23 Dec 2017 Liear recurrece sequeces ad periodicity of multidimesioal cotiued fractios Nadir Murru Departmet of Mathematics Uiversity of Turi 10123 Turi, Italy E-mail: adir.murru@uito.it

More information

Fibonacci numbers and orthogonal polynomials

Fibonacci numbers and orthogonal polynomials Fiboacci umbers ad orthogoal polyomials Christia Berg April 10, 2006 Abstract We prove that the sequece (1/F +2 0 of reciprocals of the Fiboacci umbers is a momet sequece of a certai discrete probability,

More information

#A51 INTEGERS 14 (2014) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES

#A51 INTEGERS 14 (2014) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES #A5 INTEGERS 4 (24) MULTI-POLY-BERNOULLI-STAR NUMBERS AND FINITE MULTIPLE ZETA-STAR VALUES Kohtaro Imatomi Graduate School of Mathematics, Kyushu Uiversity, Nishi-ku, Fukuoka, Japa k-imatomi@math.kyushu-u.ac.p

More information

Dr. Clemens Kroll. Abstract

Dr. Clemens Kroll. Abstract Riema s Hypothesis ad Stieltjes Cojecture Riema s Hypothesis ad Stieltjes Cojecture Dr. Clemes Kroll Abstract It is show that Riema s hypothesis is true by showig that a equivalet statemet is true. Eve

More information

The structure of finite rings. The multiplicative residues. Modular exponentiation. and finite exponentiation

The structure of finite rings. The multiplicative residues. Modular exponentiation. and finite exponentiation The structure of fiite rigs ad fiite expoetiatio The multiplicative residues We have see that the fiite rig Z p is a field, that is, every o-zero elemet of Z p has a multiplicative iverse It is a covetio

More information

Diophantine Equation. Has Infinitely Many Prime Solutions

Diophantine Equation. Has Infinitely Many Prime Solutions Diophatie Equatio + L+ λ + λ λ + L+ Has Ifiitely May rime Solutios Chu-Xua iag. O. Box 9, Beijig 0085,. R. Chia liukxi @ public. bta. et. c Abstract By usig the arithmetic fuctio we prove that Diophatie

More information

arxiv: v1 [math.nt] 28 Apr 2014

arxiv: v1 [math.nt] 28 Apr 2014 Proof of a supercogruece cojectured by Z.-H. Su Victor J. W. Guo Departmet of Mathematics, Shaghai Key Laboratory of PMMP, East Chia Normal Uiversity, 500 Dogchua Rd., Shaghai 0041, People s Republic of

More information

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n

BINOMIAL PREDICTORS. + 2 j 1. Then n + 1 = The row of the binomial coefficients { ( n BINOMIAL PREDICTORS VLADIMIR SHEVELEV arxiv:0907.3302v2 [math.nt] 22 Jul 2009 Abstract. For oegative itegers, k, cosider the set A,k = { [0, 1,..., ] : 2 k ( ). Let the biary epasio of + 1 be: + 1 = 2

More information

Strong Convergence Theorems According. to a New Iterative Scheme with Errors for. Mapping Nonself I-Asymptotically. Quasi-Nonexpansive Types

Strong Convergence Theorems According. to a New Iterative Scheme with Errors for. Mapping Nonself I-Asymptotically. Quasi-Nonexpansive Types It. Joural of Math. Aalysis, Vol. 4, 00, o. 5, 37-45 Strog Covergece Theorems Accordig to a New Iterative Scheme with Errors for Mappig Noself I-Asymptotically Quasi-Noexpasive Types Narogrit Puturog Mathematics

More information

THE AVERAGE ORDER OF ELEMENTS IN THE MULTIPLICATIVE GROUP OF A FINITE FIELD. α(n) = 1

THE AVERAGE ORDER OF ELEMENTS IN THE MULTIPLICATIVE GROUP OF A FINITE FIELD. α(n) = 1 THE AVERAGE ORDER OF ELEMENTS IN THE MULTIPLICATIVE GROUP OF A FINITE FIELD YILAN HU AND CARL POMERANCE ABSTRACT. We cosider the average multiplicative order of a ozero elemet i a fiite field ad compute

More information

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function

Summary: Congruences. j=1. 1 Here we use the Mathematica syntax for the function. In Maple worksheets, the function Summary: Cogrueces j whe divided by, ad determiig the additive order of a iteger mod. As described i the Prelab sectio, cogrueces ca be thought of i terms of coutig with rows, ad for some questios this

More information

FINITE TRIGONOMETRIC PRODUCT AND SUM IDENTITIES. 1. Introduction In some recent papers [1, 2, 4, 5, 6], one finds product identities such as.

FINITE TRIGONOMETRIC PRODUCT AND SUM IDENTITIES. 1. Introduction In some recent papers [1, 2, 4, 5, 6], one finds product identities such as. FINITE TRIGONOMETRIC PRODUCT AND SUM IDENTITIES MARC CHAMBERLAND Abstract Several product ad sum idetities are established with special cases ivolvig Fiboacci ad Lucas umbers These idetities are derived

More information

Commutativity in Permutation Groups

Commutativity in Permutation Groups Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION OF FIBONACCI VECTORS CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College

More information

P. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA

P. Z. Chinn Department of Mathematics, Humboldt State University, Arcata, CA RISES, LEVELS, DROPS AND + SIGNS IN COMPOSITIONS: EXTENSIONS OF A PAPER BY ALLADI AND HOGGATT S. Heubach Departmet of Mathematics, Califoria State Uiversity Los Ageles 55 State Uiversity Drive, Los Ageles,

More information

A New Sifting function J ( ) n+ 1. prime distribution. Chun-Xuan Jiang P. O. Box 3924, Beijing , P. R. China

A New Sifting function J ( ) n+ 1. prime distribution. Chun-Xuan Jiang P. O. Box 3924, Beijing , P. R. China A New Siftig fuctio J ( ) + ω i prime distributio Chu-Xua Jiag. O. Box 94, Beijig 00854,. R. Chia jiagchuxua@vip.sohu.com Abstract We defie that prime equatios f (, L, ), L, f (, L ) (5) are polyomials

More information

Complex numbers 1D. 1 a. = cos + C cos θ(isin θ) + + cos θ(isin θ) (isin θ) Hence, Equating the imaginary parts gives, 2 3

Complex numbers 1D. 1 a. = cos + C cos θ(isin θ) + + cos θ(isin θ) (isin θ) Hence, Equating the imaginary parts gives, 2 3 Complex umbers D a (cos+ i ) = cos + i = cos + C cos (i) Ccos (i) (i) + + = cos + i cos si+ i cos + i = cos + i cos si cos i de Moivre s Theorem. Biomial expasio. cos + i si = cos + i cos si cos i Equatig

More information

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1. Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6

More information

IRRATIONALITY MEASURES, IRRATIONALITY BASES, AND A THEOREM OF JARNÍK 1. INTRODUCTION

IRRATIONALITY MEASURES, IRRATIONALITY BASES, AND A THEOREM OF JARNÍK 1. INTRODUCTION IRRATIONALITY MEASURES IRRATIONALITY BASES AND A THEOREM OF JARNÍK JONATHAN SONDOW ABSTRACT. We recall that the irratioality expoet µα ( ) of a irratioal umber α is defied usig the irratioality measure

More information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Unit 6: Sequences and Series

Unit 6: Sequences and Series AMHS Hoors Algebra 2 - Uit 6 Uit 6: Sequeces ad Series 26 Sequeces Defiitio: A sequece is a ordered list of umbers ad is formally defied as a fuctio whose domai is the set of positive itegers. It is commo

More information

Math 2112 Solutions Assignment 5

Math 2112 Solutions Assignment 5 Math 2112 Solutios Assigmet 5 5.1.1 Idicate which of the followig relatioships are true ad which are false: a. Z Q b. R Q c. Q Z d. Z Z Z e. Q R Q f. Q Z Q g. Z R Z h. Z Q Z a. True. Every positive iteger

More information

Recurrence Relations

Recurrence Relations Recurrece Relatios Aalysis of recursive algorithms, such as: it factorial (it ) { if (==0) retur ; else retur ( * factorial(-)); } Let t be the umber of multiplicatios eeded to calculate factorial(). The

More information

1. INTRODUCTION. P r e s e n t e d h e r e is a generalization of Fibonacci numbers which is intimately connected with the arithmetic triangle.

1. INTRODUCTION. P r e s e n t e d h e r e is a generalization of Fibonacci numbers which is intimately connected with the arithmetic triangle. A GENERALIZATION OF FIBONACCI NUMBERS V.C. HARRIS ad CAROLYN C. STYLES Sa Diego State College ad Sa Diego Mesa College, Sa Diego, Califoria 1. INTRODUCTION P r e s e t e d h e r e is a geeralizatio of

More information

Expected Norms of Zero-One Polynomials

Expected Norms of Zero-One Polynomials DRAFT: Caad. Math. Bull. July 4, 08 :5 File: borwei80 pp. Page Sheet of Caad. Math. Bull. Vol. XX (Y, ZZZZ pp. 0 0 Expected Norms of Zero-Oe Polyomials Peter Borwei, Kwok-Kwog Stephe Choi, ad Idris Mercer

More information

k-equitable mean labeling

k-equitable mean labeling Joural of Algorithms ad Comutatio joural homeage: htt://jac.ut.ac.ir k-euitable mea labelig P.Jeyathi 1 1 Deartmet of Mathematics, Govidammal Aditaar College for Wome, Tiruchedur- 628 215,Idia ABSTRACT

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

More information

University of Twente The Netherlands

University of Twente The Netherlands Faculty of Mathematical Scieces t Uiversity of Twete The Netherlads P.O. Box 7 7500 AE Eschede The Netherlads Phoe: +3-53-4893400 Fax: +3-53-48934 Email: memo@math.utwete.l www.math.utwete.l/publicatios

More information

Hankel determinants of some polynomial sequences. Johann Cigler

Hankel determinants of some polynomial sequences. Johann Cigler Hael determiats of some polyomial sequeces Joha Cigler Faultät für Mathemati, Uiversität Wie ohacigler@uivieacat Abstract We give simple ew proofs of some Catala Hael determiat evaluatios by Ömer Eğecioğlu

More information

Pellian sequence relationships among π, e, 2

Pellian sequence relationships among π, e, 2 otes o umber Theory ad Discrete Mathematics Vol. 8, 0, o., 58 6 Pellia sequece relatioships amog π, e, J. V. Leyedekkers ad A. G. Shao Faculty of Sciece, The Uiversity of Sydey Sydey, SW 006, Australia

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information