Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/16283
DC FieldValue
dc.titleVinogradov's theorem and its generalization on primes in arithmetic progression
dc.contributor.authorWONG WEI PIN
dc.date.accessioned2010-04-08T11:03:04Z
dc.date.available2010-04-08T11:03:04Z
dc.date.issued2009-07-31
dc.identifier.citationWONG WEI PIN (2009-07-31). Vinogradov's theorem and its generalization on primes in arithmetic progression. ScholarBank@NUS Repository.
dc.identifier.urihttps://scholarbank.nus.edu.sg/handle/10635/16283
dc.description.abstractIn this thesis, we first study in details Vinogradov's elegant adaptation of the Hardy-Littlewood circle method in proving Vinogradov's theorem : every sufficiently large odd number is a sum of three prime numbers. After that, we generalize the Weak Goldbach's Conjecture to the quadratic fields : given a quadratic field K with discriminant d, there exists an integer a, such that every sufficient large odd number N congruent a mod d is a sum of norm of three prime ideals of K. We proceed on to prove this conjecture by proving Vinogadrov's theorem for prime in arithmetic progression, i.e. let x1; x2; x3 and y be integers such that 1 < y and (xi; y) = 1 for i = 1; 2; 3, then for all sufficiently large odd integer N congruent to x1 + x2 + x3 mod y, there exist primes pi congruent xi mod y for i = 1; 2; 3, such that N = p1 + p2 + p3.
dc.language.isoen
dc.subjectVinogradov's theorem generalization primes arithmetic progression
dc.typeThesis
dc.contributor.departmentMATHEMATICS
dc.contributor.supervisorCHIN CHEE WHYE
dc.description.degreeMaster's
dc.description.degreeconferredMASTER OF SCIENCE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Master's Theses (Open)

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
MasterThesis.pdf553.16 kBAdobe PDF

OPEN

NoneView/Download

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.