Congruences for Stirling Numbers of the Second Kind Modulo 5

Similar documents
MATH 118 PROBLEM SET 6

LECTURE 9: QUADRATIC RESIDUES AND THE LAW OF QUADRATIC RECIPROCITY

Domination and Independence on Square Chessboard

Fermat s little theorem. RSA.

General Augmented Rook Boards & Product Formulas

Applications of Fermat s Little Theorem and Congruences

The congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.

SOLUTIONS TO PROBLEM SET 5. Section 9.1

LECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.

Spiral Tilings with C-curves

Number Theory - Divisibility Number Theory - Congruences. Number Theory. June 23, Number Theory

MAXIMUM FLOWS IN FUZZY NETWORKS WITH FUNNEL-SHAPED NODES

First Round Solutions Grades 4, 5, and 6

NUMBER THEORY Amin Witno

Solutions for the Practice Questions

6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method

Ramanujan-type Congruences for Overpartitions Modulo 5. Nankai University, Tianjin , P. R. China

SYMMETRIES OF FIBONACCI POINTS, MOD m

Number Theory/Cryptography (part 1 of CSC 282)

Math 255 Spring 2017 Solving x 2 a (mod n)

Arithmetic Properties of Combinatorial Quantities

CS 135: Computer Architecture I. Boolean Algebra. Basic Logic Gates

Distribution of Primes

CHAPTER 2 LITERATURE STUDY

Zhanjiang , People s Republic of China

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013

ALGEBRA: Chapter I: QUESTION BANK

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP

LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS

NUMBER THEORY AMIN WITNO

Two congruences involving 4-cores

LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI

Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02

SOLUTIONS FOR PROBLEM SET 4

Discrete Math Class 4 ( )

1.6 Congruence Modulo m

12. 6 jokes are minimal.

10.4 AREAS AND LENGTHS IN POLAR COORDINATES

Carmen s Core Concepts (Math 135)

Numbers (8A) Young Won Lim 6/21/17

Data security (Cryptography) exercise book

A CONJECTURE ON UNIT FRACTIONS INVOLVING PRIMES

Study on SLT calibration method of 2-port waveguide DUT

Unique Sequences Containing No k-term Arithmetic Progressions

Regular languages can be expressed as regular expressions.

Numbers (8A) Young Won Lim 5/24/17

Modular Arithmetic. Kieran Cooney - February 18, 2016

Lecture 32. Handout or Document Camera or Class Exercise. Which of the following is equal to [53] [5] 1 in Z 7? (Do not use a calculator.

p 1 MAX(a,b) + MIN(a,b) = a+b n m means that m is a an integer multiple of n. Greatest Common Divisor: We say that n divides m.

MAT Modular arithmetic and number theory. Modular arithmetic

Math 127: Equivalence Relations

On repdigits as product of consecutive Fibonacci numbers 1

Chinese Remainder. Discrete Mathematics Andrei Bulatov

Implementation / Programming: Random Number Generation

Theme: Don t get mad. Learn mod.

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.

Foundations of Cryptography

Example. Check that the Jacobian of the transformation to spherical coordinates is

Constructions of Coverings of the Integers: Exploring an Erdős Problem

Counting in Algorithms

Modular Arithmetic. claserken. July 2016

Congruence properties of the binary partition function

b) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively.

An elementary study of Goldbach Conjecture

Discrete Square Root. Çetin Kaya Koç Winter / 11

Introduction. and Z r1 Z rn. This lecture aims to provide techniques. CRT during the decription process in RSA is explained.

What is counting? (how many ways of doing things) how many possible ways to choose 4 people from 10?

Math 412: Number Theory Lecture 6: congruence system and

#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick

SOLVING TRIANGLES USING THE SINE AND COSINE RULES

THE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m

Numbers (8A) Young Won Lim 5/22/17

ON THE EQUATION a x x (mod b) Jam Germain

PRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES. Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Number Theory. Konkreetne Matemaatika

The covering congruences of Paul Erdős. Carl Pomerance Dartmouth College

Unit 1: Chapter 4 Roots & Powers

FORBIDDEN INTEGER RATIOS OF CONSECUTIVE POWER SUMS

Primitive Roots. Chapter Orders and Primitive Roots

(1) Primary Trigonometric Ratios (SOH CAH TOA): Given a right triangle OPQ with acute angle, we have the following trig ratios: ADJ

REVIEW, pages

Modular arithmetic Math 2320

9.4. ; 65. A family of curves has polar equations. ; 66. The astronomer Giovanni Cassini ( ) studied the family of curves with polar equations

Outline Introduction Big Problems that Brun s Sieve Attacks Conclusions. Brun s Sieve. Joe Fields. November 8, 2007

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,

Solutions for the 2nd Practice Midterm

Introduction to Modular Arithmetic

Math Circles Finite Automata Question Sheet 3 (Solutions)

ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey

Modular Arithmetic and Doomsday

Fall. Spring. Possible Summer Topics

A Study of Relationship Among Goldbach Conjecture, Twin prime and Fibonacci number

Wilson s Theorem and Fermat s Theorem

ECE 274 Digital Logic. Digital Design. Datapath Components Shifters, Comparators, Counters, Multipliers Digital Design

ON SPLITTING UP PILES OF STONES

Joanna Towler, Roading Engineer, Professional Services, NZTA National Office Dave Bates, Operations Manager, NZTA National Office

Congruences Modulo Small Powers of 2 and 3 for Partitions into Odd Designated Summands

The Math Learning Center PO Box 12929, Salem, Oregon Math Learning Center

Transcription:

Southest Asin Bulletin of Mthemtics (2013 37: 795 800 Southest Asin Bulletin of Mthemtics c SEAMS. 2013 Congruences for Stirling Numbers of the Second Kind Modulo 5 Jinrong Zho School of Economic Mthemtics, Southwestern University of Finnce nd Economics, Chengdu 61007, P.R. Chin Emil: mthzjr@fomil.com Received 10 Februry 2013 Accepted 28 July 2013 Communicted by K.P. Shum AMS Mthemtics Subject Clssifiction(2000: 11B73, 11A07 Abstrct. Let n nd k be positive integers nd S(n,k be the Stirling numbers of the second kind. In this pper, the uthor estblishes the congruences for S(n, k modulo 5 in terms of binomil coefficients. Keywords: Stirling number of the second kind; Congruence; Binomil coefficient 1. Introduction The Stirling numbers re common topics in number theory nd combintorics. Let N denote the set of nturl numbers. The Stirling numbers of the first kind, denoted by s(n, k (with lower-cse s, count the number of permuttions of n elements with k disjoint cycles. The Stirling numbers of the second kind S(n,k (with cpitl S is defined forn N nd positiveinteger k n s the numberofwystoprtitionset ofnelementsintoectlyk non-emptysubsets. One cn chrcterize the Stirling numbers of the first nd the second kind by ( n k0 s(n,kk nd n k0 S(n,k( k, respectively, where ( n is the flling fctoril ( n ( 1...( n+1. The Stirling numbers of the first nd second kind cn be considered to inverse of one nother: m(j,k l0 s(l,js(k,l δ jk nd m(j,k l0 S(l,js(k,l δ jk,

796 J.R. Zho where δ jk is the Kronecker delt. Divisibility is n importnt nd interesting topic in number theory. See [5], [6] nd [12] for some interesting results on this topic. For emple, the elements of n rbitrry gcd-closed set of the form pqr were considered nd studied in [6]. Divisibility properties of Stirling numbers hve been studied from number of different perspectives. Given prime p nd positive integer m, there eist unique integers nd m, with p nd n 0, such tht m p n. The number n is clled the p-dic vlution of m, denoted by n v p (m. The numbers min{v p (k!s(n,k : m k n} re importnt in lgebric topology, see [2]. Lengyel [9] studied the 2-dic vlutions of S(n, k nd conjectured, proved by Wnnemcker [11], tht v 2 (S(2 n,k s 2 (k 1, where s 2 (k mens the bse 2 digitl sum of k. Lengyel [10] showed tht if 1 k 2 n, then v 2 (S(c2 n,k s 2 (k 1 for ny positive integer c. Amdeberhn, Mnn nd Moll [1] suggested tht v 2 (S(2 n + 1,k + 1 s 2 (k 1, which confirmed by Hong, Zho nd Zho [7]. Congruence is nother centrl topic in the field of Stirling numbers of the second kind. It is known tht for ech fied k, the sequence {S(n,k,n k} is periodic modulo prime powers. The length of this period hs been studied by Crlitz [3] nd Kwong [8]. Chn nd Mnn [] chrcterized S(n, k modulo prime powers in terms of binomil coefficients when k is multiple modulus. In this pper, we estblishes the congruences for S(n,k modulo 5 in terms of binomil coefficients. For ny rel number, we denote by the biggest integer no more thn. In fct, we hve the following min results. Theorem 1.1. Let n nd be positive integers with n 5. Then the following congruences re true modulo 5: { (n if n (mod, (i S(n, 5 1 (ii S(n,5+1 ( n 1. 2 (n if n (mod, (iii S(n,5+2 3 (n 3 if n 1 (mod, (n 2 if n 2 (mod, (n if n (mod, (n 3 (iv S(n,5+3 if n 1 (mod, {(n (v S(n,5+ if n (mod, In the net section, we will show Theorem 1.1.

Congruences for Stirling Numbers of the Second Kind Modulo 5 797 2. Proof of Theorem 1.1 At first, we will use the elementry property of S(n,k s follows. For ech fied k, S(n, k hs generting function (i. By (1, we hve S(n,k n S(n,5 n 5 k 1 i. (1 ( 5 1 i 1 i 5( 1 5 1 (1 ( 5 ( j j j0 ( 1+j j+5 (mod 5. (2 j j0 Collecting powers nd reindeing in (2, we derive tht if n (mod, then ( 1+ n 5 ( n S(n,5 n 5 (mod 5, 1 nd if n (mod, then S(n,5 0 (mod 5. So prt (i is proved. (ii. From (1, we cn deduce tht S(n,5+1 n m0 5+1 r1 ( 5 1 i 1 i 1 ( S(m,5 m( r n 1 S(t,5 n (mod 5. (3 t0 Then by (3 nd the definition of Stirling numbers of the second kind, we get n 1 S(n,5+1 S(t,5 t0 5 t n 1 j ( mod n 1 t5 It then follows from ( nd prt (i tht ( t S(n,5+1 1 n 1 s ( s 1 1 S(t,5 (mod 5. ( 5 t n 1 t+s n 1 5 j0 ( t 1 1 ( j + 1 1 (mod 5. (5

798 J.R. Zho Thus by (5 nd pplying the identity c ( ( b+j b+1+c b b+1 j0 with b 1 nd c n 1 5, we obtin ( n 1 S(n,5+1 (mod 5 s required. Prt (ii is true. (iii. By (1, we get tht (5+5 S(n,5+2 n (1 3(1 (1 5 1 i 3 It follows tht ( S(m,5(+1 m 1+3+2 2 m0 S(n+3,5(+1 n +3 S(n+2,5(+1 n +2 3 S(n+1,5(+1 n (mod 5. S(n,5+2 S(n+3,5(+1+3S(n+2,5(+1 +2S(n+1,5(+1 (mod 5. (6 On the other hnd, by prt (i we derive tht S(n+3,5(+1 S(n+2,5(+1 S(n+1,5(+1 if n+3 +1 mod if n+2 +1 mod if n+1 +1 mod {(n 2 {(n 3 {(n It then follows from (6, (7, (8 nd (9 tht 2 (n if n (mod, S(n,5+2 3 (n 3 if n 1 (mod, (n 2 if n 2 (mod, (mod 5, (7 (mod 5, (8 (mod 5. (9 (mod 5

Congruences for Stirling Numbers of the Second Kind Modulo 5 799 s desired. Prt (iii is proved. (iv. From (1, we derive tht S(n,5+3 n ( m0 Thus by (10 we know tht (5+5 S(m,5(+1 m 1+ 2 (1 (1 5 1 i 2 ( S(n+2,5(+1+S(n+1,5(+1 n (mod 5. (10 S(n,5+3 S(n+2,5(+1+S(n+1,5(+1 (mod 5. (11 It then follows from (8, (9 nd (11 tht if n +3 (mod, then ( n 3 S(n,5+3 S(n+2,5(+1 (mod 5; if n +2 (mod, then S(n,5+3 S(n+1,5(+1 ( n (mod 5; if ether n +1 (mod or n (mod, then S(n,5+3 0 (mod 5. This implies tht prt (iv is true. (v. Using (1, we cn obtin tht (5+5 S(n,5+ n (1 5 1 i ( S(m,5(+1 m 1 S(n+1,5(+1 n (mod 5. (12 m0 It then follows from (9 nd (12 tht S(n,5+ S(n+1,5(+1 {(n if n (mod, 0, otherwise (mod 5 s required. Prt (v is proved. The proof of Theorem 1.1 is complete. References [1] T. Amdeberhn, D. Mnn, V. Moll, The 2-dic vlution of Stirling numbers, Eperimentl Mth. 17 (2008 69 82.

800 J.R. Zho [2] M. Bendersky nd D.M. Dvis, 2-primry v 1-periodic homotopy groups of SU(n, Amer. J. Mth. 11 (1991 529 5. [3] L. Crlitz, Congruences for generlized Bell nd Stirling numbers, Duke Mth. J. 22 (1955 193 205. [] O.Y. Chn nd D.V. Mnn, Congruences for Stirling numbers of the second kind, Contemporry Mth. 517 (2010 97 111. [5] S. Hong, Divisibility of determinnts of lest common multiple mtrices on GCDclosed sets, Southest Asin Bull. Mth. 27 (2003 615 621. [6] S. Hong, K.P. Shum, Q. Sun, On nonsingulr power LCM mtrices, Algber Colloq. 13 (2006 689 70. [7] S. Hong, J. Zho, W. Zho, The 2-dic vlutions of Stirling numbers of the second kind, Interntionl J. Number Theory 8 (2012 1057 1066. [8] Y.H. Kwong, Minimum periods of S(n, k modulo M, Fiboncci Qurt. 27 (1989 217 221. [9] T. Lengyel, On the divisibility by 2 of Stirling numbers of the second kind, Fiboncci Qurt. 32 (199 19 201. [10] T. Lengyel, On the 2-dic order of Stirling numbers of the second kind nd their differences, DMTCS Proc. AK (2009 561 572. [11] S. De Wnnemcker, On the 2-dic orders of Stirling numbers of the second kind, Integers 5 (2005 #A21, 7pp. [12] W. Zho nd J. Zho, A chrcteriztion of the gcd-closed set S with S 5 such tht (S e divides [S e ], Southest Asin Bull Mth 33 (2009 1023 1028.

2024 © hobbydocbox.com Privacy Policy | Terms of Service | Feedback