Proof of Goldbach s Conjecture. Reza Javaherdashti
|
|
- Violet Harrison
- 5 years ago
- Views:
Transcription
1 Proof of Goldbach s Cojecture Reza Javaherdashti farzijavaherdashti@gmail.com Abstract After certai subsets of Natural umbers called Rage ad Row are defied, we assume (1) there is a fuctio that ca produce prime umbers ad (2) each eve umber greater tha 2, like A, ca be represeted as the sum of prime umbers. We show this by DC(A). Each Row is similar to each other i properties,(so is each Rage). It is prove that i a arbitrary Row for ay eve umber greater tha 2, DC(A)=2, that is to say, each eve umber greater tha two is the sum of two prime umbers. So Goldbach s cojecture is proved. 1.Historical Backgroud: Of still-usolved problems o prime umbers oe ca metio Goldbach s cojecture. Goldbach ( ) i his letter to Euler i 1742, asked if ay eve umber greater tha 2 could be writte as the sum of two prime umbers. Euler could ot aswer or could he fid ay couter-example. The mai problem with Goldbach s cojecture is that i most of theorems i arithmetic, prime umbers appear as products, however, i Goldbach s cojecture it is the additio of prime umbers that makes all the problem. I 1931, a youg, ot that famous Russia mathematicia amed Schirelma ( ) proved that ay positive iteger could have bee represeted, at most, as the sum of 300,000 prime umbers. The reasoig was costructive ad direct without givig ay practical use to decompose a give iteger ito the sum of prime umbers. Some years after him, the Russia mathematicia Viogradoff by usig ad improvig methods iveted by the Eglish mathematicias, Hardy ad Littlewood, ad their great Idia colleague Ramauja, could decrease umber of the metioed prime umbers from 300,000 to 4. Viogradoff s approach has bee proved to be true for itegers large eough. With exact words, Viogradoff proves that there exists a iteger like N so that for ay iteger >N, it ca be represeted, at most, as the sum of four prime umbers. He gives oway to determie ad measure N. Vigoradoff s method has actually proved 1
2 that acceptig the ifiite itegers that caot be show as the sum of, at most, four prime umbers, results i cotradictio. 2.Method ad Basic Assumptios: The method we use i our approach, relies o the followig facts (or, iterpretatios): 1.Cotroversial poits with Goldbach s cojecture are: 1.1.It seems as if there must be a kid of formula that ca produce prime umbers After such a prime umber-producig formula is foud, oe should look for its relatioship with eve umbers greater tha 2. 2.Goldbach assumes that sum of prime umbers gives eve umbers greater tha 2; the problem is how to limit the umber of such prime umbers with oly two. To clarify the approach, we assume that: Assumptio #1: There is a fuctio like f (x) that produces prime umbers. Assumptio #2: Each eve umber greater tha 2, ca be take as to be the sum of prime umber where is a Natural umber. Usig the above-metioed assumptios, we defie Row ad Rage as subsets of Natural umbers. The, by usig DC (A), that desigates that how may prime umbers ca produce eve umber A greater tha 2, we prove DC(A)=2. I other words, It is proved that that the miimum umber of prime umbers that results i a eve umber A, which is greater tha 2, is oly two. Thus, Goldbach s cojecture is proved. Our method cosists of three parts: I. Basic cocepts o Row ad Rage. II. Basic defiitios of f(x) ad DC(A). III. Proof. We will NOT use statistical data or tables of prime umbers i our method. 2
3 Part 1): Basic cocepts o Row ad Rage 1.1.Defiitio of Row: Row-that we show as r(x i x f )- is a term used for represetig ay subset of Natural umbers, N, that has all of the properties below: I. r(x i x f ) N, that is, each Row is a subset of Natural umbers. If [r(x i x f )] shows the umber of elemets of the set r(x i x f ), the : [r(x i x f )] = d d N The above meas that i a Row, umber of elemets is limited. II. (property of havig a smallest ad a greatest elemet i a Row): Each r(x i x f ) has just oe smallest ad just oe greatest elemet, that is, each r(x i x f ), at most, has oe smallest elemet like x i i r(x i x f ) such that for all x r(x i.x f ), x>x i. I the same way, each r(x i x f ) has oe greatest elemet III. IV. like x f such that for all x r(x i x f ), x < x f. So x f is the greatest elemet of r(x i x f ) ad there is o elemet larger tha it. (property of a ordered Row): I each Row r(x i x f ) all of its elemets are orderable, from left to right, ad from the smallest to the largest elemet. (property of costat differece betwee elemets of a Row) For all x r(x i x f ), if x x i ad x x f, the x-1 < x < x+1. This meas that each x r(x i x f ) is less tha or larger tha a umber immediately before or after by a costat differece, which is oe Examples: A = {1,2,3,4} A is a Row so A = r(14) as x i = 1 ad x f = 4 ad the differece betwee each immediate successive elemet is uity. B = {25,26,27} B is a Row so B = r(2527) as x i = 25 ad x f = 27 C = {4,3,2,1} C is NOT a Row; III is ot held. D = {5,9,10,11,14} D is NOT a Row; IV is ot held. E = {49,51,53,55} E is NOT a Row; IV is ot held. 3
4 Covetio.1: 1- From ow o, istead of r(x i x f ), the symbol r(if) is used. 2- Accordig to III, x< x i or x> x f is ot defied i r(if). 3- Ay r(if), schematically ca be show as follows: x i x 1 x 2 x x f r(if) = { x i, x 1, x 2,., x, x f } x < x f 1.2.Defiitio of Rage: Rage-that we show as R(x I x F )-is a term used for represetig ay subset of Natural umbers that has all of the properties below: [1]. R(x I x F ) N [2]. r(if) R(x I x F ) [3]. [R(x I x F )] = D D N, D>d [4]. Each R(x I x F ) has, at most, oe smallest elemet show as x i, ad oe greatest elemet x F,ie; for each X R(x I x F ): X < x F, X > x I [5]. For each X R(x I x F ) givig X x I ad X x F : X-1< X< X+1 [6]. All the elemets of a Rage R(x I x F ) ca be ordered, from left to right ad from the smallest to the largest elemet Examples: F = {1,2,3,,98,99,100} F is a Rage so F = R(1100),r(110) F, so [2] is held. G = {5,6,7,,22,23} G is rage so G = R(523) H = {30,31,32,35,36,37,39,41,42,45} H is NOT a Rage, [5] is ot held. I = {31,32,50,33,50,1,2,4,10,2000} I, is NOT a Rage,; -[2] is ot held as oly {1,2} ad {31,32} have the smallest ad the largest elemets, so IV is ot held for these subsets. 4
5 -[5] is ot held. -[6] is ot held. Covetio.2: 1-From ow o, R(x I x F ) is show as R(IF). 2-By cosiderig [2] ad [4], it appears that i some cases X I = x i or X F = x f,for example, i F, X I = 1 ad also i A, x i = 1 (A F). 3-By usig Row ad Rage cocepts, N (atural umbers set) ca be subdivided ito subsets that have certai properties as R(IF) N ad r(if) R(IF). There are ifiite umber of R(IF) sets but defiite ad limited umber of r(if) subsets, for istace, there are iifiite umber of sets like R(1100), R(101200), R(201300) etc. but i each of these sets there are limited ad defiite umber of r(if);as a example, i R(1100),there are te subsets (=Rows) such as r(110), r(1120), r(2130),, r(91100). So, ay theorem that is proved or ay coclusio that is made for arbitrary r(if) ad R(IF), ca the be geeralised for all similar Rows ad Rages so that what is prove, will be applicable to whole Natural umbers. Covetio.3: For each x which is a elemet of a Row r(if), we use the followig symbolism: x r(if) or (x)r(if) ad for each X which is a elemet of R(IF), we use the followig symbolism: X R(IF) or (X)R(IF) Ad so forth. Covetio.4: I a Row r(ij), its smallest elemet-that is x i ca be show as either (x i )r(ij) or A( i ) ad its greatest elemet-x f -ca be show as (x f )r(ij) ad so forth. Result of Covetio.4: I a Row r(pq), A(p) is the smallest elemet. I a Row r(st), A(s) is the smallest elemet ad so forth. Theorem.1 Take two Rows r(ij) ad r(kl) i a rage R(IF). Prove that for all x i ad x f elemets of these Rows, we have: (x f )r(ij) ± p = (x i )r(kl) 5
6 where p is a costat. Proof: Assume that p = 0, the (x f )r(ij) = (x i )r(kl). Now take R(IF) as: (1) (r(ij) R(IF) & (r(kl) R(IF)) R(IF) = r(ij) U r(kl), where U is uio sig, results i: (2) (x R(IF)) (x r(ij)) & (x r(kl)) as (x i )r(kl) r(kl) ad (x f )r(ij) r(ij), the both (x i )r(kl) ad (x f )r(ij) must be elemets of R(IF) but i this case: 1.the differece betwee (x i )r(kl) ad (x f )r(ij) will ot be equal to uity ( [5] ad IV are ot held). 2.R(IF) will ot be ordered ( [6] is ot held) So, R(IF) will ot be a Rage but this is i cotradictio with our assumptio. Therefore, p 0. If each elemet of r(ij) is smaller tha each elemet of r(kl) the, (x f )r(ij) + p = (x i )r(kl) ad so forth. Defiitio.1: If (x f )r(ij) + p = (x i )r(kl), r(ij) ad r(kl) are called Successive Rows. Remider: Rage s are arbitrary, radom sample sets from set of atural umbers. Row s are arbitrary, radom sample sets from rages. By itroducig the cocepts of rage ad row, it is followed that if somethig is prove for these radom cuts from atural umbers set, it has bee prove for WHOLE atural umbers. However, defiitios of rage ad row clearly show that NOT ANY radom set from atural umbers set ca be picked up as rage ad/or row (see examples ad ). Part.2): Basic defiitios of f(x) ad DC(A) Defiitio 2: We defie a fuctio f(x) so that for ay x = a, f(a) be a prime umber. Defiitio 3: The degree of complexity fuctio that we show it as DC is the umber of prime umbers to be added to each other with a + sig betwee each to yield a eve umber greater tha two. DC will itself be a Natural umber Example: -For 8 = DC (8) = 4 6
7 -For 8 = DC (8) = 2 -For 216 = DC (216) = 2 Coclusio from defiitio 3: The least value for DC(A), where A is a eve umber greater tha 2, is 2; ie, DC (A) 2. Defiitio 4: I ay Row r(ij) of the Rage R(IF), umber of eve umbers (2K), odd umbers (2K + 1) ad prime umbers (f(x)) are show, respectively, as Γ(2K), Γ(2K + 1), ad Γf(x). So i the Rage R(1100) ad Row r(110), Γ(2K) = 5 that is to say, (2,4,6,8,10), Γ(2K + 1) = 5 ie (1,3,5,7,9) ad Γf(x) = 4 (2,3,5,7). Part.3): Proof Assumptios: 1) Assume i Row r(ij) of Rage R(IF), there exists at least oe prime umber like f(x). 2) Assume i ay Row r(ij), the umber of eve ad odd umbers are equal to each other (i ay Row there is as may odd umbers as there is eve umbers). So i ay Row r(ij) there exists odd ad eve umbers alteratively (after each odd umber there is a eve umber ad vice versa). 3) Assume i a Row r(ij), umber of odd umbers be more tha prime umbers i the same Row, i other words, ay prime umber greater tha 2 is a odd umber BUT ay odd umber is NOT a prime umber. From assumptios 1) ad 3), oe cocludes: (3) 1 Γf(x) Γ(2K + 1) For eve umbers greater tha 2, like A, degree of complexity fuctio ca be writte as DC (A). Accordig to the coclusio from defiitio 3, DC (A) 2, ie, at least two prime umbers must be added to each other to yield A. As A is a eve umber greater tha 2, the umber of eve umbers that are required to be added to each other to yield A, will be less tha the umber of existig eve umber i the Row r(ij), so i r(ij) the umber of prime umbers to be added up to yield A is: (4) DC (A) Γ(2K) By addig Γ(2K + 1) to right-had sides of iequalities (3) ad (4) it yields: (5) Γf(x) Γ(2K + 1) + Γ(2K + 1) 7
8 (6) DC (A) Γ(2K) + Γ(2K + 1) Accordig to assumptio 2) Γ(2K) = Γ(2K + 1); by applyig this to (5), it yields: (7) Γf(x) Γ(2K) + Γ(2K + 1) by addig each side of (6) ad (7) to each other, we take: (8) DC (A) + Γf(x) 2[Γ(2K) + Γ(2K + 1)] or (9) DC (A) 2[Γ(2K) + Γ(2K + 1)] - Γf(x) Combiig the coclusio from defiitio 3 with iequality (9) yields: (10) 2 DC (A) 2[Γ(2K) + Γ(2K + 1)] - Γf(x) The above relatio ca be decomposed ito the followig three iequalities: (11-1) DC (A) > 2 (11-2) DC (A) 2[Γ(2K) + Γ(2K + 1)] - Γf(x) (11-3) DC (A) = 2 We will prove that (11-1) ad (11-2) will be resultig i cotradictios so that they will ot be held. Therefore, the oly remaiig relatio will be (11-3) that states that the umber of prime umbers to be added up to yield a eve umber greater tha 2, is two. Assume (11-1) holds, ie, DC > 2. This meas: (12) DC (A) = a 1 + a 2 + = i= a i 3 Where m shows total umber of umbers-eve, odd ad prime umbers-existig i a give Row r(ij); a i (i = 1,2,3,,m) shows the prime umbers to yield A. Relatio (12) may be re-writte as (13): i m (13) DC (A) = 2 + = i= a i i m Where is a arbitrary umber less tha m. Oe should otice that i (12) a 1 ad a 2 are two eve umbers where i (13) some prime umbers like umber like 2. Equatio (13) yields: i = m a i i= are added to a (14) DC (A) 2 = m a i 8
9 m a i represets the umber of prime umbers i a Row r(ij) which is less tha total umber of existig prime umbers of r(ij), that is to say: (15) m a i Γf(x) replacig (14) ito (15) yields: (16) DC (A) 2 = Γf(x) Assumptio 3) of Part.3):Proof about odd ad prime umbers gives: (17) m a i Γ(2K + 1) replacig (14) ito (17) yields: (18) DC (A) 2 = Γ(2K + 1) Or (19) DC (A) Γ(2K + 1) + 2 From (16), (20) is resulted: (20) DC (A) Γf(x) + 2 By addig sides of (19) ad (20) to each other: (21) 2DC (A) Γ(2K) + Γf(x) + 4 as DC (A) < 2DC (A), oe may coclude (22). To let the iequality hold with more force, we add Γ(2K) to right-had side of (21) too; (22) 2DC (A) Γ(2K) + Γ(2K + 1) Γf(x) + 4 The right-had side of (22) may be writte as (23): (23) 2[Γ(2K) + Γ(2K + 1)] - Γf(x) = [Γ(2K) + Γ(2K + 1) + Γf(x) + 4] + [Γ(2K) + Γ(2K + 1) - 2Γf(x) - 4] (24) Γ(2K) + Γ(2K + 1) + Γf(x) + 4 < 2[Γ(2K) + Γ(2K + 1)] - Γf(x) To combie (22) ad (24) yields: (25) DC (A) < Γ(2K) + Γ(2K + 1) + Γf(x) + 4 < 2[Γ(2K) + Γ(2K + 1)] - Γf(x) The relatio (25) results i: (26) DC (A) < 2[Γ(2K) + Γ(2K + 1)] - Γf(x) Iequality (26) resembles (11-2). So we will cosider (26) more precisely: Oe sees that DC (A) 2[Γ(2K) + Γ(2K + 1)] - Γf(x) shows the umber of prime umbers i a give Row r(ij) to be added to each other to result i a umber like A, which is a eve umber greater tha2. Therefore, 2[Γ(2K) + Γ(2K + 1)] - Γf(x) must 9
10 be less tha the umber of existig odd umbers i r(ij) (Assumptio 3) of Part.3):Proof). O the other had, accordig to assumptio 2) Part.3):Proof at least half of the total m umbers i a Row r(ij) i other words, -are existig odd umbers of r(ij). As it 2 was stated i (12), if m be total umber of existig umbers i a Row r(ij), the: m (27) 2[Γ(2K) + Γ(2K + 1)] - Γf(x) 2 as Γ(2K) + Γ(2K + 1) = m (Assumptio 2) of Part.3):Proof)): m (28) 2m - Γf(x) 2 (29) 1.5m Γf(x) as m < 1.5m the: (30) m < 1.5m < Γf(x) or: (31) m < Γf(x) Iequality (31) is ot held as it states that i a Row r(ij), the umber of prime umbers of the Row is larger tha total umbers of the Row, which is IMPOSSIBLE. I the same way, oe may prove that if (26) is writte as: DC (A) = 2[Γ(2K) + Γ(2K + 1)] - Γf(x), agai we will come up with the cotradictio stated as i (31). The above discussio shows that (11-2) is NOT held. Oe may show (25) as a combiatio of the followig: (32-1) DC (A) > 2 (32-2) DC (A) < Γ(2K) + Γ(2K + 1) Γf(x) + 4 (32-3) DC (A) < 2[Γ(2K) + Γ(2K + 1)] - Γf(x) We call (32-1) through (32-3), as p, q ad r, respectively so that we traslate (25) to the logical expressio (33)as a cojuctio: (33) p ( q & r) where & represets cojuctio sig. Accordig to what we have gaied so far:: 1.r is false, ie, relatios (27) to (31) prove that : DC (A) 2[Γ(2K) + Γ(2K + 1)] - Γf(x), is NOT held. 2.as r is false, the (q & r) is false. So p must be false also, that is to say: 10
11 DC (A) > 2 is NOT held. Coclusio 01. (11-1) isot held so DC (A) > 2 isot true. 02. (11-2) isot held so DC (A) 2[Γ(2K) + Γ(2K + 1)] - Γf(x) isot true. 03. (11-3) holds as the oly possibility so DC (A) = 2 is true. I fact Coclusio 03 states that a eve umber greater tha 2 ca be writte as the sum of two prime umbers. So Goldbach s cojecture is true. Summary: By defiig certai subsets i Natural umbers set, after all possibilities are cosidered, we prove that Goldbach s cojecture is held i oe arbitrary. The proof ca be geeralised to all the subsets so that the cojecture is prove for all Natural umbers. 11
Proof of Fermat s Last Theorem by Algebra Identities and Linear Algebra
Proof of Fermat s Last Theorem by Algebra Idetities ad Liear Algebra Javad Babaee Ragai Youg Researchers ad Elite Club, Qaemshahr Brach, Islamic Azad Uiversity, Qaemshahr, Ira Departmet of Civil Egieerig,
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More informationMath 299 Supplement: Real Analysis Nov 2013
Math 299 Supplemet: Real Aalysis Nov 203 Algebra Axioms. I Real Aalysis, we work withi the axiomatic system of real umbers: the set R alog with the additio ad multiplicatio operatios +,, ad the iequality
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationObjective Mathematics
. If sum of '' terms of a sequece is give by S Tr ( )( ), the 4 5 67 r (d) 4 9 r is equal to : T. Let a, b, c be distict o-zero real umbers such that a, b, c are i harmoic progressio ad a, b, c are i arithmetic
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationREAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS
REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationSEQUENCES AND SERIES
Sequeces ad 6 Sequeces Ad SEQUENCES AND SERIES Successio of umbers of which oe umber is desigated as the first, other as the secod, aother as the third ad so o gives rise to what is called a sequece. Sequeces
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationSets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram
Sets MILESTONE Sets Represetatio of Sets Power Set Ve Diagram Operatios o Sets Laws of lgebra of Sets ardial Number of a Fiite ad Ifiite Set I Mathematical laguage all livig ad o-livig thigs i uiverse
More informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationSequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018
CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationSection 11.8: Power Series
Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i
More informationThe "Last Riddle" of Pierre de Fermat, II
The "Last Riddle" of Pierre de Fermat, II Alexader Mitkovsky mitkovskiy@gmail.com Some time ago, I published a work etitled, "The Last Riddle" of Pierre de Fermat " i which I had writte a proof of the
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationCALCULATION OF FIBONACCI VECTORS
CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationsubcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016
subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may
More informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More informationThe Growth of Functions. Theoretical Supplement
The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that
More informationLecture Notes for CS 313H, Fall 2011
Lecture Notes for CS 313H, Fall 011 August 5. We start by examiig triagular umbers: T () = 1 + + + ( = 0, 1,,...). Triagular umbers ca be also defied recursively: T (0) = 0, T ( + 1) = T () + + 1, or usig
More informationThe Riemann Zeta Function
Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we
More informationis also known as the general term of the sequence
Lesso : Sequeces ad Series Outlie Objectives: I ca determie whether a sequece has a patter. I ca determie whether a sequece ca be geeralized to fid a formula for the geeral term i the sequece. I ca determie
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationA Block Cipher Using Linear Congruences
Joural of Computer Sciece 3 (7): 556-560, 2007 ISSN 1549-3636 2007 Sciece Publicatios A Block Cipher Usig Liear Cogrueces 1 V.U.K. Sastry ad 2 V. Jaaki 1 Academic Affairs, Sreeidhi Istitute of Sciece &
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationEssential Question How can you recognize an arithmetic sequence from its graph?
. Aalyzig Arithmetic Sequeces ad Series COMMON CORE Learig Stadards HSF-IF.A.3 HSF-BF.A. HSF-LE.A. Essetial Questio How ca you recogize a arithmetic sequece from its graph? I a arithmetic sequece, the
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationQ.11 If S be the sum, P the product & R the sum of the reciprocals of a GP, find the value of
Brai Teasures Progressio ad Series By Abhijit kumar Jha EXERCISE I Q If the 0th term of a HP is & st term of the same HP is 0, the fid the 0 th term Q ( ) Show that l (4 36 08 up to terms) = l + l 3 Q3
More informationSigma notation. 2.1 Introduction
Sigma otatio. Itroductio We use sigma otatio to idicate the summatio process whe we have several (or ifiitely may) terms to add up. You may have see sigma otatio i earlier courses. It is used to idicate
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationOn a Smarandache problem concerning the prime gaps
O a Smaradache problem cocerig the prime gaps Felice Russo Via A. Ifate 7 6705 Avezzao (Aq) Italy felice.russo@katamail.com Abstract I this paper, a problem posed i [] by Smaradache cocerig the prime gaps
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationContinuous Functions
Cotiuous Fuctios Q What does it mea for a fuctio to be cotiuous at a poit? Aswer- I mathematics, we have a defiitio that cosists of three cocepts that are liked i a special way Cosider the followig defiitio
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationSEQUENCE AND SERIES NCERT
9. Overview By a sequece, we mea a arragemet of umbers i a defiite order accordig to some rule. We deote the terms of a sequece by a, a,..., etc., the subscript deotes the positio of the term. I view of
More informationSect Definition of the nth Root
Cocept #1 Sect 11.1 - Defiitio of the th Root Defiitio of a Square Root. The square of a umber is called a perfect square. So, 1,, 9, 16, 2, 0.09, ad 16 2 are perfect squares sice 1 = 12, = 2 2, 9 = 2,
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationEE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course
Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationBasic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.
Basic Sets Example 1. Let S = {1, {2, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 2. Compute the
More informationSummer High School 2009 Aaron Bertram
Summer High School 009 Aaro Bertram 3 Iductio ad Related Stuff Let s thik for a bit about the followig two familiar equatios: Triagle Number Equatio Square Number Equatio: + + 3 + + = ( + + 3 + 5 + + (
More information1 Approximating Integrals using Taylor Polynomials
Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................
More informationIf a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?
2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a
More informationPROPERTIES OF AN EULER SQUARE
PROPERTIES OF N EULER SQURE bout 0 the mathematicia Leoard Euler discussed the properties a x array of letters or itegers ow kow as a Euler or Graeco-Lati Square Such squares have the property that every
More informationCreated by T. Madas SERIES. Created by T. Madas
SERIES SUMMATIONS BY STANDARD RESULTS Questio (**) Use stadard results o summatios to fid the value of 48 ( r )( 3r ). 36 FP-B, 66638 Questio (**+) Fid, i fully simplified factorized form, a expressio
More informationHomework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.
Homewor 1 Solutios Math 171, Sprig 2010 Hery Adams The exercises are from Foudatios of Mathematical Aalysis by Richard Johsobaugh ad W.E. Pfaffeberger. 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that
More informationProperties and Tests of Zeros of Polynomial Functions
Properties ad Tests of Zeros of Polyomial Fuctios The Remaider ad Factor Theorems: Sythetic divisio ca be used to fid the values of polyomials i a sometimes easier way tha substitutio. This is show by
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationClassroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in
Classroom I this sectio of Resoace, we ivite readers to pose questios likely to be raised i a classroom situatio. We may suggest strategies for dealig with them, or ivite resposes, or both. Classroom is
More informationand each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More information1 Generating functions for balls in boxes
Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationThe log-behavior of n p(n) and n p(n)/n
Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity
More informationMATH1035: Workbook Four M. Daws, 2009
MATH1035: Workbook Four M. Daws, 2009 Roots of uity A importat result which ca be proved by iductio is: De Moivre s theorem atural umber case: Let θ R ad N. The cosθ + i siθ = cosθ + i siθ. Proof: The
More informationChapter 7 COMBINATIONS AND PERMUTATIONS. where we have the specific formula for the binomial coefficients:
Chapter 7 COMBINATIONS AND PERMUTATIONS We have see i the previous chapter that (a + b) ca be writte as 0 a % a & b%þ% a & b %þ% b where we have the specific formula for the biomial coefficiets: '!!(&)!
More informationMath 609/597: Cryptography 1
Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, 2000 1 Itroductio We describe the Solovay-Strasse primality test. There is quite a bit
More informationThe Quark Puzzle A 3D printable model and/or paper printable puzzle that allows students to learn the laws of colour charge through inquiry.
The Quark Puzzle A 3D pritable model ad/or paper pritable puzzle that allows studets to lear the laws of colour charge through iquiry. It is available at this lik: https://zeodo.org/record/1252868#.w3ft-gzauk
More information3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials
Math 60 www.timetodare.com 3. Properties of Divisio 3.3 Zeros of Polyomials 3.4 Complex ad Ratioal Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered
More informationSequences and Series
Sequeces ad Series Sequeces of real umbers. Real umber system We are familiar with atural umbers ad to some extet the ratioal umbers. While fidig roots of algebraic equatios we see that ratioal umbers
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationProgressions. ILLUSTRATION 1 11, 7, 3, -1, i s an A.P. whose first term is 11 and the common difference 7-11=-4.
Progressios SEQUENCE A sequece is a fuctio whose domai is the set N of atural umbers. REAL SEQUENCE A Sequece whose rage is a subset of R is called a real sequece. I other words, a real sequece is a fuctio
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationx x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,
Math Activity 9( Due with Fial Eam) Usig first ad secod Taylor polyomials with remaider, show that for, 8 Usig a secod Taylor polyomial with remaider, fid the best costat C so that for, C 9 The th Derivative
More informationMATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x)
MATH 205 HOMEWORK #2 OFFICIAL SOLUTION Problem 2: Do problems 7-9 o page 40 of Hoffma & Kuze. (7) We will prove this by cotradictio. Suppose that W 1 is ot cotaied i W 2 ad W 2 is ot cotaied i W 1. The
More informationTopics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.
MATH 301 Itroductio to Aalysis Chapter Four Sequeces Topics 1. Defiitio of covergece of sequeces. 2. Fidig ad provig the limit of sequeces. 3. Bouded covergece theorem: Theorem 4.1.8. 4. Theorems 4.1.13
More informationSequences and Limits
Chapter Sequeces ad Limits Let { a } be a sequece of real or complex umbers A ecessary ad sufficiet coditio for the sequece to coverge is that for ay ɛ > 0 there exists a iteger N > 0 such that a p a q
More informationUnit 6: Sequences and Series
AMHS Hoors Algebra 2 - Uit 6 Uit 6: Sequeces ad Series 26 Sequeces Defiitio: A sequece is a ordered list of umbers ad is formally defied as a fuctio whose domai is the set of positive itegers. It is commo
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More informationInduction: Solutions
Writig Proofs Misha Lavrov Iductio: Solutios Wester PA ARML Practice March 6, 206. Prove that a 2 2 chessboard with ay oe square removed ca always be covered by shaped tiles. Solutio : We iduct o. For
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationTopic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or
Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad
More informationModel Theory 2016, Exercises, Second batch, covering Weeks 5-7, with Solutions
Model Theory 2016, Exercises, Secod batch, coverig Weeks 5-7, with Solutios 3 Exercises from the Notes Exercise 7.6. Show that if T is a theory i a coutable laguage L, haso fiite model, ad is ℵ 0 -categorical,
More informationPutnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)
Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.
More information2.1. The Algebraic and Order Properties of R Definition. A binary operation on a set F is a function B : F F! F.
CHAPTER 2 The Real Numbers 2.. The Algebraic ad Order Properties of R Defiitio. A biary operatio o a set F is a fuctio B : F F! F. For the biary operatios of + ad, we replace B(a, b) by a + b ad a b, respectively.
More informationThe natural exponential function
The atural expoetial fuctio Attila Máté Brookly College of the City Uiversity of New York December, 205 Cotets The atural expoetial fuctio for real x. Beroulli s iequality.....................................2
More informationDirichlet s Theorem on Arithmetic Progressions
Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty
More informationC. Complex Numbers. x 6x + 2 = 0. This equation was known to have three real roots, given by simple combinations of the expressions
C. Complex Numbers. Complex arithmetic. Most people thik that complex umbers arose from attempts to solve quadratic equatios, but actually it was i coectio with cubic equatios they first appeared. Everyoe
More information(I.C) THE DISTRIBUTION OF PRIMES
I.C) THE DISTRIBUTION OF PRIMES I the last sectio we showed via a Euclid-ispired, algebraic argumet that there are ifiitely may primes of the form p = 4 i.e. 4 + 3). I fact, this is true for primes of
More information