DOCSLIB.ORG

Proof of Polignac's Conjecture for Gaps Bigger Than Four

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Proof of Polignac's Conjecture for Gaps Bigger Than Four Proof of Polignac’s Conjecture for gaps bigger than four Marko Jankovic To cite this version: Marko Jankovic. Proof of Polignac’s Conjecture for gaps bigger than four. 2021. hal-03170059v1 HAL Id: hal-03170059 https://hal.archives-ouvertes.fr/hal-03170059v1 Preprint submitted on 15 Mar 2021 (v1), last revised 5 Sep 2021 (v4) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Proof of Polignac's Conjecture for gaps bigger than four Marko V. Jankovic Institute of Electrical Engineering “Nikola Tesla”, Belgrade, Serbia, Department of Emergency Medicine, Bern University Hospital “Inselspital” and ARTORG Center for Biomedical Engineering Research, University of Bern, Switzerland Abstract In this paper proof of the Polignac's Conjecture for gaps bigger than four is going to be presented. The proof represents an extension of the proof of the twin prime conjecture. It will be shown that primes with a gap of size bigger than four could be obtained through two stage sieve process, and that will be used to obtain a reasonable estimation of their numbers. 1 Introduction In number theory, Polignac's conjecture states: For any positive even number g, there are infinitely many prime gaps of size g. In other words: there are infinitely many cases of two consecutive prime numbers with the difference g [1]. The conjecture was proved for gaps bigger than 244 in [2]. Recently, the conjecture was proved for gaps of the size 2 and 4 [3]. The problem was addressed in generative space, which means that prime numbers were not analyzed directly, but rather their representatives that can be used to produce them. This paper represents an extension of the previous work [3]. Basically, three groups of gaps bigger than 4 exist: the gaps of the size 6k, the gaps of the size 6k+2 and gaps of the size 6k+4, k ϵ N. The gaps of the size 6k could be related to the prime pairs in both (mps, mps) and (mpl, mpl) form. The gaps in the form 6k + 2 can only be related to the pair of primes in (mps, mpl) form, while gaps in the form 6k + 4 can only be related to the pair of primes in (mpl, mps) form. In other words there is not a single prime in mpl form that has consecutive prime that is 6k + 2 apart, and there is not a single prime in mps form that has consecutive prime 6k + 4 apart. It is trivial to show that by simple calculation. Although last two groups are different, they can be treated analogously. So, here two different cases are going to be analyzed in order to explain how conjecture can be proved in general case. First it will be shown that exist an infinite number of primes with gaps of the size 6 (also known as sexy primes). After that, it will be shown that exists an infinite number of primes with the gap of size 8 (we mark them as 8-primes). Than the proof can easily be generalized for the gaps of any size g. It will be shown that primes with gap of a size g (g-primes) could be generated by two stage process, and that will be used to generate formula for the number of g-primes. It will be shown that exist lower bound for the number of g-primes smaller than some natural number n, n ϵ N, and that will be used to show that overall number of g-primes is infinite. Remark 1: In this paper any infinite series in the form c1·l ± c2 is going to be called a thread defined by number c1 (in literature these forms are known as linear factors – however, it seems that the term thread is probably better choice in this context). Here c1 and c2 are numbers that belong to the set of natural numbers (c2 can also be zero and usually is smaller than c1) and l represents an infinite series of consecutive natural numbers in the form (1, 2, 3, …). Remark 2: In [3] there is a mistake in definition of the twin primes – it was considered that number of twin primes represents the number of twin prime pairs, which is wrong. The same was done for the cousin primes. So, all results about prediction of the number of the twin and cousin primes in [3] should be multiplied by 2. 2 Proof of the sexy prime conjecture It is well known that all prime numbers can be expressed in one of the following form psk = 6k - 1 plk = 6k + 1, k ϵ N. In the text that follows we will call numbers psk - numbers in mps form and numbers plk - numbers in mpl form. If two consecutive prime numbers have the gap of the size 6 it is clear that both of those numbers have to be in mps form or both have to be in mpl form. In this paper we will only analyze the case of sexy primes in mps form. The case of sexy primes in mpl form can be analyzed analogously. Here we are going to present a two stage process that can be used for generation of the sexy primes in mps form. In the first stage we are going to produce prime numbers by removing all composite numbers from the set of natural numbers. In the second stage, we are going to remove all twin primes, all prime numbers in mpl form that are left, and all prime numbers in mps form that have an bigger sexy odd neighbor (odd number that has gap 6 with the prime of interest) that is a composite number. At the end, only the prime numbers in the mps form, that represent the smaller number of a sexy prime pair, are going to stay. Their number is approximately the half of the number of sexy primes in mps form, or one quarter of all sexy primes (although a little bit bigger due to existence of sexy triplets quadruplets, and so on – in that case only the last number in the series is going to be removed from the set; here is considered that number of triplets, quadruplets etc. sexy primes is very small comparing to the number of sexy primes). It is going to be shown that that number is infinite. Second half of the sexy primes is generated with similar procedure that takes care about sexy primes in mpl form. STAGE 1 Prime numbers can be obtained in the following way: First, we remove all even numbers (except 2) from the set of natural numbers. Then, it is necessary to remove the composite odd numbers from the rest of the numbers. In order to do that, the formula for the composite odd numbers is going to be analyzed. It is well known that odd numbers bigger than 1, here denoted by a, can be represented by the following formula a = 2n +1, where n ϵ N. It is not difficult to prove that all composite odd numbers a can be represented by the c following formula ac=2(2i j+i+ j)+1=2((2 j+1)i+ j)+1. (1) where i, j ϵ N. It is simple to conclude that all composite numbers could be represented by product (i + 1)(j + 1), where i, j ϵ N. If it is checked how that formula looks like for the odd numbers, after simple calculation, equation (1) is obtained. This calculation is presented here. The form 2m + 1, m ϵ N will represent odd numbers that are composite. Then the following equation holds 2 m+1=(i 1+1)( j1+1) , where i , j ϵ N. Now, it is easy to see that the following equation holds 1 1 i j +i + j m= 1 1 1 1 . 2 In order to have m ϵ N, it is easy to check that i and j have to be in the forms 1 1 i1 = 2i and j1 = 2j, where i, j ϵ N. From that, it follows that m must be in the form m = 2ij + i + j = (2i + 1) j + i. (2) When all numbers represented by m are removed from the set of odd natural numbers bigger than 1, only the numbers that represent odd prime numbers are going to stay. In other words, only odd numbers that cannot be represented by (1) will stay. This process is equivalent to the sieve of Sundaram [4]. Let us denote the numbers used for the generation of odd prime numbers with m2 (here we ignore number 2). Those are the numbers that are left after the implementation of Sundaram sieve. The number of those numbers that are smaller than some natural number n, is equivalent to the number of prime numbers smaller than n. We denote with π(n) number of primes smaller than n, than the following equation holds n π(n)≈ . ln (n) STAGE 2 What was left after the first stage are prime numbers. With the exception of number 2, all other prime numbers are odd numbers. All odd primes can be expressed in the form 2n + 1, n ϵ N.
Load more

Recommended publications
  • A Prime Experience CP.Pdf
    p 2 −1 M 44 Mersenne n 2 2 −1 Fermat n 2 2( − )1 − 2 n 3 3 k × 2 +1 m − n , m = n +1 m − n n 2 + 1 3 A Prime Experience. Version 1.00 – May 2008. Written by Anthony Harradine and Alastair Lupton Copyright © Harradine and Lupton 2008. Copyright Information. The materials within, in their present form, can be used free of charge for the purpose of facilitating the learning of children in such a way that no monetary profit is made. The materials cannot be used or reproduced in any other publications or for use in any other way without the express permission of the authors. © A Harradine & A Lupton Draft, May, 2008 WIP 2 Index Section Page 1. What do you know about Primes? 5 2. Arithmetic Sequences of Prime Numbers. 6 3. Generating Prime Numbers. 7 4. Going Further. 9 5. eTech Support. 10 6. Appendix. 14 7. Answers. 16 © A Harradine & A Lupton Draft, May, 2008 WIP 3 Using this resource. This resource is not a text book. It contains material that is hoped will be covered as a dialogue between students and teacher and/or students and students. You, as a teacher, must plan carefully ‘your performance’. The inclusion of all the ‘stuff’ is to support: • you (the teacher) in how to plan your performance – what questions to ask, when and so on, • the student that may be absent, • parents or tutors who may be unfamiliar with the way in which this approach unfolds. Professional development sessions in how to deliver this approach are available.
    [Show full text]
  • Sum of the Reciprocals of Famous Series: Mathematical Connections with Some Sectors of Theoretical Physics and String Theory
    1Torino, 14/04/2016 Sum of the reciprocals of famous series: mathematical connections with some sectors of theoretical physics and string theory 1,2 Ing. Pier Franz Roggero, Dr. Michele Nardelli , P.i. Francesco Di Noto 1Dipartimento di Scienze della Terra Università degli Studi di Napoli Federico II, Largo S. Marcellino, 10 80138 Napoli, Italy 2 Dipartimento di Matematica ed Applicazioni “R. Caccioppoli” Università degli Studi di Napoli “Federico II” – Polo delle Scienze e delle Tecnologie Monte S. Angelo, Via Cintia (Fuorigrotta), 80126 Napoli, Italy Abstract In this paper it has been calculated the sums of the reciprocals of famous series. The sum of the reciprocals gives fundamental information on these series. The higher this sum and larger numbers there are in series and vice versa. Furthermore we understand also what is the growth factor of the series and that there is a clear link between the sums of the reciprocal and the "intrinsic nature" of the series. We have described also some mathematical connections with some sectors of theoretical physics and string theory 2Torino, 14/04/2016 Index: 1. KEMPNER SERIES ........................................................................................................................................................ 3 2. SEXY PRIME NUMBERS .............................................................................................................................................. 6 3. TWIN PRIME NUMBERS .............................................................................................................................................
    [Show full text]
  • Numbers 1 to 100
    Numbers 1 to 100 PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Tue, 30 Nov 2010 02:36:24 UTC Contents Articles −1 (number) 1 0 (number) 3 1 (number) 12 2 (number) 17 3 (number) 23 4 (number) 32 5 (number) 42 6 (number) 50 7 (number) 58 8 (number) 73 9 (number) 77 10 (number) 82 11 (number) 88 12 (number) 94 13 (number) 102 14 (number) 107 15 (number) 111 16 (number) 114 17 (number) 118 18 (number) 124 19 (number) 127 20 (number) 132 21 (number) 136 22 (number) 140 23 (number) 144 24 (number) 148 25 (number) 152 26 (number) 155 27 (number) 158 28 (number) 162 29 (number) 165 30 (number) 168 31 (number) 172 32 (number) 175 33 (number) 179 34 (number) 182 35 (number) 185 36 (number) 188 37 (number) 191 38 (number) 193 39 (number) 196 40 (number) 199 41 (number) 204 42 (number) 207 43 (number) 214 44 (number) 217 45 (number) 220 46 (number) 222 47 (number) 225 48 (number) 229 49 (number) 232 50 (number) 235 51 (number) 238 52 (number) 241 53 (number) 243 54 (number) 246 55 (number) 248 56 (number) 251 57 (number) 255 58 (number) 258 59 (number) 260 60 (number) 263 61 (number) 267 62 (number) 270 63 (number) 272 64 (number) 274 66 (number) 277 67 (number) 280 68 (number) 282 69 (number) 284 70 (number) 286 71 (number) 289 72 (number) 292 73 (number) 296 74 (number) 298 75 (number) 301 77 (number) 302 78 (number) 305 79 (number) 307 80 (number) 309 81 (number) 311 82 (number) 313 83 (number) 315 84 (number) 318 85 (number) 320 86 (number) 323 87 (number) 326 88 (number)
    [Show full text]
  • Arxiv:1707.01770V2 [Math.HO] 21 Feb 2018 4.2
    NOTES ON THE RIEMANN HYPOTHESIS RICARDO PEREZ-MARCO´ Abstract. Our aim is to give an introduction to the Riemann Hypothesis and a panoramic view of the world of zeta and L-functions. We first review Riemann's foundational article and discuss the mathematical background of the time and his possible motivations for making his famous conjecture. We discuss some of the most relevant developments after Riemann that have contributed to a better understanding of the conjecture. Contents 1. Euler transalgebraic world. 2 2. Riemann's article. 8 2.1. Meromorphic extension. 8 2.2. Value at negative integers. 10 2.3. First proof of the functional equation. 11 2.4. Second proof of the functional equation. 12 2.5. The Riemann Hypothesis. 13 2.6. The Law of Prime Numbers. 17 3. On Riemann zeta-function after Riemann. 20 3.1. Explicit formulas. 20 3.2. Poisson-Newton formula 23 3.3. Montgomery phenomenon. 24 3.4. Quantum chaos. 25 3.5. Statistics on Riemann zeros. 27 3.6. Adelic character. 31 4. The universe of zeta-functions. 33 4.1. Dirichlet L-functions. 33 arXiv:1707.01770v2 [math.HO] 21 Feb 2018 4.2. Dedekind zeta-function. 34 Key words and phrases. Riemann Hypothesis, zeta function. We added section 3.2 and 3.5 (February 2018). These notes grew originally from a set of conferences given on March 2010 on the \Problems of the Millenium\ at the Complutense University in Madrid. I am grateful to the organizers Ignacio Sols and Vicente Mu~noz. I also thank Javier Fres´anfor his assistance with the notes from my talk, Jes´usMu~noz,Arturo Alvarez,´ Santiago Boza and Javier Soria for their reading and comments on earlier versions of this text.
    [Show full text]
  • Subject Index
    Subject Index Many of these terms are defined in the glossary, others are defined in the Prime Curios! themselves. The boldfaced entries should indicate the key entries. γ 97 Arecibo Message 55 φ 79, 184, see golden ratio arithmetic progression 34, 81, π 8, 12, 90, 102, 106, 129, 136, 104, 112, 137, 158, 205, 210, 154, 164, 172, 173, 177, 181, 214, 219, 223, 226, 227, 236 187, 218, 230, 232, 235 Armstrong number 215 5TP39 209 Ars Magna 20 ASCII 66, 158, 212, 230 absolute prime 65, 146, 251 atomic number 44, 51, 64, 65 abundant number 103, 156 Australopithecus afarensis 46 aibohphobia 19 autism 85 aliquot sequence 13, 98 autobiographical prime 192 almost-all-even-digits prime 251 averaging sets 186 almost-equipandigital prime 251 alphabet code 50, 52, 61, 65, 73, Babbage 18, 146 81, 83 Babbage (portrait) 147 alphaprime code 83, 92, 110 balanced prime 12, 48, 113, 251 alternate-digit prime 251 Balog 104, 159 Amdahl Six 38 Balog cube 104 American Mathematical Society baseball 38, 97, 101, 116, 127, 70, 102, 196, 270 129 Antikythera mechanism 44 beast number 109, 129, 202, 204 apocalyptic number 72 beastly prime 142, 155, 229, 251 Apollonius 101 bemirp 113, 191, 210, 251 Archimedean solid 19 Bernoulli number 84, 94, 102 Archimedes 25, 33, 101, 167 Bernoulli triangle 214 { Page 287 { Bertrand prime Subject Index Bertrand prime 211 composite-digit prime 59, 136, Bertrand's postulate 111, 211, 252 252 computer mouse 187 Bible 23, 45, 49, 50, 59, 72, 83, congruence 252 85, 109, 158, 194, 216, 235, congruent prime 29, 196, 203, 236 213, 222, 227,
    [Show full text]
  • Solutions to 4K(2X 1)2 2 106
    HMMT February 2015 Saturday 21 February 2015 Guts 1. [4] Let R be the rectangle in the Cartesian plane with vertices at (0, 0), (2, 0), (2, 1), and (0, 1). R can be divided into two unit squares, as shown. The resulting figure has 7 segments of unit length, connecting neighboring lattice points (those lying on or inside R). Compute the number of paths from (0, 1) (the upper left corner) to (2, 0) (the lower right corner) along these 7 segments, where each segment can be used at most once. Answer: 4 Just count them directly. If the first step is to the right, there are 2 paths. If the first step is downwards (so the next step must be to the right), there are again 2 paths. This gives a total of 4 paths. 2. [4] Let ABCDE be a convex pentagon such that ∠ABC = ∠ACD = ∠ADE = 90◦ and AB = BC = CD = DE = 1. Compute AE. Answer: 2 By Pythagoras, AE2 = AD2 +1= AC2 +2= AB2 +3=4, so AE = 2. 2 3. [4] Find the number of pairs of union/intersection operations (1, 2) , satisfying the fol- lowing condition: for any sets S,T , function f : S T , and subsets X,Y,Z∈ {∪of ∩}S, we have equality of sets → f(X)1(f(Y )2f(Z)) = f (X1(Y 2Z)) , where f(X) denotes the image of X: the set f(x): x X , which is a subset of T . The images f(Y ) (of Y ) and f(Z) (of Z) are similarly defined. { ∈ } Answer: 1 If and only if = = .
    [Show full text]
  • Proof of Polignac's Conjecture for Gaps Bigger Than Four
    Proof of Polignac’s Conjecture for gaps bigger than four Marko Jankovic To cite this version: Marko Jankovic. Proof of Polignac’s Conjecture for gaps bigger than four. 2021. hal-03170059v3 HAL Id: hal-03170059 https://hal.archives-ouvertes.fr/hal-03170059v3 Preprint submitted on 9 May 2021 (v3), last revised 5 Sep 2021 (v4) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Proof of Polignac's Conjecture for gaps bigger than four Marko V. Jankovic Institute of Electrical Engineering “Nikola Tesla”, Belgrade, Serbia, Department of Emergency Medicine, Bern University Hospital “Inselspital” and ARTORG Center for Biomedical Engineering Research, University of Bern, Switzerland Abstract In this paper proof of the Polignac's Conjecture for gaps bigger than four is going to be presented. The proof represents an extension of the proof of the twin prime conjecture. It will be shown that primes with a gap of size bigger than four could be obtained through two stage sieve process, and that will be used to obtain a reasonable estimation of their numbers. 1 Introduction In number theory, Polignac's conjecture states: For any positive even number g, there are infinitely many prime gaps of size g.
    [Show full text]
  • Solving Polignac's and Twin Prime Conjectures Using
    Solving Polignac’s and Twin Prime Conjectures Using Information-Complexity Conservation John Y. C. Ting1 1 Rural Generalist in Anesthesia and Emergency medicine, Dental and Medical Surgery, 729 Albany Creek Road, Albany Creek, Queensland 4035, Australia Correspondence: Dr. John Y. C. Ting, 729 Albany Creek Road, Albany Creek, Queensland 4035, Australia. E-mail: [email protected] Abstract: Prime numbers and composite numbers are intimately related simply because the complementary set of com- posite numbers constitutes the set of natural numbers with the exact set of prime numbers excluded in its entirety. In this research paper, we use our ’Virtual container’ (which predominantly incorporates the novel mathematical tool coined Information-Complexity conservation with its core foundation based on this [complete] prime-composite number relation- ship) to solve the intractable open problem of whether prime gaps are infinite (arbitrarily large) in magnitude with each individual prime gap generating prime numbers which are again infinite in magnitude. This equates to solving Polignac’s conjecture which involves analysis of all possible prime gaps = 2, 4, 6,... and [the subset] Twin prime conjecture which involves analysis of prime gap = 2 (for twin primes). In conjunction with our cross-referenced 2017-dated research paper entitled ”Solving Riemann Hypothesis Using Sigma-Power Laws” (http://viXra.org/abs/1703.0114), we advocate for our ambition that the Virtual container research method be considered a new method of mathematical proof especially for solving the ’Special-Class-of-Mathematical-Problems with Solitary-Proof-Solution’. Keywords: Information-Complexity conservation; Polignac’s conjecture; Riemann hypothesis; Twin prime conjecture Mathematics Subject Classification: 11A41, 11M26 1.
    [Show full text]
  • A-Primer-On-Prime-Numbers.Pdf
    A Primer on Prime Numbers Prime Numbers “Prime numbers are the very atoms of arithmetic. The primes are the jewels studded throughout the vast expanse of the infinite universe of numbers that mathematicians have studied down the centuries.” Marcus du Sautoy, The Music of the Primes 2 • Early Primes • Named Primes • Hunting for Primes • Visualizing Primes • Harnessing Primes 3 Ishango bone The Ishango bone is a bone tool, dated to the Upper Paleolithic era, about 18,000 to 20,000 BC. It is a dark brown length of bone, the fibula of a baboon, It has a series of tally marks carved in three columns running the length of the tool Note: image is 4 reversed A History and Exploration of Prime Numbers • In the book How Mathematics Happened: The First 50,000 Years, Peter Rudman argues that the development of the concept of prime numbers could have come about only after the concept of division, which he dates to after 10,000 BC, with prime numbers probably not being understood until about 500 BC. He also writes that "no attempt has been made to explain why a tally of something should exhibit multiples of two, prime numbers between 10 and 20,… Left column 5 https://en.wikipedia.org/wiki/Ishango_bone Euclid of Alexandria 325-265 B.C. • The only man to summarize all the mathematical knowledge of his times. • In Proposition 20 of Book IX of the Elements, Euclid proved that there are infinitely many prime numbers. https://en.wikipedia.org/wiki/Euclid 6 Eratosthenes of Cyrene 276-194 B.C.
    [Show full text]
  • Goulib Documentation Release 1.9.23
    Goulib Documentation Release 1.9.23 Ph. Guglielmetti, https://github.com/goulu/Goulib Jan 06, 2019 Contents 1 Requirements 3 2 Modules 5 2.1 Goulib.colors module..........................................6 2.2 Goulib.container module......................................... 11 2.3 Goulib.datetime2 module........................................ 15 2.4 Goulib.decorators module........................................ 25 2.5 Goulib.drawing module......................................... 26 2.6 Goulib.expr module........................................... 63 2.7 Goulib.geom module........................................... 71 2.8 Goulib.geom3d module......................................... 107 2.9 Goulib.graph module........................................... 116 2.10 Goulib.image module.......................................... 162 2.11 Goulib.interval module.......................................... 173 2.12 Goulib.itertools2 module......................................... 191 2.13 Goulib.markup module.......................................... 200 2.14 Goulib.math2 module.......................................... 217 2.15 Goulib.motion module.......................................... 232 2.16 Goulib.optim module........................................... 240 2.17 Goulib.piecewise module........................................ 248 2.18 Goulib.plot module............................................ 251 2.19 Goulib.polynomial module........................................ 252 2.20 Goulib.stats module..........................................
    [Show full text]
  • Conjectures of Twin Primes
    By: Christina Mantas Edited and Extended by: Nicole Gillum A prime number is a positive integer that has exactly two factors. • So 1 is not prime, 2 is, and 3 is and 4 isn‟t and so fourth • 2 is the smallest possible difference between two primes The question of whether or not there are infinitely many twin primes is one of the most elusive and longest-standing open questions in number theory. A Twin Prime is a pair of primes that differ by two. • Except for the pair (2, 3), 2 is the smallest possible difference between two primes. • Examples of Twin Primes are: (3,5),(5,7),(11,13),(17,19),(29,31),…,(821,823) In 1849, Alphonse de Polignac, a French mathematician formulated what is know as Polignac‟s Conjecture • Polignac‟s Conjecture states, “For every natural number k, there are infinitely many prime pairs p and q such that p-q=2k." • “There are infinitely many „prime gaps‟ of size 2k” The „prime gaps‟ meaning the difference between two successive prime numbers. The Twin Prime Conjecture is the “k=1” case of Polignac‟s Conjecture It states, “There are infinitely many primes p such that p+2 is also prime” The difference between two primes is called the “prime gap” The first 30 prime gaps are: [1,2,2,4,2,4,2,4,6,2,6,4,2,4,6,6,2,6,4,2,6,4, 6,8,4,2,4,2,4,14] • These represent the difference between (2, 3), (3, 5), (5, 7), and so forth.
    [Show full text]
  • BE-TWEEN TWO WORLDS: a CONTENT ANALYSIS of TWEEN TELEVISION PROGRAMMING by Ashton Gerding a Thesis Submitted to the Faculty of T
    BE-TWEEN TWO WORLDS: A CONTENT ANALYSIS OF TWEEN TELEVISION PROGRAMMING by Ashton Gerding A thesis submitted to the Faculty of the University of Delaware in partial fulfillment of the requirements for the degree of Master of Arts in Communication Summer 2011 Copyright 2011 Ashton Gerding All Rights Reserved BE-TWEEN TWO WORLDS: A CONTENT ANALYSIS OF TWEEN TELEVISION PROGRAMMING by Ashton Gerding Approved: __________________________________________________________ Nancy Signorielli, Ph.D. Professor in charge of thesis on behalf of the Advisory Committee Approved: __________________________________________________________ Elizabeth M. Perse, Ph.D. Chair of the Department of Communication Approved: __________________________________________________________ George H. Watson, Ph.D. Dean of the College of Arts and Sciences Approved: __________________________________________________________ Charles G. Riordan, Ph.D. Vice Provost for Graduate and Professional Education ACKNOWLEDGMENTS I would like to thank the many people who helped me along this journey. First and foremost, I must express my deepest gratitude to Dr. Nancy Signorielli. You put innumerable hours into this thesis and into my development as a scholar. Additionally, you listened patiently too all of my ideas and concerns, calmed my nerves, and somehow convinced me that I could do it. Your unwavering dedication to this project and to my learning, even through the toughest of times, is sincerely appreciated. Finally, you were so very kind to me and cared about me as an individual. You are everything that I could hope for in an advisor, and I am truly grateful that I had the opportunity to know and work with you. To Dr. Betsy Perse, thank you for your many contributions to this project and for your insightful career and life advice.
    [Show full text]