Math 2534 Final Exam Review Answer Key 1. Know deþnitions for the various terms: a. Modus Ponens b. Modus Tollens c. divides d. rational e.
|
|
- Margery Cole
- 5 years ago
- Views:
Transcription
1 Math 534 Fnal Exam Revew Answer Key 1. Know deþntons for the varous terms: a. Modus Ponens b. Modus Tollens c. dvdes d. ratonal e. Quotent-Remander Theorem f. unon g. ntersecton h. complement. DeMorgan s Laws j. power set k. one to one l. onto m. Pgeon Hole Prncple n. countable o. equvalence relaton p. tautology Look them up.. Truth tables: a. Construct the truth table for p (q r) p q r r q r p (q r) T T T F F T T T F T T T T F T F F T T F F T F T F T T F F F F T F T T T F F F F F F F F F T F F b. Be able to use truth tables to verfy the logcal equvelence of two statement forms. (Such as: Provng DeMorgan s Law or the Absorpton Law s true.) 3. Fnd the nverse, converse, contrapostve, and negaton of the followng: a. If I pass the Þnal exam, then I wll pass ths class. Inverse: If I do not pass the exam, then I wll not pass ths class. Converse: If I pass ths class, then I passed the exam. Contrapostve: If I do not pass ths class, then I dd not pass the Þnal. Negaton: I passed the exam and dd not pass the class. b. For every hour I lve there s a moment to be sezed such that f I don t spend my tme wsely, I wll be old before I know t. Inverse: For every hour I lve there s a moment to be sezed such that f I spend my tme wsely, I wll not be old before I know t. Converse: For every hour I lve there s a moment to be sezed such that f I am old before I know then I dd not spend my tme wsely. Contrapostve: For every hour I lve there s a moment to be sezed such that f I am not old before I know t then I dd spend my tme wsely. Negaton: There s an hour n whch I lve such that for every moment to be sezed, I don t have to spend my tme wsely and I wll not be old before I know t. 4. Rewrte n If... then form: a. p only f q c. p s a necessary condton for q b. p f q d. p s a suffcent condton for q. a. If qthen p c. If pthen q b.ifqthenp d.ifpthenq. 5. Be able to use truth tables to verfy the valdty of argument forms. Examples: 1
2 a. p q q p p q b. p p q q r r a. p q p q p q p q T T T T T T F F T F F T T F F F F T T F The crtcal rows are n bold face. Snce the concluson s not always True whenever the hypothess are True, ths argument form s not vald.. Use basc argument forms (secton 1.3) to justfy the concluson from the premses, gvng reasons for each step. p r s m s u p w u w m w 1) w dsjunctve ) u Modus 3) p r s Modus u w syllogsm u p Ponens p Ponens u 4) r s Conjunctve s SmplÞcaton p 5) s Modus m s Tollens m r s ) m Dsjunctve m w Addton 7. Gven the followng Major Premse, P(x) Q(x), gve the Mnor Premse and Concluson for the followng argument forms: a. Modus Ponens b. Modus Tollens c. Inverse Error d. Converse Error Modus Ponens Modus Tollens Inverse Error Converse Error Mnor Premse: P(x) Q(x) P(x) Q(x) Concluson: Q(x) P(x) Q(x) P(x) 8. Be able to use dagrams to determne the valdty of argument forms. Example: All polynomal functons are contnuous. f(x) s contnuous. f(x) s a polynomal. (of sorts...) Ths argument form s nvald. The crcle of polynomal functons s contaned n the crcle of contnuous functons. f(x) s n the crcle of contnuous functons, but t could be outsde the polynomal functons. Therefore we cannot conclude that f(x) s a polynomal. 9. Prove the followng: (be very explct) a. If a b anda c, then a (b+c) Proof: Let a,b,c Z such that a b anda c. Thus ntegers m, n such that b = am and c = an. Thus b+c = am+an = a(m+n). Snce m and n are ntegers, m+n s an nteger. Thus by the deþnton of dvdes, a (b+c). QED b. The square of any odd nteger has the form of 8m+1 for some m Z.
3 Proof: Let x be any odd nteger. Usng the Quotent Remander Theorem, we know that x = 4q+1 or x=4q+3forsomeq Z. Case 1: x = 4q+1. x =(4q+1) = 1q + 8q + 1 = 8(q + q) + 1. Snce q s an nteger, q +qs an nteger. Thus x = 8m+1 for some nteger m. Case : x = 4q+3. x =((4q+3) = 1q + 4q + 9 = 1q +4q+8+1=8(q +3q+1)+1. Snce q s an nteger, q + 3q+ 1 s an nteger. Thus x = 8m+1 for some nteger m. Therefore f x s any odd nteger, x = 8m+1 for some nteger m. QED c. The product of a ratonal number and an rratonal number s rratonal. (Hnt: Use contradcton) Proof: (by contradcton) Assume r Q and s/ Q such that rs Q. By the deþnton of ratonal numbers, a,b,c,d Z such that r = a b and rs = c rs d, wth a,b,c,d=0. Snce s = r By deþnton, ths means that s Q, but ths s a contradcton for we earler assumed s / Q. Thusour assumpton was false, and hence the product of a nonzero ratonal and rratonal number s rratonal. QED d. For all n Z, fn s odd, then n s odd. (Hnt: Use the contrapostve) We wll prove: for all n Z, fnseven,thenn s even. Proof: Let n be an even nteger. Thus n = k for some nteger k. Thus n =4k =(k ). Thus by deþnton of even n s even. QED 10. Fnd formulas for the followng sequences (c and d are recursvely deþned): a. 0,,4,,8,... b. 0,,,1,0,30,4,5,... c. 0,1,1,3,5,11,1,43,... d. 1,1,,,4,10,... a. s n =s, n 0 b. s n = n(n +1),n 0 c. s 0 =0,s 1 =1,s n =s n + s n 1, n d. s 0 =1,s n = n(s n 1 ), n Prove va Mathematcal Inducton: Xn a. n(n + 1)(n +1) =,forn 1. Proof: Base case: It works. Now assume for k 1 that Pk+1 k+1 = (k+1)(k+)((k+1)+1). P Pk = (k+1)(k(k+1)+(k+1)) = (k+1)(k +7k+) = (k+1)(k+)(k+3) n P Pk,s= cb da,whereda=0. = k(k+1)(k+1). We want to show that +(k+1) = (by the nductve hypothess) = k(k+1)(k+1) +(k+1) = k(k+1)(k+1)+(k+1) = = n(n+1)(n+1),forn 1. QED,whchswhatwewantedtoshow. b. n! > n for n 4 Proof: Base case: It works. Now assume for some k 4, that k! > k. We want to show that (k +1)!> k+1. (k +1)! = (k +1)k! > (by the nductve hypothess) > (k +1) k > (snce k 4, k>) > k = k+1.. Thus (k +1)!> k+1,whchswhatwewantedtoshow. n! > n for n 4. QED. 3
4 1. Be able to prove two sets are equal usng the Element Method. Examples: a. A (A B) = A Let x A. Thus x A B, hence by deþnton of ntersecton x A (A B). Thus A A (A B). Let x A (A B). Thus by deþnton of ntersecton x A. Thus A (A B) A. A (A B) = A. QED. b. B-A=B A c Let x B-A. Then by deþnton x Bandx/ A. Thus x A c.thusbydeþnton of ntersecton x B A c. Let x B A c.thusx Bandx A c, hence x/ A. Thus by deþnton of set mnus, x B-A. x B A c =B-A.QED c. sets A, B, and C, f A C=B C, then A = B. Not true. Counterexample: Let A = {1,,3}, B ={1,4,5}, C ={1}. 13. Be able to prove thngs concernng the empty set Ø. Examples: a. A Ø=Ø b. A A c =Ø c. For all sets A and B, f A B, then A B c =Ø Assume false; thus sets A and B such that A B c =Ø. Letx A B c. Thus x Aandx B c. Snce x AandA B, x B. But thus x Bandx B c, whch s a contradcton. Therefore our assumpton was false, and the orgnal statement s true. QED. 14. State whch of the followng are true: a. {1,,3} Z b. π Q c. Ø Q d. Z Q = Z e. Z Q = R f. Ø Ø g. Ø Ø h. 1 {{1} } a. F (ts a subset, not an element) b. F (π s rratonal) c. F (a subset, not an element) d. T e. F (= Q, see d) f. F (subset, not an element) g. True h. F. 15. Let A = {1,,3,4}, B ={5,,7}. Usng arrow dagrams, do each of the followng f possble. If not possble, state why. a. Draw f:a B such that f s one to one. b. Draw f:a Bsuchthatfsonto. c. Draw f:a B such that f s a one to one correspondence. a. Not possble, for A has more elements than B. b. Many optons exst. c. Not possble, see (a) 1. Let A,B,and C be sets, and let f,and g be functons so that f:a B, g:b C. a. If g f s one to one, must f be one to one? Must g? Prove or gve a counterexample. f must be one to one, g does not. Play around wth dagrams to get a counterexample. Proof: Let x 1,x A such that f(x 1 )=f(x ). Snce g s a functon, ths means that g(f(x 1 )) = g(f(x )), whch s the same as sayng that (g f)(x 1 )=(g f)(x ). But snce g f s one to one, ths means that x 1 = x.thusfsonetoone. b. If g fsonto,mustfbeonto?mustgbe?proveorgveacounterexample. g must be onto, f does not. Play around wth dagrams to get a counterexample. 4
5 Proof: Let x C. Snce g fsonto,weknow y Asuchthat(g f)(y)=x.letz=f(y) B. g(z) =g(f(y))=x.thus x C, y Bsuchthatg(y)=x,andthusgsonto. 17. Dscrete Dorothy deþnes f:z Z by f(n) = n. Jve Junkn Jerry clams ths s not well deþned snce t s not one to one or onto. Dscrete Dorothy dsagrees. Who s correct and why? Dscrete Dorothy. A functon need not be one to one or onto to be well deþned. 18. Prove the set of odd ntegers are countable. (Do so by Þndng an approprate functon from a known countable set to ths set.) We know from prevous work that Z s countable. DeÞne f:z {odd ntegers} by f(n) = n+1. Prove ths s functon s 1-1 and onto ntegers are pcked. What s the maxmum number of ntegers that we can be sure of that are congruent mod 5? DeÞne a bnary relaton R on Z by xry m n(mod4). ProveR s an equvalence relaton. Lst the equvalence classes, and descrbe the elements n each. Reßexve: Snce x x (mod 4) for all x, xrx for all x. Symmetrc: Snce f m n(mod4),thenn m(mod4),fmrn, then nrm. Transtve: Let xry and yrz. Thus x y(mod 4)and y z(mod 4). Hence 4 (x-y) and 4 (y-z). Thus 4 ((x-y)+(y-z)) = (x-z), hence x z (mod 4), and hence xrz. The equvelance classes are [0], [1], [], [3], where the class [a] = all ntegers of the form 4q+a, for some q Z. 1. Let A be a collecton of sets. DeÞne a bnary relaton R on A by U R V U V. Prove R s a partal order relaton. Reßexve: for all sets U A, U UsoURU for all sets U. Transtve: for all sets U, V, W A, f URV andvrw, then U VandV WsoU W, hence URW. Antsymmetrc: If URV andvru, then U VandV U, hence U = V. Now let A = P({a,b,c}) (the power set of the set{a,b,c}.) Usng the relaton R above, draw the Hasse Dagram deþned by ths relaton. Hnt: It looks lke a cube.. You have 4 dfferent knds of food: Chocolate, Steak, Apples, and Beets (unlmted supply). You have 5 frends to whch you would lke to gve 1 knd of food. How many dfferent ways can you do ths? On planet Namtrah, the Namtrahanans use a 0 letter alphabet. They are gven a personalzed ID that conssts of ether 3,4, or 5 letters. How many dfferent ID s are possble? How many numbers between 1 and 100 are even or dvsble by three? (Use ncluson/excluson) = 7 5
THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationand problem sheet 2
-8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationMath Review. CptS 223 Advanced Data Structures. Larry Holder School of Electrical Engineering and Computer Science Washington State University
Math Revew CptS 223 dvanced Data Structures Larry Holder School of Electrcal Engneerng and Computer Scence Washngton State Unversty 1 Why do we need math n a data structures course? nalyzng data structures
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationBayesian epistemology II: Arguments for Probabilism
Bayesan epstemology II: Arguments for Probablsm Rchard Pettgrew May 9, 2012 1 The model Represent an agent s credal state at a gven tme t by a credence functon c t : F [0, 1]. where F s the algebra of
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More information18.781: Solution to Practice Questions for Final Exam
18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationSolutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010
Solutons to the 7st Wllam Lowell Putnam Mathematcal Competton Saturday, December 4, 2 Kran Kedlaya and Lenny Ng A The largest such k s n+ 2 n 2. For n even, ths value s acheved by the partton {,n},{2,n
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationMULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6
MULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6 In these notes we offer a rewrte of Andrews Chapter 6. Our am s to replace some of the messer arguments n Andrews. To acheve ths, we need to change
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationDiscussion 11 Summary 11/20/2018
Dscusson 11 Summary 11/20/2018 1 Quz 8 1. Prove for any sets A, B that A = A B ff B A. Soluton: There are two drectons we need to prove: (a) A = A B B A, (b) B A A = A B. (a) Frst, we prove A = A B B A.
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationPlease review the following statement: I certify that I have not given unauthorized aid nor have I received aid in the completion of this exam.
ME 270 Sprng 2017 Exam 1 NAME (Last, Frst): Please revew the followng statement: I certfy that I have not gven unauthorzed ad nor have I receved ad n the completon of ths exam. Sgnature: Instructor s Name
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationاولت ارص من نوع -c. الخلاصة رنا بهجت اسماعیل مجلة ابن الهیثم للعلوم الصرفة والتطبیقیة المجلد 22 (3) 2009
مجلة ابن الهیثم للعلوم الصرفة والتطبیقیة المجلد 22 (3) 2009 الت ارص من نوع -C- - جامعة بغداد رنا بهجت اسماعیل قسم الریاضیات - كلیة التربیة- ابن الهیثم الخلاصة قمنا في هذا البحث بتعریف نوع جدید من الت ارص
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationThis model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as:
1 Problem set #1 1.1. A one-band model on a square lattce Fg. 1 Consder a square lattce wth only nearest-neghbor hoppngs (as shown n the fgure above): H t, j a a j (1.1) where,j stands for nearest neghbors
More informationCaps and Colouring Steiner Triple Systems
Desgns, Codes and Cryptography, 13, 51 55 (1998) c 1998 Kluwer Academc Publshers, Boston. Manufactured n The Netherlands. Caps and Colourng Stener Trple Systems AIDEN BRUEN* Department of Mathematcs, Unversty
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationSELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:
SELECTED PROOFS DeMorgan s formulas: The frst one s clear from Venn dagram, or the followng truth table: A B A B A B Ā B Ā B T T T F F F F T F T F F T F F T T F T F F F F F T T T T The second one can be
More informationChowla s Problem on the Non-Vanishing of Certain Infinite Series and Related Questions
Proc. Int. Conf. Number Theory and Dscrete Geometry No. 4, 2007, pp. 7 79. Chowla s Problem on the Non-Vanshng of Certan Infnte Seres and Related Questons N. Saradha School of Mathematcs, Tata Insttute
More informationwhere a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets
5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationFixed point. The function q revisited. Function q. graph F factorial graph factorial. factorial is a fixed point of F, since
CS571 Notes 21 Denotatonal Semantcs of Loops (contnued 1of 25 Generalzng the soluton Parameterze the factoral functon F = λ f.λ n. n equals zero one n tmes ( f ( n mnus one Ths means fac = + 1 F ( fac.e.
More information8 Baire Category Theorem and Uniform Boundedness
8 Bae Categoy Theoem and Unfom Boundedness Pncple 8.1 Bae s Categoy Theoem Valdty of many esults n analyss depends on the completeness popety. Ths popety addesses the nadequacy of the system of atonal
More informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationSome congruences related to harmonic numbers and the terms of the second order sequences
Mathematca Moravca Vol. 0: 06, 3 37 Some congruences related to harmonc numbers the terms of the second order sequences Neşe Ömür Sbel Koaral Abstract. In ths aer, wth hels of some combnatoral denttes,
More informationMath 205A Homework #2 Edward Burkard. Assume each composition with a projection is continuous. Let U Y Y be an open set.
Math 205A Homework #2 Edward Burkard Problem - Determne whether the topology T = fx;?; fcg ; fa; bg ; fa; b; cg ; fa; b; c; dgg s Hausdor. Choose the two ponts a; b 2 X. Snce there s no two dsjont open
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationFOR WHICH p-adic INTEGERS x CAN k
FOR WHICH p-adic INTEGERS x CAN x BE DEFINED? DONALD M. DAVIS Abstract. Let fn) = n. Frst, we show that f : N Q p s nowhere contnuous n the p-adc topology. If x s a p-adc nteger, we say that fx) s p-defnable
More informationSTUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES. n (n +1)(2n +1), 6. j 2 = 1(1+1)(2 1+1) 6. k (k +1)(2k +1) 6
STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES DR. LOMONACO 1. Use the principle of mathematical induction to prove that P (n) : n (n +1)(2n +1), for all integers n 1. Answer: Proof (by weak induction):
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationLECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.
LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,
More informationHomotopy Type Theory Lecture Notes
15-819 Homotopy Type Theory Lecture Notes Evan Cavallo and Stefan Muller November 18 and 20, 2013 1 Reconsder Nat n smple types s a warmup to dscussng nductve types, we frst revew several equvalent presentatons
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationUNIT 4 EXTENDING THE NUMBER SYSTEM Lesson 3: Operating with Complex Numbers Instruction
Prerequste Sklls Ths lesson requres the use of the followng sklls: understandng that multplyng the numerator and denomnator of a fracton by the same quantty produces an equvalent fracton multplyng complex
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationInternational Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions
Internatonal Mathematcal Olympad Prelmnary Selecton ontest Hong Kong Outlne of Solutons nswers: 7 4 7 4 6 5 9 6 99 7 6 6 9 5544 49 5 7 4 6765 5 6 6 7 6 944 9 Solutons: Snce n s a two-dgt number, we have
More informationMath 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationDISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationSubset Topological Spaces and Kakutani s Theorem
MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered
More informationBasic Regular Expressions. Introduction. Introduction to Computability. Theory. Motivation. Lecture4: Regular Expressions
Introducton to Computablty Theory Lecture: egular Expressons Prof Amos Israel Motvaton If one wants to descrbe a regular language, La, she can use the a DFA, Dor an NFA N, such L ( D = La that that Ths
More informationReview of metric spaces. 1. Metric spaces, continuous maps, completeness
(March 14, 2014) Revew of metrc spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [Ths document s http://www.math.umn.edu/ garrett/m/mfms/notes 2013-14/12a metrc spaces.pdf] We
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationUnit 5: Quadratic Equations & Functions
Date Perod Unt 5: Quadratc Equatons & Functons DAY TOPIC 1 Modelng Data wth Quadratc Functons Factorng Quadratc Epressons 3 Solvng Quadratc Equatons 4 Comple Numbers Smplfcaton, Addton/Subtracton & Multplcaton
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationwhere a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets
11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationREDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].
REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß
More informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationReview of Taylor Series. Read Section 1.2
Revew of Taylor Seres Read Secton 1.2 1 Power Seres A power seres about c s an nfnte seres of the form k = 0 k a ( x c) = a + a ( x c) + a ( x c) + a ( x c) k 2 3 0 1 2 3 + In many cases, c = 0, and the
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationA CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA
A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes
More informationk(k 1)(k 2)(p 2) 6(p d.
BLOCK-TRANSITIVE 3-DESIGNS WITH AFFINE AUTOMORPHISM GROUP Greg Gamble Let X = (Z p d where p s an odd prme and d N, and let B X, B = k. Then t was shown by Praeger that the set B = {B g g AGL d (p} s the
More informationDONALD M. DAVIS. 1. Main result
v 1 -PERIODIC 2-EXPONENTS OF SU(2 e ) AND SU(2 e + 1) DONALD M. DAVIS Abstract. We determne precsely the largest v 1 -perodc homotopy groups of SU(2 e ) and SU(2 e +1). Ths gves new results about the largest
More information