THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction

Size: px
Start display at page:

Download "THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction"

Transcription

1 THE LUCAS TRIANLE RECOUNTED Arthur T Bejami Dept of Mathematics, Harvey Mudd College, Claremot, CA bejami@hmcedu 1 Itroductio I 2], Neville Robbis explores may properties of the Lucas triagle, a ifiite triagular array with properties similar to Pascal s triagle I this paper, we provide a combiatorial explaatio for the etries of this triagle This iterpretatio results i extremely quic ad ituitive proofs of most of the properties (proved mostly by iductio i 2]) ad allows for a atural geeralizatio, with equally trasparet proofs Usig Robbis otatio, we defie the umber by the iitial coditios = 1 for 1, = 2 for 0, 0] ] ad the Pascal-lie recurrece for 1 1, ] ] 1 1 = + 1 For combiatorial coveiece, we shall defie = 0 wheever < 0 or < 0 or > This allows the recurrece to be true for all values of ad except for = = 0 ad = 1, = 0 Below we list rows 0 through 9 of the Lucas triagle: 1

2 2 THE LUCAS TRIANLE RECOUNTED Combiatorial Iterpretatio The coectio to Lucas umbers is easy to see as follows As is well-ow 1], L couts the ways to tile a bracelet of legth with squares ad domioes The cells of the bracelet are labeled from 1 through ad we defie the first tile to be the tile that covers cell 1, the cell that is to the right of the clasp For example, the Lucas umber L 4 = 7, reflects the fact that there are seve bracelets of legth four, amely dd (two ways), dss (two ways), sds, ssd, ad ssss where d deotes a domio, s deotes a square; the first two tiligs have two represetatios, depedig o whether the iitial domio covers the clasp (cells 4 ad 1) or covers cells 1 ad 2 Theorem 1 For 1, couts bracelets cotaiig tiles with exactly domioes (ad therefore squares) Proof Let B(, ) deote the umber of bracelets with domioes ad squares We prove that B(, ) = by showig that B(, ) satisfies the same iitial coditios ad recurrece Clearly, there is oe bracelet with squares ad o domioes ad there are two bracelets with domioes ad o squares

3 THE LUCAS TRIANLE RECOUNTED 3 (depedig o the locatio of the iitial domio) Thus B(, 0) = 1 = ad 0] B(, ) = 2 = For the recurrece, otice that a bracelet with domioes ] ad squares will either ed with a square (preceded by domioes ad 1 squares) or ed with domio (preceded by 1 domioes ad squares) That is, B(, ) = B( 1, ) + B( 1, 1) satisfies the same recurrece as, ad therefore B(, ) = Usig this combiatorial iterpretatio, most of the idetities preseted i 2] ca be proved by ispectio (more precisely, by ispectig the size of a set i two differet ways) We ote that a bracelet with tiles cosistig of domioes ad squares will have legth + It follows that for 1, = + 1 1] sice a bracelet with tiles with just oe domio has legth + 1 ad that domio ca start o ay of the + 1 cells Liewise, for 1, ] = sice a bracelet with 1 domioes ad oe square has legth 2 1 ad therefore has 2 1 places to put its loe square Similarly, for 2, ] = ( 1) 2 2 sice a bracelet of legth 2 2 with two squares ca be obtaied by isertig the squares i ay two cells of opposite parity

4 4 THE LUCAS TRIANLE RECOUNTED The followig sums are also easy to see For 1, = 3(2 1 ) =0 sice the left side couts bracelets with tiles with a arbitrary umber of domioes There are three choices for the first tile (oe possible square ad two possible domioes) followed by two choices for each of the followig 1 tiles By the same reasoig, we have, for 2, = 2 ] = 3( ) 0 0 sice if we specify the parity of the umber of domioes, the the last tile is ] i forced Fially otice that couts bracelets of legth with i domioes i ad therefore i 0 ] i = L i Notice that whe p is prime, we have for all 1 i (p 1)/2, ] p p i i sice every bracelet of prime legth p with at least 1 domio has p distict bracelets i its orbit, obtaied by shiftig each tile clocwise uits as varies from 0 to p 1 The bracelets are distict sice p is prime Eve Robbis s followig extesio ca be appreciated combiatorially Propositio: Let p be a odd prime, the for all j such that 1 j p 2 ad ] for all i such that j + 1 i p 1, we have p p + j i Proof Let X be a bracelet with p + j tiles, where 1 j p 2, with i domioes where j + 1 i p 1 Here we obtai the orbit of X by eepig the first j tiles fixed, ad the rotatig the remaiig p tiles oe tile at a time Notice that the

5 THE LUCAS TRIANLE RECOUNTED 5 bouds o i ad j esure that the fixed part has at least oe tile, ad that the rotatig part has at least oe square ad at least oe domio (If the rotatig part of X were all squares or all domioes, the its orbit would have size oe or two, respectively) Thus, sice p is prime, every orbit of X has p elemets, as desired Alteratig sums ca also be easily hadled combiatorially For example, for 2, the idetity ] ( 1) = 0 =0 says that, amog bracelets with tiles, there are as may bracelets with a eve umber of domioes as with a odd umber of domioes This is easy to see by the simplest of ivolutios: togglig the last tile I other words, if the last tile of your bracelet is a square the tur it ito a domio; if the last tile is a domio, the tur it ito a square (Note that the coditio that 2 assures that the last tile is ot the same as the first tile) Either way, the parity of the umber of domioes has chaged I this way, every bracelet with tiles ad a eve umber of domioes holds hads with a bracelet with tiles ad a odd umber of domioes The precedig idetity ad argumet ca be geeralized to give: m ] ( 1) =0 ] 1 = ( 1) m m For this idetity, we apply the same togglig argumet as before, but ow we are restricted to bracelets with tiles that have at most m domioes The oly bracelets that are ot matched up are those that have m domioes ad ed with

6 6 THE LUCAS TRIANLE RECOUNTED a square (These bracelets are umatched because togglig the last square would create a bracelet with m + 1 domioes, which exceeds our upper boud) Sice ] 1 there are bracelets of this type, all of which have m tiles, the idetity m follows Next, we ote that etries of the Lucas triagle ca be expressed i terms of the classical biomial coefficiets that ihabit Pascal s triagle Specifically, for 2 ad 0, = ( ) + ( ) 1 1 For ay bracelet with tiles ad domioes, it either has a domio coverig the clasp (resultig i a out-of-phase bracelet) or it does ot (resultig i a i-phase bracelet) The first biomial coefficiet couts the i-phase bracelets, sice we simply choose which of the tiles are domioes The umber of out-of-phase bracelets is ( 1 1) sice the first tile must be a domio coverig the clasp, ad the we ca freely choose 1 of the remaiig 1 tiles to be domioes I fact ca be expressed eve more directly i terms of biomial coefficiets, amely or equivaletly, = + = ( + ) ( ), The left side couts the ways to create a bracelet with tiles, cotaiig ( ) domioes, ad placig a star o oe of the tiles (If the selected tile is a domio, we shall place the star o its left half) The right side couts i-phase bracelets with tiles, cotaiig domioes where we place a star o oe of its

7 THE LUCAS TRIANLE RECOUNTED 7 + cells We show that these two sets have the same size by creatig a bijectio betwee the two sets Let X be a bracelet from the first set The X has legth + ad has a star o a tile that begis o some cell j, where 1 j + If X is i-phase, the we leave the bracelet uchaged, ad simply move the star from the tile to the cell j If X is out-of-phase, the we rotate X couterclocise j 1 uits so that it becomes a i-phase bracelet begiig with the tile that origially had the star The we trasfer the star to the cell below the right half of the domio that used to cover the clasp (This would put the star o cell j) Sice this process is easily reversed by examiig the tile that covers the cell with the star, we have our desired bijectio The ext two idetities mae use of the complemet of a tilig ive a tilig X, we obtai its complemet X by togglig each tile For example, if X = ssdds the X = ddssd Recallig that F m couts the set of tiligs (or i-phase bracelets) of legth m 1, we obtai the ext idetity (misstated i 2]) For 1, F 2+2 = i=0 ] + i 2i To see this, let X be a tilig of legth If X begis with a square, the we create a i-phase bracelet Y by deletig the first square, the taig the complemet of the rest of X If we let X 1 be the tilig X with its first tile missig, the our mappig ca be deoted by sx 1 X 1 (i-phase) Notice that sice X has odd legth, the the umber of squares i X must be a odd umber 2i + 1 for some 0 i It follows that X has + i + 1 tiles

8 8 THE LUCAS TRIANLE RECOUNTED comprisig 2i+1 squares ad i domioes Hece the bracelet Y has +i tiles with 2i domioes, ad all i-phase bracelets of this type ca be obtaied this way O the other had, if X begis with a domio, the we obtai the out-of-phase bracelets by the mappig dx 1 dx 1 (out-of-phase) where the iitial domio of X covers the clasp of Y, ad all subsequet tiles of X are replaced by their complemet Here, if X has 2i 1 squares for some 1 i, the X will cotai + i tiles comprisig 2i 1 squares ad + 1 i domioes, ad therefore Y will cotai + i tiles with exactly 2i domioes as desired We leave it to the reader to verify that the exact same mappig leads to the idetity 1 ] + i F 2+1 = 2i + 1 i=0 3 The iboacci Triagle The Lucas umbers are a special case of the iboacci umbers defied by arbitrary iitial coditios 0 ad 1, ad for 2, = It is easy to show (as doe i 1]) that has the followig combiatorial iterpretatio Whe 0 ad 1 are oegative itegers ad 1, couts phased tiligs of legth These are just lie traditioal tiligs with squares ad domioes, but the first tile is give a phase If the iitial tile is a domio, the it ca be assiged oe of 0 phases; if the iitial tile is a square, the it ca be assiged oe of 1 phases Notice that whe 0 = 2 ad 1 = 1, that = L

9 THE LUCAS TRIANLE RECOUNTED 9 ad the 0 = 2 phases of a iitial domio idicate whether or ot a iitial domio covers the clasp Whe 0 = 0 ad 1 = 1, the = F ad we are coutig legth tiligs that must begi with a square (sice there are o iitial domioes) ad therefore couts arbitrary tiligs of legth 1 Although this defiitio requires 0 ad 1 to be oegative itegers, a similar iterpretatio ca be give for arbitrary real or complex umbers (as show i 1]) but we will ot pursue that here We defie the umber 0] ad for 1 1, Also we let = 1 for 1, by the iitial coditios = ] ] 1 + = 0 for 0, ] 1 1 = 0 whe < 0 or < 0 or > For example, the iitial terms 0 = 4 ad 1 = 9, geerate the iboacci sequece: 4, 9, 13, 22, 35, 57, 92, 149, 241, 390, The first te rows of the iboacci Triagle are:

10 10 THE LUCAS TRIANLE RECOUNTED Arguig exactly as before, we have a simple combiatorial iterpretatio of Theorem 2 For 1, 0, exactly domioes (ad therefore squares) couts phased tiligs with tiles cotaiig This combiatorial iterpretatio allows us to immediately geeralize most of the precedig theorems (It also immediately gives us a geeratig fuctio, amely is the a b coefficiet of ( 0 a + 1 b)(a + b) 1 ) Their proofs are almost exactly the same as before, so we leave most of their details to the reader I our first set of idetities, we decide o the legth ad phase of the iitial tile, the proceed to choose the remaiig 1 (uphased) tiles For 1, = 1] ( 1) = 1 + ( 0 1 ), ad for 2, ] 1 ] 2 =0 = ( 1) = 0 + ( 1 0 ), ( ) 1 = ( 1), 2 = ( )2 1 = 2 2 1, = 2 ] = , 0 0 ( ) ( ) ( ) ( ) = = 1 + ( 0 1 ) 1 1 Some idetities geeralize with virtually o chages to their statemet or logic For example, the sum of the diagoal etries of the iboacci triagle yields

11 iboacci umbers For 0, Although the prime idetity THE LUCAS TRIANLE RECOUNTED 11 i 0 ] i = i ] p p i i does ot have a phased aalog (because we caot rotate the phased iitial tile), the extesio of that result wors fie because the first j tiles are fixed Specifically, for ay odd prime p ad for ay 1 j p 2 ad j + 1 i p 1, ] p p + j i Liewise, the alteratig idetities, obtaied by togglig the last tile, are completely uaffected by the iitial tile Thus, for 2, ] ( 1) = 0, =0 m ] ] 1 ( 1) = ( 1) m m =0 Refereces 1] A T Bejami ad J J Qui, Proofs That Really Cout: The Art of Combiatorial Proof, Mathematical Associatio of America, Washigto, DC, ] N Robbis, The Lucas Triagle Revisited The Fiboacci Quarterly, Vol 43 (2005): pp AMS Subject Classificatio Numbers: 05A19, 11B39

Counting on r-fibonacci Numbers

Counting on r-fibonacci Numbers Claremot Colleges Scholarship @ Claremot All HMC Faculty Publicatios ad Research HMC Faculty Scholarship 5-1-2015 Coutig o r-fiboacci Numbers Arthur Bejami Harvey Mudd College Curtis Heberle Harvey Mudd

More information

Permutation Enumeration

Permutation Enumeration RMT 2012 Power Roud Rubric February 18, 2012 Permutatio Eumeratio 1 (a List all permutatios of {1, 2, 3} (b Give a expressio for the umber of permutatios of {1, 2, 3,, } i terms of Compute the umber for

More information

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1 1. [5] Give sets A ad B, each of cardiality 1, how may fuctios map A i a oe-tooe fashio oto B? 2. [5] a. Give the set of r symbols { a 1, a 2,..., a r }, how may differet strigs of legth 1 exist? [5]b.

More information

8. Combinatorial Structures

8. Combinatorial Structures Virtual Laboratories > 0. Foudatios > 1 2 3 4 5 6 7 8 9 8. Combiatorial Structures The purpose of this sectio is to study several combiatorial structures that are of basic importace i probability. Permutatios

More information

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule Chapter 3 Combiatorics 3.1 Permutatios Readig questios 1. Defie what a permutatio is i your ow words. 2. What is a fixed poit i a permutatio? 3. What do we assume about mutual disjoitedess whe creatig

More information

1. How many possible ways are there to form five-letter words using only the letters A H? How many such words consist of five distinct letters?

1. How many possible ways are there to form five-letter words using only the letters A H? How many such words consist of five distinct letters? COMBINATORICS EXERCISES Stepha Wager 1. How may possible ways are there to form five-letter words usig oly the letters A H? How may such words cosist of five distict letters? 2. How may differet umber

More information

A generalization of Eulerian numbers via rook placements

A generalization of Eulerian numbers via rook placements A geeralizatio of Euleria umbers via rook placemets Esther Baaia Steve Butler Christopher Cox Jeffrey Davis Jacob Ladgraf Scarlitte Poce Abstract We cosider a geeralizatio of Euleria umbers which cout

More information

7. Counting Measure. Definitions and Basic Properties

7. Counting Measure. Definitions and Basic Properties Virtual Laboratories > 0. Foudatios > 1 2 3 4 5 6 7 8 9 7. Coutig Measure Defiitios ad Basic Properties Suppose that S is a fiite set. If A S the the cardiality of A is the umber of elemets i A, ad is

More information

Ch 9 Sequences, Series, and Probability

Ch 9 Sequences, Series, and Probability Ch 9 Sequeces, Series, ad Probability Have you ever bee to a casio ad played blackjack? It is the oly game i the casio that you ca wi based o the Law of large umbers. I the early 1990s a group of math

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS www.sakshieducatio.com PERMUTATIONS AND COMBINATIONS OBJECTIVE PROBLEMS. There are parcels ad 5 post-offices. I how may differet ways the registratio of parcel ca be made 5 (a) 0 (b) 5 (c) 5 (d) 5. I how

More information

x y z HD(x, y) + HD(y, z) HD(x, z)

x y z HD(x, y) + HD(y, z) HD(x, z) Massachusetts Istitute of Techology Departmet of Electrical Egieerig ad Computer Sciece 6.02 Solutios to Chapter 5 Updated: February 16, 2012 Please sed iformatio about errors or omissios to hari; questios

More information

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series Roberto s Notes o Ifiite Series Chapter : Series Sectio Ifiite series What you eed to ow already: What sequeces are. Basic termiology ad otatio for sequeces. What you ca lear here: What a ifiite series

More information

POWERS OF 3RD ORDER MAGIC SQUARES

POWERS OF 3RD ORDER MAGIC SQUARES Fuzzy Sets, Rough Sets ad Multivalued Operatios ad Applicatios, Vol. 4, No. 1, (Jauary-Jue 01): 37 43 Iteratioal Sciece Press POWERS OF 3RD ORDER MAGIC SQUARES Sreerajii K.S. 1 ad V. Madhukar Mallayya

More information

CS3203 #5. 6/9/04 Janak J Parekh

CS3203 #5. 6/9/04 Janak J Parekh CS3203 #5 6/9/04 Jaak J Parekh Admiistrivia Exam o Moday All slides should be up We ll try ad have solutios for HWs #1 ad #2 out by Friday I kow the HW is due o the same day; ot much I ca do, uless you

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12 EECS 70 Discrete Mathematics ad Probability Theory Sprig 204 Aat Sahai Note 2 Probability Examples Based o Coutig We will ow look at examples of radom experimets ad their correspodig sample spaces, alog

More information

Counting III. Today we ll briefly review some facts you dervied in recitation on Friday and then turn to some applications of counting.

Counting III. Today we ll briefly review some facts you dervied in recitation on Friday and then turn to some applications of counting. 6.04/18.06J Mathematics for Computer Sciece April 5, 005 Srii Devadas ad Eric Lehma Lecture Notes Coutig III Today we ll briefly review some facts you dervied i recitatio o Friday ad the tur to some applicatios

More information

Logarithms APPENDIX IV. 265 Appendix

Logarithms APPENDIX IV. 265 Appendix APPENDIX IV Logarithms Sometimes, a umerical expressio may ivolve multiplicatio, divisio or ratioal powers of large umbers. For such calculatios, logarithms are very useful. They help us i makig difficult

More information

We often find the probability of an event by counting the number of elements in a simple sample space.

We often find the probability of an event by counting the number of elements in a simple sample space. outig Methods We ofte fid the probability of a evet by coutig the umber of elemets i a simple sample space. Basic methods of coutig are: Permutatios ombiatios Permutatio A arragemet of objects i a defiite

More information

BOUNDS FOR OUT DEGREE EQUITABLE DOMINATION NUMBERS IN GRAPHS

BOUNDS FOR OUT DEGREE EQUITABLE DOMINATION NUMBERS IN GRAPHS BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN 2303-4874 (p), ISSN (o) 2303-4955 www.imvibl.org/bulletin Vol. 3(2013), 149-154 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

More information

arxiv: v2 [math.co] 15 Oct 2018

arxiv: v2 [math.co] 15 Oct 2018 THE 21 CARD TRICK AND IT GENERALIZATION DIBYAJYOTI DEB arxiv:1809.04072v2 [math.co] 15 Oct 2018 Abstract. The 21 card trick is well kow. It was recetly show i a episode of the popular YouTube chael Numberphile.

More information

PERMUTATION AND COMBINATION

PERMUTATION AND COMBINATION MPC 1 PERMUTATION AND COMBINATION Syllabus : Fudametal priciples of coutig; Permutatio as a arragemet ad combiatio as selectio, Meaig of P(, r) ad C(, r). Simple applicatios. Permutatios are arragemets

More information

On Parity based Divide and Conquer Recursive Functions

On Parity based Divide and Conquer Recursive Functions O Parity based Divide ad Coquer Recursive Fuctios Sug-Hyu Cha Abstract The parity based divide ad coquer recursio trees are itroduced where the sizes of the tree do ot grow mootoically as grows. These

More information

GENERALIZED FORM OF A 4X4 STRONGLY MAGIC SQUARE

GENERALIZED FORM OF A 4X4 STRONGLY MAGIC SQUARE IJMMS, Vol. 1, No. Geeralized 1, (Jauary-Jue Form 016):87-9 of A 4x4 Strogly Magic Square Serials Publicatios 87 ISSN: 0973-339 GENERALIZED FORM OF A 4X4 STRONGLY MAGIC SQUARE Neeradha. C. K, ad Dr. V.

More information

General Model :Algorithms in the Real World. Applications. Block Codes

General Model :Algorithms in the Real World. Applications. Block Codes Geeral Model 5-853:Algorithms i the Real World Error Correctig Codes I Overview Hammig Codes Liear Codes 5-853 Page message (m) coder codeword (c) oisy chael decoder codeword (c ) message or error Errors

More information

Procedia - Social and Behavioral Sciences 128 ( 2014 ) EPC-TKS 2013

Procedia - Social and Behavioral Sciences 128 ( 2014 ) EPC-TKS 2013 Available olie at www.sciecedirect.com ScieceDirect Procedia - Social ad Behavioral Scieces 18 ( 014 ) 399 405 EPC-TKS 013 Iductive derivatio of formulae by a computer Sava Grozdev a *, Veseli Nekov b

More information

Data Mining the Online Encyclopedia of Integer Sequences for New Identities Hieu Nguyen

Data Mining the Online Encyclopedia of Integer Sequences for New Identities Hieu Nguyen Slide 1 of 18 Data Miig the Olie Ecyclopedia of Iteger Sequeces for New Idetities Hieu Nguye Rowa Uiversity MAA-NJ Sectio Sprig Meetig March 31, 2012 2 MAA-NJ Sprig Meetig Data Miig OEIS.b ü Ackowledgemets

More information

Technical Explanation for Counters

Technical Explanation for Counters Techical Explaatio for ers CSM_er_TG_E Itroductio What Is a er? A er is a device that couts the umber of objects or the umber of operatios. It is called a er because it couts the umber of ON/OFF sigals

More information

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER 95 CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER 5.1 GENERAL Ru-legth codig is a lossless image compressio techique, which produces modest compressio ratios. Oe way of icreasig the compressio ratio of a ru-legth

More information

3. Error Correcting Codes

3. Error Correcting Codes 3. Error Correctig Codes Refereces V. Bhargava, Forward Error Correctio Schemes for Digital Commuicatios, IEEE Commuicatios Magazie, Vol 21 No1 11 19, Jauary 1983 Mischa Schwartz, Iformatio Trasmissio

More information

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS Sectio 6.5: Combiatios Example Recall our five frieds, Ala, Cassie, Maggie, Seth ad Roger from the example at the begiig of the previous sectio. The have wo tickets for a cocert i Chicago ad everybody

More information

CS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73,

CS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73, CS 01 Schlag Jauary 6, 1999 Witer `99 CS 01: Adversary argumets This hadout presets two lower bouds for selectio problems usig adversary argumets ëku73, HS78, FG76ë. I these proofs a imagiary adversary

More information

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS Sectio 6.5: Combiatios Example Recall our five frieds, Ala, Cassie, Maggie, Seth ad Roger from the example at the begiig of the previous sectio. The have wo tickets for a cocert i Chicago ad everybody

More information

PROJECT #2 GENERIC ROBOT SIMULATOR

PROJECT #2 GENERIC ROBOT SIMULATOR Uiversity of Missouri-Columbia Departmet of Electrical ad Computer Egieerig ECE 7330 Itroductio to Mechatroics ad Robotic Visio Fall, 2010 PROJECT #2 GENERIC ROBOT SIMULATOR Luis Alberto Rivera Estrada

More information

Lecture 4: Frequency Reuse Concepts

Lecture 4: Frequency Reuse Concepts EE 499: Wireless & Mobile Commuicatios (8) Lecture 4: Frequecy euse Cocepts Distace betwee Co-Chael Cell Ceters Kowig the relatio betwee,, ad, we ca easily fid distace betwee the ceter poits of two co

More information

Name Class. Date Section. Test Form A Chapter Chapter 9 Infinite Series. 1 n 1 2 n 3n 1, n 1, 2, 3, Find the fourth term of the sequence

Name Class. Date Section. Test Form A Chapter Chapter 9 Infinite Series. 1 n 1 2 n 3n 1, n 1, 2, 3, Find the fourth term of the sequence 8 Chapter 9 Ifiite Series Test Form A Chapter 9 Name Class Date Sectio. Fid the fourth term of the sequece,,,,.... 6 (a) (b) 6 (c) 8 6. Determie if the followig sequece coverges or diverges: If the sequece

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Sprig 2 信號與系統 Sigals ad Systems Chapter SS- Sigals ad Systems Feg-Li Lia NTU-EE Feb Ju Figures ad images used i these lecture otes are adopted from Sigals & Systems by Ala V. Oppeheim ad Ala S. Willsky,

More information

On the Number of Permutations on n Objects with. greatest cycle length

On the Number of Permutations on n Objects with. greatest cycle length Ž. ADVANCES IN APPLIED MATHEMATICS 0, 9807 998 ARTICLE NO. AM970567 O the Number of Permutatios o Obects with Greatest Cycle Legth k Solomo W. Golomb ad Peter Gaal Commuicatio Scieces Istitute, Uiersity

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Sprig 24 信號與系統 Sigals ad Systems Chapter SS- Sigals ad Systems Feg-Li Lia NTU-EE Feb4 Ju4 Figures ad images used i these lecture otes are adopted from Sigals & Systems by Ala V. Oppeheim ad Ala S. Willsky,

More information

PRACTICAL FILTER DESIGN & IMPLEMENTATION LAB

PRACTICAL FILTER DESIGN & IMPLEMENTATION LAB 1 of 7 PRACTICAL FILTER DESIGN & IMPLEMENTATION LAB BEFORE YOU BEGIN PREREQUISITE LABS Itroductio to Oscilloscope Itroductio to Arbitrary/Fuctio Geerator EXPECTED KNOWLEDGE Uderstadig of LTI systems. Laplace

More information

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress.

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress. H2 Mathematics Pure Mathematics Sectio A Comprehesive Checklist of Cocepts ad Skills by Mr Wee We Shih Visit: weshih.wordpress.com Updated: Ja 2010 Syllabus topic 1: Fuctios ad graphs 1.1 Checklist o Fuctios

More information

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains 7 Figerprit Classificatio Based o Directioal Image Costructed Usig Wavelet Trasform Domais Musa Mohd Mokji, Syed Abd. Rahma Syed Abu Bakar, Zuwairie Ibrahim 3 Departmet of Microelectroic ad Computer Egieerig

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS Chapter 7 PERMUTATIONS AND COMBINATIONS Every body of discovery is mathematical i form because there is o other guidace we ca have DARWIN 7.1 Itroductio Suppose you have a suitcase with a umber lock. The

More information

13 Legislative Bargaining

13 Legislative Bargaining 1 Legislative Bargaiig Oe of the most popular legislative models is a model due to Baro & Ferejoh (1989). The model has bee used i applicatios where the role of committees have bee studies, how the legislative

More information

sible number of wavelengths. The wave~~ngt~ ~ ~ ~ c ~ n b~dwidth is set low eno~gh to interfax One of the most im

sible number of wavelengths. The wave~~ngt~ ~ ~ ~ c ~ n b~dwidth is set low eno~gh to interfax One of the most im sible umber of wavelegths. The wave~~gt~ ~ ~ ~ c ~ b~dwidth is set low eo~gh to iterfax vices. Oe of the most im ed trasmitters ad ysis much more CO "The author is also f Cumputer sciece Departmet, Uiversity

More information

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani Shufflig Cards Utrecht Uiversity Mathematics Bachelor s Thesis D.J.W. Telkamp Supervised by Dr. K. Dajai Jue 3, 207 Cotets Itroductio 2 2 Prerequisites 2 2. Problems with the variatio distace................

More information

A RULE OF THUMB FOR RIFFLE SHUFFLING

A RULE OF THUMB FOR RIFFLE SHUFFLING A RULE OF THUMB FOR RIFFLE SHUFFLING SAMI ASSAF, PERSI DIACONIS, AND K. SOUNDARARAJAN Abstract. We study how may riffle shuffles are required to mix cards if oly certai features of the deck are of iterest,

More information

X-Bar and S-Squared Charts

X-Bar and S-Squared Charts STATGRAPHICS Rev. 7/4/009 X-Bar ad S-Squared Charts Summary The X-Bar ad S-Squared Charts procedure creates cotrol charts for a sigle umeric variable where the data have bee collected i subgroups. It creates

More information

Unit 5: Estimating with Confidence

Unit 5: Estimating with Confidence Uit 5: Estimatig with Cofidece Sectio 8.2 The Practice of Statistics, 4 th editio For AP* STARNES, YATES, MOORE Uit 5 Estimatig with Cofidece 8.1 8.2 8.3 Cofidece Itervals: The Basics Estimatig a Populatio

More information

[MT93a, ALS94, Nie95, MNR95]. All these algorithms exploit kow characterizatios of extesios of default theories i terms of sets of geeratig defaults,

[MT93a, ALS94, Nie95, MNR95]. All these algorithms exploit kow characterizatios of extesios of default theories i terms of sets of geeratig defaults, Miimal umber of permutatios suciet to compute all extesios a ite default theory Pawe l Cholewiski ad Miros law Truszczyski Departmet of Computer Sciece Uiversity of Ketucky Lexigto, KY 40506-0046 pawel

More information

Mathematical Explorations of Card Tricks

Mathematical Explorations of Card Tricks Joh Carroll Uiversity Carroll Collected Seior Hoors Projects Theses, Essays, ad Seior Hoors Projects Sprig 2015 Mathematical Exploratios of Card Tricks Timothy R. Weeks Joh Carroll Uiversity, tweeks15@jcu.edu

More information

Zonerich AB-T88. MINI Thermal Printer COMMAND SPECIFICATION. Zonerich Computer Equipments Co.,Ltd MANUAL REVISION EN 1.

Zonerich AB-T88. MINI Thermal Printer COMMAND SPECIFICATION. Zonerich Computer Equipments Co.,Ltd  MANUAL REVISION EN 1. Zoerich AB-T88 MINI Thermal Priter COMMAND SPECIFICATION MANUAL REVISION EN. Zoerich Computer Equipmets Co.,Ltd http://www.zoerich.com Commad List Prit ad lie feed Prit ad carriage retur Trasmissio real-time

More information

Summary of Random Variable Concepts April 19, 2000

Summary of Random Variable Concepts April 19, 2000 Summary of Radom Variable Cocepts April 9, 2000 his is a list of importat cocepts we have covered, rather tha a review that derives or explais them. he first ad primary viewpoit: A radom process is a idexed

More information

Counting and Probability CMSC 250

Counting and Probability CMSC 250 Coutig ad Probabilit CMSC 50 1 Coutig Coutig elemets i a list: how ma itegers i the list from 1 to 10? how ma itegers i the list from m to? assumig m CMSC 50 How Ma i a List? How ma positive three-digit

More information

20. CONFIDENCE INTERVALS FOR THE MEAN, UNKNOWN VARIANCE

20. CONFIDENCE INTERVALS FOR THE MEAN, UNKNOWN VARIANCE 20. CONFIDENCE INTERVALS FOR THE MEAN, UNKNOWN VARIANCE If the populatio tadard deviatio σ i ukow, a it uually will be i practice, we will have to etimate it by the ample tadard deviatio. Sice σ i ukow,

More information

VIII. Shell-Voicings

VIII. Shell-Voicings VIII. Shell-Voicigs A. The Cocept The 5th (ad ofte the root as well) ca be omitted from most 7th-chords. Ratioale: Most chords have perfect 5ths. The P5th is also preset as the rd partial i the overtoe

More information

ETSI TS V3.1.1 ( )

ETSI TS V3.1.1 ( ) ETSI TS 15 13 V3.1.1 (000-01) Techical Specificatio Uiversal Mobile Telecommuicatios System (UMTS); Spreadig ad modulatio (FDD) (3G TS 3.13 versio 3.1.1 Release 1999) (3G TS 3.13 versio 3.1.1 Release 1999)

More information

BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION

BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION IN MULTICAST NETWORKS Jordi Ros, Wei K. Tsai ad Mahadeve Iyer Departmet of Electrical ad Computer Egieerig Uiversity of Califoria, Irvie, CA 92697 {jros,

More information

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code Proceedigs of the 4th WSEAS It. Coferece o Electromagetics, Wireless ad Optical Commuicatios, Veice, Italy, November 0-, 006 107 A New Space-Repetitio Code Based o Oe Bit Feedback Compared to Alamouti

More information

ELEC 204 Digital Systems Design

ELEC 204 Digital Systems Design Fall 2013, Koç Uiversity ELEC 204 Digital Systems Desig Egi Erzi College of Egieerig Koç Uiversity,Istabul,Turkey eerzi@ku.edu.tr KU College of Egieerig Elec 204: Digital Systems Desig 1 Today: Datapaths

More information

lecture notes September 2, Sequential Choice

lecture notes September 2, Sequential Choice 18.310 lecture otes September 2, 2013 Sequetial Choice Lecturer: Michel Goemas 1 A game Cosider the followig game. I have 100 blak cards. I write dow 100 differet umbers o the cards; I ca choose ay umbers

More information

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing 206 3 rd Iteratioal Coferece o Mechaical, Idustrial, ad Maufacturig Egieerig (MIME 206) ISBN: 978--60595-33-7 Applicatio of Improved Geetic Algorithm to Two-side Assembly Lie Balacig Ximi Zhag, Qia Wag,

More information

ETSI TS V3.4.0 ( )

ETSI TS V3.4.0 ( ) TS 15 13 V3.4.0 (000-1) Techical Specificatio Uiversal Mobile Telecommuicatios System (UMTS); Spreadig ad modulatio (FDD) (3GPP TS 5.13 versio 3.4.0 Release 1999) 1 TS 15 13 V3.4.0 (000-1) Referece RTS/TSGR-01513UR3

More information

OPTIMIZATION OF RNS FIR FILTERS FOR 6-INPUTS LUT BASED FPGAS

OPTIMIZATION OF RNS FIR FILTERS FOR 6-INPUTS LUT BASED FPGAS OPTIMIZATION OF RNS FIR FILTERS FOR 6-INPUTS LUT BASED FPGAS G.C. Cardarilli, M. Re, A. Salsao Uiversity of Rome Tor Vergata Departmet of Electroic Egieerig Via del Politecico 1 / 00133 / Rome / ITAL {marco.re,

More information

(2) The MOSFET. Review of. Learning Outcome. (Metal-Oxide-Semiconductor Field Effect Transistor) 2.0) Field Effect Transistor (FET)

(2) The MOSFET. Review of. Learning Outcome. (Metal-Oxide-Semiconductor Field Effect Transistor) 2.0) Field Effect Transistor (FET) EEEB73 Electroics Aalysis & esig II () Review of The MOSFET (Metal-Oxide-Semicoductor Field Effect Trasistor) Referece: Neame, Chapter 3 ad Chapter 4 Learig Outcome Able to describe ad use the followig:

More information

202 Chapter 9 n Go Bot. Hint

202 Chapter 9 n Go Bot. Hint Chapter 9 Go Bot Now it s time to put everythig you have leared so far i this book to good use. I this chapter you will lear how to create your first robotic project, the Go Bot, a four-wheeled robot.

More information

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home COMBINATORICS BEGINNER CIRCLE 1/0/013 1. ADVANCE TAXICABS Recall, i the previous lesso, we looked at Taxicabs machies, which always took the shortest path home taxipath We couted the umber of ways that

More information

Intermediate Information Structures

Intermediate Information Structures Modified from Maria s lectures CPSC 335 Itermediate Iformatio Structures LECTURE 11 Compressio ad Huffma Codig Jo Roke Computer Sciece Uiversity of Calgary Caada Lecture Overview Codes ad Optimal Codes

More information

Density Slicing Reference Manual

Density Slicing Reference Manual Desity Slicig Referece Maual Improvisio, Viscout Cetre II, Uiversity of Warwick Sciece Park, Millbur Hill Road, Covetry. CV4 7HS Tel: 0044 (0) 24 7669 2229 Fax: 0044 (0) 24 7669 0091 e-mail: admi@improvisio.com

More information

PHY-MAC dialogue with Multi-Packet Reception

PHY-MAC dialogue with Multi-Packet Reception PHY-AC dialogue with ulti-packet Receptio arc Realp 1 ad Aa I. Pérez-Neira 1 CTTC-Cetre Tecològic de Telecomuicacios de Cataluya Edifici Nexus C/Gra Capità, - 0803-Barceloa (Cataluya-Spai) marc.realp@cttc.es

More information

Propositional Proofs in Frege and Extended Frege Systems (Abstract)

Propositional Proofs in Frege and Extended Frege Systems (Abstract) Propositioal Proofs i Frege ad Exteded Frege Systems (Abstract) Sam Buss Departmet of Mathematics Uiversity of Califoria, Sa Diego La Jolla, Califoria 92130-0112, USA sbuss@math.ucsd.edu http://math.ucsd.edu/~sbuss

More information

3GPP TS V8.0.0 ( )

3GPP TS V8.0.0 ( ) TS 25.213 V8.0.0 (2008-03) Techical Specificatio 3rd Geeratio Partership Project; Techical Specificatio Group Radio Access Network; Spreadig ad modulatio (FDD) (Release 8) The preset documet has bee developed

More information

ETSI TS V ( )

ETSI TS V ( ) TS 38 V5.. (8-7 TECHICAL SPECIFICATIO 5G; R; Physical chaels ad modulatio (3GPP TS 38. versio 5.. Release 5 3GPP TS 38. versio 5.. Release 5 TS 38 V5.. (8-7 Referece DTS/TSGR-38vf Keywords 5G 65 Route

More information

Design of FPGA- Based SPWM Single Phase Full-Bridge Inverter

Design of FPGA- Based SPWM Single Phase Full-Bridge Inverter Desig of FPGA- Based SPWM Sigle Phase Full-Bridge Iverter Afarulrazi Abu Bakar 1, *,Md Zarafi Ahmad 1 ad Farrah Salwai Abdullah 1 1 Faculty of Electrical ad Electroic Egieerig, UTHM *Email:afarul@uthm.edu.my

More information

Chapter 3 Digital Logic Structures

Chapter 3 Digital Logic Structures Copyright The McGraw-HillCompaies, Ic. Permissio required for reproductio or display. Computig Layers Chapter 3 Digital Logic Structures Problems Algorithms Laguage Istructio Set Architecture Microarchitecture

More information

ETSI TS V ( )

ETSI TS V ( ) TS 38 V5.3. (8-) TECHICAL SPECIFICATIO 5G; R; Physical chaels ad modulatio (3GPP TS 38. versio 5.3. Release 5) 3GPP TS 38. versio 5.3. Release 5 TS 38 V5.3. (8-) Referece RTS/TSGR-38vf3 Keywords 5G 65

More information

Computational Algorithm for Higher Order Legendre Polynomial and Gaussian Quadrature Method

Computational Algorithm for Higher Order Legendre Polynomial and Gaussian Quadrature Method Computatioal Algorithm for Higher Order Legre olyomial ad Gaussia Quadrature Method Asif M. Mughal, Xiu Ye ad Kamra Iqbal Dept. of Applied Sciece, Dept. of Mathematics ad Statistics, Dept. of Systems Egieerig

More information

Design of Optimal Hygrothermally Stable Laminates with Extension-Twist Coupling by Ant Colony Optimization

Design of Optimal Hygrothermally Stable Laminates with Extension-Twist Coupling by Ant Colony Optimization d Iteratioal Coferece o Egieerig Optimizatio September 6-9, 010, Lisbo, Portugal esig of Optimal Hygrothermally Stable Lamiates with Extesio-Twist Couplig by t Coloy Optimizatio ditya P. pte 1, Robert.

More information

A Math Learning Center publication adapted and arranged by. EUGENE MAIER and LARRY LINNEN

A Math Learning Center publication adapted and arranged by. EUGENE MAIER and LARRY LINNEN A Math Learig Ceter publicatio adapted ad arraged by EUGENE MAIER ad LARRY LINNEN ALGEBRA THROUGH VISUAL PATTERNS, VOLUME 1 A Math Learig Ceter Resource Copyright 2005, 2004 by The Math Learig Ceter, PO

More information

Cross-Layer Performance of a Distributed Real-Time MAC Protocol Supporting Variable Bit Rate Multiclass Services in WPANs

Cross-Layer Performance of a Distributed Real-Time MAC Protocol Supporting Variable Bit Rate Multiclass Services in WPANs Cross-Layer Performace of a Distributed Real-Time MAC Protocol Supportig Variable Bit Rate Multiclass Services i WPANs David Tug Chog Wog, Jo W. Ma, ad ee Chaig Chua 3 Istitute for Ifocomm Research, Heg

More information

Compression Programs. Compression Outline. Multimedia. Lossless vs. Lossy. Encoding/Decoding. Analysis of Algorithms

Compression Programs. Compression Outline. Multimedia. Lossless vs. Lossy. Encoding/Decoding. Analysis of Algorithms Aalysis of Algorithms Compressio Programs File Compressio: Gzip, Bzip Archivers :Arc, Pkzip, Wirar, File Systems: NTFS Piyush Kumar (Lecture 5: Compressio) Welcome to 453 Source: Guy E. Blelloch, Emad,

More information

Massachusetts Institute of Technology Dept. of Electrical Engineering and Computer Science Fall Semester, Introduction to EECS 2.

Massachusetts Institute of Technology Dept. of Electrical Engineering and Computer Science Fall Semester, Introduction to EECS 2. Massachusetts Istitute of Techology Dept. of Electrical Egieerig ad Computer Sciece Fall Semester, 006 6.08 Itroductio to EECS Prelab Exercises Pre-Lab#3 Modulatio, demodulatio, ad filterig are itegral

More information

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS APPLICATION NOTE AN95091 INTRODUCTION UNDERSTANDING EFFECTIVE BITS Toy Girard, Sigatec, Desig ad Applicatios Egieer Oe criteria ofte used to evaluate a Aalog to Digital Coverter (ADC) or data acquisitio

More information

Circular waveguides. Introduction. Table of Contents

Circular waveguides. Introduction. Table of Contents Itroductio Circular waveguides Waveguides ca be simply described as metal pipes. Depedig o their cross sectio there are rectagular waveguides (described i separate tutorial) ad circular waveguides, which

More information

ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS

ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS Chapter ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West

More information

The Institute of Chartered Accountants of Sri Lanka

The Institute of Chartered Accountants of Sri Lanka The Istitute of Chartered Accoutats of Sri Laka Postgraduate Diploma i Busiess ad Fiace Quatitative Techiques for Busiess Hadout 02:Presetatio ad Aalysis of data Presetatio of Data The Stem ad Leaf Display

More information

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS A SELETIVE POINTE FOWADING STATEGY FO LOATION TAKING IN PESONAL OUNIATION SYSTES Seo G. hag ad hae Y. Lee Departmet of Idustrial Egieerig, KAIST 373-, Kusug-Dog, Taejo, Korea, 305-70 cylee@heuristic.kaist.ac.kr

More information

Insertion/Deletion Correction with Spectral Nulls

Insertion/Deletion Correction with Spectral Nulls 7 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 43, NO., MARCH 1997 Isertio/Deletio Correctio with Spectral Nulls H. C. Ferreira, Member, IEEE, W. A. Clarke, A. S. J. Helberg, K. A. S. Abdel-Ghaffar, ad

More information

COMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS

COMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS COMPRESSION OF TRANSMULTIPLEXED ACOUSTIC SIGNALS Mariusz Ziółko, Przemysław Sypka ad Bartosz Ziółko Departmet of Electroics, AGH Uiversity of Sciece ad Techology, al. Mickiewicza 3, 3-59 Kraków, Polad,

More information

LINEAR-PHASE FIR FILTERS: THE WINDOWING METHOD

LINEAR-PHASE FIR FILTERS: THE WINDOWING METHOD LINEAR-PHASE FIR FILTERS: THE WINDOWING ETHOD Prof. Siripog Potisuk FIR Filter Characteristics Completely specified by iput-output relatio: y[ ] b k0 x[ k] b k = filter coefficiets ad +1 = filter legth

More information

Extra Practice 1. Name Date. Lesson 1.1: Patterns in Division

Extra Practice 1. Name Date. Lesson 1.1: Patterns in Division Master 1.22 Extra Practice 1 Lesso 1.1: Patters i Divisio 1. Which umbers are divisible by 4? By 5? How do you kow? a) 90 b) 134 c) 395 d) 1724 e) 30 f) 560 g) 3015 h) 74 i) 748 2. Write a 5-digit umber

More information

4. INTERSYMBOL INTERFERENCE

4. INTERSYMBOL INTERFERENCE DATA COMMUNICATIONS 59 4. INTERSYMBOL INTERFERENCE 4.1 OBJECT The effects of restricted badwidth i basebad data trasmissio will be studied. Measuremets relative to itersymbol iterferece, usig the eye patter

More information

The 99th Fibonacci Identity

The 99th Fibonacci Identity The 99th Fibonacci Identity Arthur T. Benjamin, Alex K. Eustis, and Sean S. Plott Department of Mathematics Harvey Mudd College, Claremont, CA, USA benjamin@hmc.edu Submitted: Feb 7, 2007; Accepted: Jan

More information

LX 422/722 Intermediate Syntax KEY (with notes) SPRING 2018 FINAL 38 points total; 22 for #1, 2 for #2, 7 for #3, 1 for #4, 6 for #5

LX 422/722 Intermediate Syntax KEY (with notes) SPRING 2018 FINAL 38 points total; 22 for #1, 2 for #2, 7 for #3, 1 for #4, 6 for #5 LX 422/722 Itermediate Sytax KEY (with otes) SPRIG 2018 FIAL 38 poits total; 22 for #1, 2 for #2, 7 for #3, 1 for #4, 6 for #5 SEEES FOR PROBLEM #1 (i) (ii) (iii) Pat seems to kow who will wi. Pat s fried

More information

DIGITALLY TUNED SINUSOIDAL OSCILLATOR USING MULTIPLE- OUTPUT CURRENT OPERATIONAL AMPLIFIER FOR APPLICATIONS IN HIGH STABLE ACOUSTICAL GENERATORS

DIGITALLY TUNED SINUSOIDAL OSCILLATOR USING MULTIPLE- OUTPUT CURRENT OPERATIONAL AMPLIFIER FOR APPLICATIONS IN HIGH STABLE ACOUSTICAL GENERATORS Molecular ad Quatum Acoustics vol. 7, (6) 95 DGTALL TUNED SNUSODAL OSCLLATOR USNG MULTPLE- OUTPUT CURRENT OPERATONAL AMPLFER FOR APPLCATONS N HGH STABLE ACOUSTCAL GENERATORS Lesław TOPÓR-KAMŃSK Faculty

More information

Combinatorics and probability

Combinatorics and probability Departmet of Mathematics Ma 3/03 KC Border Itroductio to Probability ad Statistics Witer 208 Lecture 3: Combiatorics ad probability Relevat textboo passages: Pitma [2]: Sectios.5.6, pp. 7 77; Appedix,

More information

The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks

The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks The Fudametal Capacity-Delay Tradeoff i Large Mobile Ad Hoc Networks Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West Lafayette, IN 47907, U.S.A. {lix, shroff}@ec.purdue.edu

More information

Multisensor transducer based on a parallel fiber optic digital-to-analog converter

Multisensor transducer based on a parallel fiber optic digital-to-analog converter V Iteratioal Forum for Youg cietists "pace Egieerig" Multisesor trasducer based o a parallel fiber optic digital-to-aalog coverter Vladimir Grechishikov 1, Olga Teryaeva 1,*, ad Vyacheslav Aiev 1 1 amara

More information

Chapter 2: Probability

Chapter 2: Probability hapter : roaility A {FF}, B {MM}, {MF, FM, MM} The, A B 0/, B {MM}, B {MF, FM}, A B {FF,MM}, A, B a A B A B c A B d A B A B 4 a 8 hapter : roaility 9 5 a A B A B A B B A A B A B B A B B B A A c A B A B

More information

CP 405/EC 422 MODEL TEST PAPER - 1 PULSE & DIGITAL CIRCUITS. Time: Three Hours Maximum Marks: 100

CP 405/EC 422 MODEL TEST PAPER - 1 PULSE & DIGITAL CIRCUITS. Time: Three Hours Maximum Marks: 100 PULSE & DIGITAL CIRCUITS Time: Three Hours Maximum Marks: 0 Aswer five questios, takig ANY TWO from Group A, ay two from Group B ad all from Group C. All parts of a questio (a, b, etc. ) should be aswered

More information

ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering

ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering ADSP ADSP ADSP ADSP Advaced Digital Sigal Processig (8-79) Sprig Fall Semester, 7 Departmet of Electrical ad Computer Egieerig OTES O RADOM PROCESSES I. Itroductio Radom processes are at the heart of most

More information