0 Up votes0 Down votes

19 views2 pagesMar 09, 2014

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

Attribution Non-Commercial (BY-NC)

19 views

Attribution Non-Commercial (BY-NC)

- Hidden Figures: The American Dream and the Untold Story of the Black Women Mathematicians Who Helped Win the Space Race
- Hidden Figures Young Readers' Edition
- The Law of Explosive Growth: Lesson 20 from The 21 Irrefutable Laws of Leadership
- The E-Myth Revisited: Why Most Small Businesses Don't Work and
- The Wright Brothers
- The Power of Discipline: 7 Ways it Can Change Your Life
- The Other Einstein: A Novel
- The Kiss Quotient: A Novel
- State of Fear
- State of Fear
- The 10X Rule: The Only Difference Between Success and Failure
- Being Wrong: Adventures in the Margin of Error
- Algorithms to Live By: The Computer Science of Human Decisions
- The Black Swan
- Prince Caspian
- The Art of Thinking Clearly
- A Mind for Numbers: How to Excel at Math and Science Even If You Flunked Algebra
- The Last Battle
- The 6th Extinction
- HBR's 10 Must Reads on Strategy (including featured article "What Is Strategy?" by Michael E. Porter)

You are on page 1of 2

We try to develop basic results concerning prime numbers from scratch. The reader should be familiar with undergraduate algebra, but we will dene any needed concept except for the most basic ones, which include Groups, Rings and Ideals. Familiarity with algebra is only needed for the intuition about the approach. We will also assume that the reader knows the denitions of the natural numbers and integers, as an additive abelian monoid and a commutative unital ring respectively. All rings in this exposition are commutative and unital. Let us rst recall some features of the integers: Theorem 1. Let a, b Z. Then we can divide a by b with rest, that is there exist (x, r) Z2 such that a = bx + r. This division is unique, if we reqire 0 r < b. Proof. Let r be the smallest positive integer in a + (b). This means there exists an s Z such that r = a + bs. Then (r, x = s) is our required pair. This is uniqe, because if we take another pair (r , x ) such that a = bx + r , 0 r < b, then r a + (b). Thus r = r + bs for some s N0 . But if r = r then s = 0 and r r + b b, so r = r . Then we have bx + r = bx + r, so bx = bx and because Z has no zero divisors, x = x . Denition 1. Let p be a proper ideal of a ring R. It is called prime if S = R/p is an intergal domain, that is, S has no zero-divisors (and is nontrivial). Theorem 2. Let p be an ideal of a ring R. Then p is prime, if and only if for all a, b R such that a b p either a p or b p. Proof. Let the quotiont ring be integral, R R/p the canonical projection, and ab p. Then (ab) = 0 and (ab) = (a) (b). Thus either (a) = 0 a p or (b) = 0 b p. Now let a p or b p whenever ab p and consider the projection map R R/p again. Also, let r, s R/p such that rs = 0. This implies that every representative of rs is in p. Let r , s be representatives of r, s respectively, then r s p thus r p or s p. But then r = 0 or s = 0. We now want to dene prime numbers of Z. Recall that Z is a euclidian ring, so we have division with rest and also that Z is a PID. Denition 2. Let 0 = p Z. Then p is called prime number if (p) is a prime ideal. The set of all prime numbers is denoted P. Because Z is a PID, every prime ideal (except for the zero ideal) corresponds to a prime number. Thus we have a bijection P {0} Spec(Z). We need some further denitions: Denition 3. Let R be a ring. We say that a divides b, usually written a | b if b (a), that is there exists s R such that b = sa. If a doesnt divide b then we write a b if we want to emphasize this fact. In case of the integers, we usually restrict to positive numbers.

Theorem 3. Every n N\{1} is divisible by a prime. Proof. Suppose the contrary and let q be the smallest natural number such that q is not divisible by a prime. Then q is not a prime, because q | q . Now there exists a pair (a, b) N2 such that q | ab but q a, q b. Now let (a, b) a pair, such that ab st for any other such pair (s, t). Now divide b by q with rest: b = qx + r, r < q . Then we also have ab = aqx + ar ar = ab aqx and ar (q ) because ab (q ) and aqx (q ). But then ar < ab and q r (because r < q ). This is a contradiction to (a, b) being the minimal such pair.

- Ncert Solutions for Class 11 Maths Chapter_4_Principle_of_Mathematical_InduUploaded byRohit Kr Das
- textnow.pdfUploaded byJerry Lomeli
- On the Uniqueness of TrianglesUploaded byjojo2k
- A GENERALIZATION OF THE SMARANDACHE FUNCTION TO SEVERAL VARIABLES, by Norbert Hungerb¨uhler & Ernst SpeckerUploaded byAnonymous 0U9j6BLllB
- Advanced Ps SamplesUploaded byStuart Clark
- Finitely Generated Module GarrettUploaded byx420
- boolean.pdfUploaded byarathi sankar
- mathgen-1898293085Uploaded bya1134454
- mathgen-954076917.pdfUploaded byNoThank You
- ther empty, smoothly ordered vector spUploaded byNoThank You
- Zivari- KazempourUploaded byDumitru D. DRAGHIA
- ElevenUploaded byGath
- Computer ProgramsUploaded byViraj Kumar
- theory 7 silvio luchettiUploaded bySilvio Luchetti
- ALG2 HW1Uploaded byBin Chen
- Cohen-Macaulay of Ideal I2(G)Uploaded byIoan Degau
- SCIENTIA MAGNA, book series, Vol. 4, No. 2Uploaded byAnonymous 0U9j6BLllB
- Real Number PresentationUploaded byAnanta Mohanty
- 40107h19solUploaded byfree_prog
- bamo2000examsolUploaded byMary Johns
- Krattenthaler C, Rosengren H - On a Hyper Geometric Identity of Gelfand, Graev and Retakh - J. Comput. and Appl. Math. 160 (2003) 147-158Uploaded byRenee Bravo
- 1909.05283Uploaded byGaston GB
- L5Uploaded bysourcery22
- 15-22Uploaded byAninda Mukherjee
- Sample ProbUploaded byUnsubTomokazu
- Zero to InfinityUploaded byLalith Krishnan
- Gatto, Letterio - Schubert Calculus an Algebraic Introduction -IMPA (2005)Uploaded byFarias Israel
- Report RubricsUploaded byjmsomerville
- Gary's ThesisUploaded byJordan Blevins
- P-Adic Banach SpacesUploaded bydmtri

- copy of acitivity guide - multiplication moduloUploaded byapi-439626456
- C++ Programming ProblemsUploaded byDaisy Lagapa
- Teorija Na BroeviUploaded byMesir Abdiu
- Collecting relations for the Number Field Sieve in GF p p 6 qUploaded byAWh
- lecture5ws.pdfUploaded byUnknown Iam
- 08-0412Uploaded byopenid_AePkLAJc
- Divergence of Prime ReciprocalsUploaded bysiward8314315
- KaprekarUploaded byAmit
- 2.-QUADRATIC-EQUATIONS-AND-INEQUALITIES-EXERCISE.pdfUploaded byAnna Salim
- Http Www Campusgate Co in 2013 09 Open-sesame-new-tcs-questions-2014 HTMLUploaded byVenkatesh Gogineni
- PPR2006-Resonance the Work of Lagrange in Number Theory and AlgebraUploaded bychirpychirpy
- New Microsoft Office Word DocumentUploaded byFirdous Ahmad
- FORMULAS AND POLYNOMIALS WHICH GENERATE PRIMES AND FERMAT PSEUDOPRIMESUploaded byMia Amalia
- Manual Solution Mathematical Analysis for Business, Economics, and the Life and Social Sciences 12th EditionUploaded byraiondaisy
- Harvard algorithms cs124 notesUploaded byYamini Dasgupta
- SUBSETS OF REAL NUMBERS.pdfUploaded bySyaoran Li
- CS 310 (sec 20) - Spring 2005 - Midterm Exam (solutions)Uploaded byskdejhloiew
- Permutations and Combination Notes for Class 11 Maths Chapter 7Uploaded byKaleelur Rahman
- 12th National ISMO Class 6 Question Paper With SolutionsUploaded byEnginBasturk
- 7.PermutationUploaded bySuelly Sabri
- Cryptography Network Security Ch 2.pdfUploaded byFaizan ilyas
- Odd Perfect Numbers Are Greater Than 101500Uploaded byMuneer Hussain
- Ramanujan and Euler's ConstantUploaded byapi-26401608
- ProofUploaded byfatima hahsmi
- teach_notes_u01.pdfUploaded byammara shafique
- HKIMO SyllabusUploaded byYeap Chee Beng
- Apostol Analytic Number Theory SolutionsUploaded byJohn Nelson
- 10.1.1.140.6136Uploaded byOlivera Taneska
- Modular Arithmetic II ( Discrete Math )Uploaded byapi-33642484
- On Primitive Weird Numbers of the Form2 kpqUploaded byIOSRjournal

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.