Graph Theory. Dr. Saad El-Zanati, Faculty Mentor Ryan Bunge Graduate Assistant Illinois State University REU. Graph Theory
|
|
- Douglas Park
- 5 years ago
- Views:
Transcription
1 Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Grph Theory Dniel Gibson, Concordi University Jckelyn Ngel, Dominicn University Benjmin Stnley, New Mexico Stte University Allison Zle, Illinois Stte University Dr. Sd El-Znti, Fculty Mentor Ryn Bunge Grdute Assistnt 2012 Illinois Stte University REU
2 Friendship Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion There is group of six people nd not everyone is friends with everyone else. Friends Adm: Ben, Cindy Ben: Adm, Cindy Cindy: Adm, Ben, Dve, Edwrd, Frnk Dve: Cindy Edwrd: Cindy, Frnk Frnk, Cindy, Edwrd How would you drw something to depict these friendships?
3 Friendship Grph Theory Gibson, Ngel, Stnley, Zle This is one wy tht these reltionships cn be digrmmed. Specil Types of Bckground Motivtion Friends F A A: B, C B: A, C C: A, B, D, E, F D: C E: C, F F: C, E E B D C
4 Wht is Grph? Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Grph A grph G is n ordered pir (V (G), E(G)), where V (G) is nonempty finite set nd E(G) is set of 2-element subsets of V (G). Vertex nd Edge Sets V (G) is clled the vertex-set of G. The elements or things in V (G) re the vertices of G. V (G) (number of vertices in grph G) is clled the order of G. E(G) is clled the edge-set of G. The elements of things in E(G) re the edges of G. E(G) (number of edges in grph G) is clled the size of G.
5 An Exmple Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion An exmple of Grph of Order 5 nd Size 6: G = ({0, 1, 2, 3, 4}, {{0, 1}, {0, 2}, {0, 3}, {1, 2}, {1, 3}, {2, 4}, {3, 4}})
6 An Exmple Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion An exmple of Grph of Order 5 nd Size 6: G = ({0, 1, 2, 3, 4}, {{0, 1}, {0, 2}, {0, 3}, {1, 2}, {1, 3}, {2, 4}, {3, 4}}) This is drwing of G:
7 More Terminology Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Definitions A vertex is incident with n edge if the edge is connected to tht edge nd vice vers. A vertex is djcent with nother vertex if they re both incident with the sme edge. An edge is djcent with nother edge if both edges re incident with the sme vertex. Coloring We often tlk bout coloring grph s vertices. Coloring is ssigning color to vertex, nd we usully do this to group the vertices into subsets. To properly color grph, no two djcent vertices re ssigned the sme color.
8 Biprtite Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Definition A grph G is biprtite if V (G) cn be colored properly so tht no two connected edges re the sme color with minimum of two colors, sy red nd blck. Therefore, every edge hs one red end-vertex nd one blck end-vertex
9 n-regulr Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Regulr The degree of vertex is the number of edges tht re connected to tht vertex, nd is denoted by deg(v). A grph G is regulr if every vertex of G hs the sme degree. If deg(v) = n for every vertex v in V (G), then G is clled n-regulr. This exmple is 3-regulr becuse the degree of ech vertex is 3.
10 Complete Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Complete A grph is complete grph if every vertex is djcent to every other vertex. In other words, there is n edge between every vertex. A complete grph with n vertices (nd n edges) is denoted K n. Complete Biprtite A complete biprtite grph with m nd n vertices in ech of the vertex subsets respectively is denoted K m,n nd hs m n edges. In K m,n, ech vertex in the bottom set is djcent to every vertex in the top set, but not djcent to ny vertices within the bottom vertex set.
11 Cycles Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Definition A cycle is connected 2-regulr grph. A cycle is determined by the number of vertices. For exmple, cycle with 8 vertices is clled n 8-Cycle or C 8. Observtions All cycles of the sme size re isomorphic (Tht is, structurlly the sme). All cycles with size multiple of two re biprtite. Exmple:
12 Trees Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Definition A tree is grph tht does not contin ny cycles. Types of Trees A pth is tree whose vertices except for two hve degree two nd those two exclusions hve degree one. A cterpillr is tree which if you chop off ll of its legs is pth. A lobster is tree which if you chop off ll of it s legs is cterpillr. A str is tree with one vertex which is djcent with every other vertex Theorem All trees re biprtite. (Skien, 1990)
13 Pths Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion
14 Cterpillrs Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion
15 Lobsters Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion
16 Strs Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion
17 Grph Lbelings Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Lbeling Let G be grph with n edges. A lbeling of G is one-to-one function from V (G) to the set of nonnegtive integers. In other words, lbeling of G is ssigning number to ech vertex. Lbeling llows us to discuss edge length. This is n exmple of lbeled grph G: Here is G plced inside K 5 :
18 Length of n edge in K n Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Definition Let V (K n ) = Z n nd plce the vertices of K n round n n-gon. The lbel of n edge {i, j} is i j. The length of {i, j} is the shortest distnce from i to j round the polygon: length({i, j}) =min({ i j, n i j }). Edge {i, j, } is wrp-round edge (denoted with *) if its length is not equl to its lbel * 4 0 3*
19 Length of n edge in K n Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Note The number of edges of length i is dependent on n If n = 2t + 1, then K n consists of n edges of length i for ech i {1, 2,..., t}. In n = 2t, then K n consists of n edges of length i for ech i {1, 2,..., t 1} nd t edges of length t (these form 1-fctor in K 2t
20 Length of n edge in K n,n Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Let V (K n,n ) = (Z n {0}) (Z n {1}). Denote edge {(i, 0), (j, 1)} in K n,n by (i, j). The length of edge (i, j) is j i if j i nd n + j i, otherwise. Note tht E(K n,n ) consists of n edges of length i for 0 i n
21 Length of n edge in K n,n Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Let V (K n,n ) = (Z n {0}) (Z n {1}). Denote edge {(i, 0), (j, 1)} in K n,n by (i, j). The length of edge (i, j) is j i if j i nd n + j i, otherwise. Note tht E(K n,n ) consists of n edges of length i for 0 i n * 4*
22 Grph Decomposition nd Designs Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion G-decomposition Let G nd H be grphs (or multigrphs) with G subgrph of H. A G-decomposition of H is prtition of the edge set of H into subgrphs isomorphic to G (clled G-blocks). (H, G)-design A G-decomposition of H is lso clled n (H, G)-design. This is n exmple of G-decomposition where H is K 4 nd G is P 4 (G is shown below):
23 Cyclic Decompositions nd Clicking Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n ) = Z n, nd let G be subgrph of K n. By clicking G, we men pplying the isomorphism i i + 1 to V (G) Cyclic Decompositions A G-decomposition of K n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic K 3 decomposition of K 7 where V (K 7 ) = {0, 1,..., 6}: (0, 1, 3)
24 Cyclic Decompositions nd Clicking Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n ) = Z n, nd let G be subgrph of K n. By clicking G, we men pplying the isomorphism i i + 1 to V (G) Cyclic Decompositions A G-decomposition of K n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic K 3 decomposition of K 7 where V (K 7 ) = {0, 1,..., 6}: (0, 1, 3) (1, 2, 4)
25 Cyclic Decompositions nd Clicking Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n ) = Z n, nd let G be subgrph of K n. By clicking G, we men pplying the isomorphism i i + 1 to V (G) Cyclic Decompositions A G-decomposition of K n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic K 3 decomposition of K 7 where V (K 7 ) = {0, 1,..., 6}: (0, 1, 3) (1, 2, 4) (2, 3, 5)
26 Cyclic Decompositions nd Clicking Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n ) = Z n, nd let G be subgrph of K n. By clicking G, we men pplying the isomorphism i i + 1 to V (G) Cyclic Decompositions A G-decomposition of K n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic K 3 decomposition of K 7 where V (K 7 ) = {0, 1,..., 6}: (0, 1, 3) (1, 2, 4) (2, 3, 5) (3, 4, 6)
27 Cyclic Decompositions nd Clicking Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n ) = Z n, nd let G be subgrph of K n. By clicking G, we men pplying the isomorphism i i + 1 to V (G) Cyclic Decompositions A G-decomposition of K n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic K 3 decomposition of K 7 where V (K 7 ) = {0, 1,..., 6}: (0, 1, 3) (1, 2, 4) (2, 3, 5) (3, 4, 6) (4, 5, 0)
28 Cyclic Decompositions nd Clicking Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n ) = Z n, nd let G be subgrph of K n. By clicking G, we men pplying the isomorphism i i + 1 to V (G) Cyclic Decompositions A G-decomposition of K n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic K 3 decomposition of K 7 where V (K 7 ) = {0, 1,..., 6}: (0, 1, 3) (1, 2, 4) (2, 3, 5) (3, 4, 6) (4, 5, 0) (5, 6, 1)
29 Cyclic Decompositions nd Clicking Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n ) = Z n, nd let G be subgrph of K n. By clicking G, we men pplying the isomorphism i i + 1 to V (G) Cyclic Decompositions A G-decomposition of K n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic K 3 decomposition of K 7 where V (K 7 ) = {0, 1,..., 6}: (0, 1, 3) (1, 2, 4) (2, 3, 5) (3, 4, 6) (4, 5, 0) (5, 6, 1) (6, 0, 2)
30 Cyclic Decompositions in Complete Biprtite Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n,n ) = (Z n {0}) (Z n {1}). By clicking G, we men pplying the isomorphism (i, j) (i + 1, j) to V (G) Cyclic Decompositions A G-decomposition of K n,n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic S 5 decomposition of K 5,
31 Cyclic Decompositions in Complete Biprtite Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n,n ) = (Z n {0}) (Z n {1}). By clicking G, we men pplying the isomorphism (i, j) (i + 1, j) to V (G) Cyclic Decompositions A G-decomposition of K n,n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic S 5 decomposition of K 5,
32 Cyclic Decompositions in Complete Biprtite Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n,n ) = (Z n {0}) (Z n {1}). By clicking G, we men pplying the isomorphism (i, j) (i + 1, j) to V (G) Cyclic Decompositions A G-decomposition of K n,n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic S 5 decomposition of K 5,
33 Cyclic Decompositions in Complete Biprtite Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n,n ) = (Z n {0}) (Z n {1}). By clicking G, we men pplying the isomorphism (i, j) (i + 1, j) to V (G) Cyclic Decompositions A G-decomposition of K n,n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic S 5 decomposition of K 5,
34 Cyclic Decompositions in Complete Biprtite Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Clicking Let V (K n,n ) = (Z n {0}) (Z n {1}). By clicking G, we men pplying the isomorphism (i, j) (i + 1, j) to V (G) Cyclic Decompositions A G-decomposition of K n,n is cyclic if clicking G preserves the G-blocks of the decomposition. A cyclic S 5 decomposition of K 5,
35 Ros s Originl Lbelings for grph G with n edges Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion ρ-lbeling Vertex lbels from {0, 1,..., 2n}; one edge of ech length. There exists cyclic (K 2n+1, G)-design if nd only if G hs ρ-lbeling.
36 Ros s Originl Lbelings for grph G with n edges Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion ρ-lbeling Vertex lbels from {0, 1,..., 2n}; one edge of ech length. There exists cyclic (K 2n+1, G)-design if nd only if G hs ρ-lbeling. σ-lbeling No wrp-rounds. Also, cyclic (K 2n+2 F, G)-designs
37 Ros s Originl Lbelings for grph G with n edges Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion ρ-lbeling Vertex lbels from {0, 1,..., 2n}; one edge of ech length. There exists cyclic (K 2n+1, G)-design if nd only if G hs ρ-lbeling. σ-lbeling No wrp-rounds. Also, cyclic (K 2n+2 F, G)-designs β-lbeling.k.. grceful. Vertex lbels from {0, 1,..., n}.
38 Ros s Originl Lbelings for grph G with n edges Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion ρ-lbeling Vertex lbels from {0, 1,..., 2n}; one edge of ech length. There exists cyclic (K 2n+1, G)-design if nd only if G hs ρ-lbeling. σ-lbeling No wrp-rounds. Also, cyclic (K 2n+2 F, G)-designs β-lbeling.k.. grceful. Vertex lbels from {0, 1,..., n}. α-lbeling G must be biprtite. All vertex lbels from one prt in the vertex prtition must be less thn those of the other prt.
39 α-lbelings Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Theorems Every cycle with size tht is multiple of 4 hs n α-lbeling. Every pth, cterpillr, nd lobster hs n α-lbeling. Conjecture The union of two cycles with size tht is 2 more thn multiple of 4 hs n α-lbeling. α-lbelings, lthough very restrictive re very useful. One of their better pplictions is they llow for something clled stretching. We denote the lrgest number in the top prtition of n α-lbeling with the Greek letter λ.
40 Exmples of Alph Lbelings Grph Theory 0 Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion
41 Exmples of Alph Lbelings Grph Theory 0 Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion λ =
42 Exmples of Alph Lbelings Grph Theory 0 Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion λ = 0 λ =
43 Exmples of Alph Lbelings Grph Theory 0 Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion λ = 0 λ = λ =
44 Exmples of Alph Lbelings Grph Theory 0 Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion λ = 0 λ = λ = λ =
45 Stretching Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion You cn use n α-lbeling s templte in order to not just decompose K 2n+1, but lso K 2nx+1 where x is ny nturl number. Definition In other words, stretching n α-lbeling llows for G-Block to decompose n infinite number of grphs. We cll this process stretching, becuse you simply stretch the edge lengths by the size of the originl grph. Exmple:
46 Stretching Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion You cn use n α-lbeling s templte in order to not just decompose K 2n+1, but lso K 2nx+1 where x is ny nturl number. Definition In other words, stretching n α-lbeling llows for G-Block to decompose n infinite number of grphs. We cll this process stretching, becuse you simply stretch the edge lengths by the size of the originl grph. Exmple:
47 Questions Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion We know tht there is n α-lbeling of the union of ny two cycles with size 4r where r is nturl number. Gee, I wonder... Is there n α-lbeling of ny two cycles with size 4s + 2 where s is nturl number? Is there n α-lbeling of the union of ny number of cycles with size 4r where r is nturl number? Cn you tke the union of multiple clssifictions of grphs with α-lbelings to generte lbeling tht will decompose complete biprtite grph?
48 Answer Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion YES!
49 Theorem Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Let G i be biprtite grph with size m i, α-lbeling f i, criticl vlue λ i, nd vertex biprtition {A i, B i } for ll i such tht 1 i n. Also, let G = G 1 G 2 G n. There exists lbeling of G such tht G cycliclly decomposes K m+1,m+1 F where F is 1-fctor of K m+1,m+1.
50 Arrngement of G i Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion If n is even Let n = 2t for some positive integer, t. Without loss of generlity we cn ssume λ 1 λ t+1 λ 2 λ t+2 λ t λ 2t.
51 Arrngement of G i Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion If n is even Let n = 2t for some positive integer, t. Without loss of generlity we cn ssume λ 1 λ t+1 λ 2 λ t+2 λ t λ 2t. If n is odd Let n = 2t 1 for some positive integer, t. Without loss of generlity we cn ssume λ 1 λ t+1 λ 2 λ t+2 λ t 1 λ 2t 1 λ t.
52 Exmple when n is even Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion For G i such tht 1 i t f i (v) = f i (v) + i 1 (λ j + 1), v B i j=1 f i (v) + i 1 (λ j + 1) + m i 1 (m j + m 2t j+1 ) m i, v A i j=1 j=
53 Exmple when n is even Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion For G i such tht t + 1 i 2t f i (v) = f i (v) + i 1 (λ j + 1), v A i j=t+1 f i (v) + i 1 (λ j + 1) + m i 1 (m j + m 2t j+1 ) m i, v B i j=t+1 j=t
54 Exmple when n is even Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion 1* * 3* 4* 5* 7* 8* 9* 10* 6* 11* 12* 14* 15* 16* 17*
55 Exmple when n is odd Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion For G i such tht 1 i t f i (v) + i 1 (λ j + 1), v B i f i (v) = j=1 f i (v) + i 1 (λ j + 1) + m i 1 (m j + m 2t j ) m i, v A i j=1 j=
56 Exmple when n is odd Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion For G i such tht t + 1 i 2t 1 f i (v) + i 1 (λ j + 1), v A i f i (v) = j=t+1 f i (v) + i 1 (λ j + 1) + m i (m j + m 2t j+1 ), v B i j=t+1 j=t
57 Exmple when n is odd Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion * 24 3* 5* 8* 29* * * 12* 28* 31* * 17* 15 4* 6* 9* 11* 18* 19* 30*
58 Corollries Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion Corollry 1 Since we re ble to do this with ny number of grphs tht dmit n α-lbeling, then we cn produce lbeling tht decomposes complete biprtite grph using the union of ny two cycles whose sizes re congruent to 0 (mod 4). Corollry 2 Our lbeling, lthough it is bsed on α-lbelings, is not n α-lbeling itself. However, it does llow for stretching. Therefore, we cn use G-Block to decompose ny K mx+1,mx+1 complete biprtite grph; where m is the size of the G-Block, nd x is ny nturl number.
59 Grph Theory Gibson, Ngel, Stnley, Zle Specil Types of Bckground Motivtion THANK YOU!
Zero-Sum Magic Graphs and Their Null Sets
Zero-Sum Mgic Grphs nd Their Null Sets Ebrhim Slehi Deprtment of Mthemticl Sciences University of Nevd Ls Vegs Ls Vegs, NV 89154-4020. ebrhim.slehi@unlv.edu Abstrct For ny h N, grph G = (V, E) is sid to
More informationLecture 3 ( ) (translated and slightly adapted from lecture notes by Martin Klazar)
Lecture 3 (5.3.2018) (trnslted nd slightly dpted from lecture notes by Mrtin Klzr) Riemnn integrl Now we define precisely the concept of the re, in prticulr, the re of figure U(, b, f) under the grph of
More informationStrong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation
Strong Bisimultion Overview Actions Lbeled trnsition system Trnsition semntics Simultion Bisimultion References Robin Milner, Communiction nd Concurrency Robin Milner, Communicting nd Mobil Systems 32
More informationRead section 3.3, 3.4 Announcements:
Dte: 3/1/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: 1. f x = 3x 6, find the inverse, f 1 x., Using your grphing clcultor, Grph 1. f x,f
More information4 7x =250; 5 3x =500; Read section 3.3, 3.4 Announcements: Bell Ringer: Use your calculator to solve
Dte: 3/14/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: Use your clcultor to solve 4 7x =250; 5 3x =500; HW Requests: Properties of Log Equtions
More informationIntroduction to Group Theory
Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationHarvard University Computer Science 121 Midterm October 23, 2012
Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is
More informationapproaches as n becomes larger and larger. Since e > 1, the graph of the natural exponential function is as below
. Eponentil nd rithmic functions.1 Eponentil Functions A function of the form f() =, > 0, 1 is clled n eponentil function. Its domin is the set of ll rel f ( 1) numbers. For n eponentil function f we hve.
More informationIs there an easy way to find examples of such triples? Why yes! Just look at an ordinary multiplication table to find them!
PUSHING PYTHAGORAS 009 Jmes Tnton A triple of integers ( bc,, ) is clled Pythgoren triple if exmple, some clssic triples re ( 3,4,5 ), ( 5,1,13 ), ( ) fond of ( 0,1,9 ) nd ( 119,10,169 ). + b = c. For
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More informationc n φ n (x), 0 < x < L, (1) n=1
SECTION : Fourier Series. MATH4. In section 4, we will study method clled Seprtion of Vribles for finding exct solutions to certin clss of prtil differentil equtions (PDEs. To do this, it will be necessry
More informationAndrew Ryba Math Intel Research Final Paper 6/7/09 (revision 6/17/09)
Andrew Ryb Mth ntel Reserch Finl Pper 6/7/09 (revision 6/17/09) Euler's formul tells us tht for every tringle, the squre of the distnce between its circumcenter nd incenter is R 2-2rR, where R is the circumrdius
More informationOn super edge-magic total labeling of banana trees
On super edge-mgic totl lbeling of bnn trees M. Hussin 1, E. T. Bskoro 2, Slmin 3 1 School of Mthemticl Sciences, GC University, 68-B New Muslim Town, Lhore, Pkistn mhmths@yhoo.com 2 Combintoril Mthemtics
More informationDefinite integral. Mathematics FRDIS MENDELU
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová Brno 1 Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function defined on [, b]. Wht is the re of the
More informationMORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)
MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
More informationImproper Integrals, and Differential Equations
Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationLesson 1: Quadratic Equations
Lesson 1: Qudrtic Equtions Qudrtic Eqution: The qudrtic eqution in form is. In this section, we will review 4 methods of qudrtic equtions, nd when it is most to use ech method. 1. 3.. 4. Method 1: Fctoring
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More informationLogarithms. Logarithm is another word for an index or power. POWER. 2 is the power to which the base 10 must be raised to give 100.
Logrithms. Logrithm is nother word for n inde or power. THIS IS A POWER STATEMENT BASE POWER FOR EXAMPLE : We lred know tht; = NUMBER 10² = 100 This is the POWER Sttement OR 2 is the power to which the
More informationAutomata and Languages
Automt nd Lnguges Prof. Mohmed Hmd Softwre Engineering Lb. The University of Aizu Jpn Grmmr Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Regulr Lnguges Context Free Lnguges Context Sensitive
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More
More information42 RICHARD M. LOW AND SIN-MIN LEE grphs nd Z k mgic grphs were investigted in [4,7,8,1]. The construction of mgic grphs ws studied by Sun nd Lee [18].
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 34 (26), Pges 41 48 On the products of group-mgic grphs Richrd M. Low Λ Deprtment of Mthemtics Sn Jose Stte University Sn Jose, CA 95192 U.S.A. low@mth.sjsu.edu
More informationDefinite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30
Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová (Mendel University) Definite integrl MENDELU / Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function
More information7.2 The Definite Integral
7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where
More informationWe partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.
Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn
More informationFirst Midterm Examination
24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
More informationProblem Set 9. Figure 1: Diagram. This picture is a rough sketch of the 4 parabolas that give us the area that we need to find. The equations are:
(x + y ) = y + (x + y ) = x + Problem Set 9 Discussion: Nov., Nov. 8, Nov. (on probbility nd binomil coefficients) The nme fter the problem is the designted writer of the solution of tht problem. (No one
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University
More informationHandout: Natural deduction for first order logic
MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes
More informationSpanning tree congestion of some product graphs
Spnning tree congestion of some product grphs Hiu-Fi Lw Mthemticl Institute Oxford University 4-9 St Giles Oxford, OX1 3LB, United Kingdom e-mil: lwh@mths.ox.c.uk nd Mikhil I. Ostrovskii Deprtment of Mthemtics
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which
More informationSUMMER KNOWHOW STUDY AND LEARNING CENTRE
SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18
More information6.2 The Pythagorean Theorems
PythgorenTheorems20052006.nb 1 6.2 The Pythgoren Theorems One of the best known theorems in geometry (nd ll of mthemtics for tht mtter) is the Pythgoren Theorem. You hve probbly lredy worked with this
More informationChapter 1: Fundamentals
Chpter 1: Fundmentls 1.1 Rel Numbers Types of Rel Numbers: Nturl Numbers: {1, 2, 3,...}; These re the counting numbers. Integers: {... 3, 2, 1, 0, 1, 2, 3,...}; These re ll the nturl numbers, their negtives,
More informationAQA Further Pure 1. Complex Numbers. Section 1: Introduction to Complex Numbers. The number system
Complex Numbers Section 1: Introduction to Complex Numbers Notes nd Exmples These notes contin subsections on The number system Adding nd subtrcting complex numbers Multiplying complex numbers Complex
More informationNatural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring
More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationUSA Mathematical Talent Search Round 1 Solutions Year 21 Academic Year
1/1/21. Fill in the circles in the picture t right with the digits 1-8, one digit in ech circle with no digit repeted, so tht no two circles tht re connected by line segment contin consecutive digits.
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationTheory of Computation Regular Languages. (NTU EE) Regular Languages Fall / 38
Theory of Computtion Regulr Lnguges (NTU EE) Regulr Lnguges Fll 2017 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of Finite Automt A finite utomton hs finite set of control
More information5.2 Volumes: Disks and Washers
4 pplictions of definite integrls 5. Volumes: Disks nd Wshers In the previous section, we computed volumes of solids for which we could determine the re of cross-section or slice. In this section, we restrict
More informationMath Lecture 23
Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of
More informationDISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS
DISCRETE MATHEMATICS 21228 HOMEWORK 3 SOLUTIONS JC Due in clss Wednesdy September 17. You my collborte but must write up your solutions by yourself. Lte homework will not be ccepted. Homework must either
More informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationReview of Riemann Integral
1 Review of Riemnn Integrl In this chpter we review the definition of Riemnn integrl of bounded function f : [, b] R, nd point out its limittions so s to be convinced of the necessity of more generl integrl.
More informationAPPLICATIONS OF THE DEFINITE INTEGRAL
APPLICATIONS OF THE DEFINITE INTEGRAL. Volume: Slicing, disks nd wshers.. Volumes by Slicing. Suppose solid object hs boundries extending from x =, to x = b, nd tht its cross-section in plne pssing through
More informationNondeterminism. Nondeterministic Finite Automata. Example: Moves on a Chessboard. Nondeterminism (2) Example: Chessboard (2) Formal NFA
Nondeterminism Nondeterministic Finite Automt Nondeterminism Subset Construction A nondeterministic finite utomton hs the bility to be in severl sttes t once. Trnsitions from stte on n input symbol cn
More informationRegular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15
Regulr Lnguge Nonregulr Lnguges The Pumping Lemm Models of Comput=on Chpter 10 Recll, tht ny lnguge tht cn e descried y regulr expression is clled regulr lnguge In this lecture we will prove tht not ll
More informationAdvanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015
Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n
More information5.2 Exponent Properties Involving Quotients
5. Eponent Properties Involving Quotients Lerning Objectives Use the quotient of powers property. Use the power of quotient property. Simplify epressions involving quotient properties of eponents. Use
More informationTheory of Computation Regular Languages
Theory of Computtion Regulr Lnguges Bow-Yw Wng Acdemi Sinic Spring 2012 Bow-Yw Wng (Acdemi Sinic) Regulr Lnguges Spring 2012 1 / 38 Schemtic of Finite Automt control 0 0 1 0 1 1 1 0 Figure: Schemtic of
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationOn Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach
On Computing the Distinguishing Numbers of Plnr Grphs nd Beyond: Counting Approch V. Arvind The Institute of Mthemticl Sciences Chenni 600 113, Indi rvind@imsc.res.in Christine T. Cheng Deprtment of Electricl
More informationLecture 08: Feb. 08, 2019
4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
More informationBefore we can begin Ch. 3 on Radicals, we need to be familiar with perfect squares, cubes, etc. Try and do as many as you can without a calculator!!!
Nme: Algebr II Honors Pre-Chpter Homework Before we cn begin Ch on Rdicls, we need to be fmilir with perfect squres, cubes, etc Try nd do s mny s you cn without clcultor!!! n The nth root of n n Be ble
More informationTHE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p
THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationMath 1431 Section M TH 4:00 PM 6:00 PM Susan Wheeler Office Hours: Wed 6:00 7:00 PM Online ***NOTE LABS ARE MON AND WED
Mth 43 Section 4839 M TH 4: PM 6: PM Susn Wheeler swheeler@mth.uh.edu Office Hours: Wed 6: 7: PM Online ***NOTE LABS ARE MON AND WED t :3 PM to 3: pm ONLINE Approimting the re under curve given the type
More informationUNIT 1 FUNCTIONS AND THEIR INVERSES Lesson 1.4: Logarithmic Functions as Inverses Instruction
Lesson : Logrithmic Functions s Inverses Prerequisite Skills This lesson requires the use of the following skills: determining the dependent nd independent vribles in n exponentil function bsed on dt from
More informationBinding Numbers for all Fractional (a, b, k)-critical Graphs
Filomt 28:4 (2014), 709 713 DOI 10.2298/FIL1404709Z Published by Fculty of Sciences nd Mthemtics, University of Niš, Serbi Avilble t: http://www.pmf.ni.c.rs/filomt Binding Numbers for ll Frctionl (, b,
More informationA-Level Mathematics Transition Task (compulsory for all maths students and all further maths student)
A-Level Mthemtics Trnsition Tsk (compulsory for ll mths students nd ll further mths student) Due: st Lesson of the yer. Length: - hours work (depending on prior knowledge) This trnsition tsk provides revision
More informationOn Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach
On Computing the Distinguishing Numbers of Plnr Grphs nd Beyond: Counting Approch V. Arvind The Institute of Mthemticl Sciences Chenni 600 113, Indi rvind@imsc.res.in Christine T. Cheng Deprtment of Electricl
More information378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.
378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),
More informationN 0 completions on partial matrices
N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver
More information(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer
Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.
More informationLecture 7 notes Nodal Analysis
Lecture 7 notes Nodl Anlysis Generl Network Anlysis In mny cses you hve multiple unknowns in circuit, sy the voltges cross multiple resistors. Network nlysis is systemtic wy to generte multiple equtions
More informationBridging the gap: GCSE AS Level
Bridging the gp: GCSE AS Level CONTENTS Chpter Removing rckets pge Chpter Liner equtions Chpter Simultneous equtions 8 Chpter Fctors 0 Chpter Chnge the suject of the formul Chpter 6 Solving qudrtic equtions
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationVectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:
Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )
More informationSurface maps into free groups
Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The
More informationMath 426: Probability Final Exam Practice
Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by
More informationUSA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year
1/1/5. Alex is trying to oen lock whose code is sequence tht is three letters long, with ech of the letters being one of A, B or C, ossibly reeted. The lock hs three buttons, lbeled A, B nd C. When the
More information7.2 Riemann Integrable Functions
7.2 Riemnn Integrble Functions Theorem 1. If f : [, b] R is step function, then f R[, b]. Theorem 2. If f : [, b] R is continuous on [, b], then f R[, b]. Theorem 3. If f : [, b] R is bounded nd continuous
More informationGRADE 4. Division WORKSHEETS
GRADE Division WORKSHEETS Division division is shring nd grouping Division cn men shring or grouping. There re cndies shred mong kids. How mny re in ech shre? = 3 There re 6 pples nd go into ech bsket.
More informationFrobenius numbers of generalized Fibonacci semigroups
Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationClosure Properties of Regular Languages
Closure Properties of Regulr Lnguges Regulr lnguges re closed under mny set opertions. Let L 1 nd L 2 e regulr lnguges. (1) L 1 L 2 (the union) is regulr. (2) L 1 L 2 (the conctention) is regulr. (3) L
More informationLevel I MAML Olympiad 2001 Page 1 of 6 (A) 90 (B) 92 (C) 94 (D) 96 (E) 98 (A) 48 (B) 54 (C) 60 (D) 66 (E) 72 (A) 9 (B) 13 (C) 17 (D) 25 (E) 38
Level I MAML Olympid 00 Pge of 6. Si students in smll clss took n em on the scheduled dte. The verge of their grdes ws 75. The seventh student in the clss ws ill tht dy nd took the em lte. When her score
More informationHW3, Math 307. CSUF. Spring 2007.
HW, Mth 7. CSUF. Spring 7. Nsser M. Abbsi Spring 7 Compiled on November 5, 8 t 8:8m public Contents Section.6, problem Section.6, problem Section.6, problem 5 Section.6, problem 7 6 5 Section.6, problem
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More information3.1 Review of Sine, Cosine and Tangent for Right Angles
Foundtions of Mth 11 Section 3.1 Review of Sine, osine nd Tngent for Right Tringles 125 3.1 Review of Sine, osine nd Tngent for Right ngles The word trigonometry is derived from the Greek words trigon,
More information38 Riemann sums and existence of the definite integral.
38 Riemnn sums nd existence of the definite integrl. In the clcultion of the re of the region X bounded by the grph of g(x) = x 2, the x-xis nd 0 x b, two sums ppered: ( n (k 1) 2) b 3 n 3 re(x) ( n These
More informationAUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton
25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q
More informationConsolidation Worksheet
Cmbridge Essentils Mthemtics Core 8 NConsolidtion Worksheet N Consolidtion Worksheet Work these out. 8 b 7 + 0 c 6 + 7 5 Use the number line to help. 2 Remember + 2 2 +2 2 2 + 2 Adding negtive number is
More information