Talent s error. of Geometry". He was active in Alexandria during the reign. of Ptolemy I ( BC). His Elements is one of the most influential

Size: px
Start display at page:

Download "Talent s error. of Geometry". He was active in Alexandria during the reign. of Ptolemy I ( BC). His Elements is one of the most influential"

Transcription

1 Talent s error 1. Introduce Euclid was a Gree mathematician, often referred to as the "Father of Geometry". He was active in Alexandria during the reign of Ptolemy I ( BC). His Elements is one of the most influential wors in the history of mathematics, serving as the main textboo for teaching mathematics(esecially geometry) from the time of its ublication until the late 19th or early 20th century. In the Elements, Euclid deduced the rinciles of what is now called Euclidean geometry from a small set of axioms. Euclid also wrote wors on ersective, conic sections, sherical geometry, number theory and rigor. His methodology has also influenced many great scientists. Most conclusions of a mathematical talent are correct. Peole adore him. But if a talent has made an imercetible mistae, most eole will trust it was correct also. 2. Prime is infinite One of Euclid s famous roof is rime is infinite. Suose rime is finite, P = { 2, 3, 5 }. Constructing a number + 1 = All of 2, 3, 5,, can t divide

2 + 1. Either 1 + is a bigger rime or + 1 is a comosite number that can resolve a rime being bigger than. So suosition is false, rime is infinite. It s a clever roof. 3. Prime is finite The interesting thing is lie below. Suose rime is infinite. Constructing a number = /( -1), is a rime, is not an integer, otherwise ( -1) can divide, then has found a divisor and is a comosite number. Because rime is infinite, = lim / ( 1) 1 - =, is an integer. ( -1) can divide found a divisor and is a comosite number. So suosition is false, rime is finite., then has 4. Who is wrong Both rime being finite and rime being infinite are correct? One of they must be wrong. But who is correct? Most eole will say rime being infinite is correct. But why, I thin the only reason is that it s Euclid s roof, no other more strong reason. Firstly, let me mae an exeriment. The density of rime ((count of rime)/(count of odd number)) is oscillating to trend to 0 when odd number is increasing.

3 Prime density data table lie below, which dislays the regularity very clearly. 2K+1 sum(rime)/k sum( ) / K sum( ) / K

4 The function lot lie below. finite. From the exeriment, it seems the evidence suorts rime being

5 5. Talent s error To find out the root cause, I have checed both roofs carefully. Please read the roof again. Constructing a number + 1 = All of 2, 3, 5,, can t divide 1 +. Either + 1 is a bigger rime or 1 + is a comosite number that can resolve a rime being bigger than. The bold section has included 3 rerequisites. 1. A number is either a rime, or a comosite number. 2. Nature number can never reach infinite. 3. A comosite number can always resolve a rime. For rerequisite 1, it s easy to find an excetion. Neither 1 is rime, nor comosite number. Is infinite a comosite number? Many eole don t thin infinite is a number. Then what s infinite? For rerequisite 2, if nature number can never reach infinite, does the distance from infinite become more and more big or small? If the distance from infinite is constant, it means that C = -n = -(n+1) Þ = -1 Þ = ( -1) -1 = -2, Þ = -n = C Þ C =, If the distance from infinite becomes more and more big, it means that -n < -(n+1) Þ +1 <, Þ 1 = lim( n+ 1) / n =( +1)/ <1Þ1<1. n

6 If the distance from infinite becomes more and more small, when ( ) < e, e is smaller than any number, it means it can be smaller than 1. If e <1, then ( >, Þ 1 + has exceeded infinite. ) < e <1, Þ + 1 = For rerequisite 3, When + 1 >, neither it is a rime, nor can resolve a bigger rime. So Euclid s roof is wrong. 6. Conclusion A great mathematician can hardly mae a mistae, but if it s an imercetible mistae, which will mislead mathematician for a long time because of eole s adoration. Though Euclid is a great mathematician, he is a human being also. Both the exeriment and logic analyze have demonstrated the famous roof is wrong. Whatever, Euclid is a mathematician with my full resects for his great achievements.

7 References [1] John Friedlander and Henry Iwaniec, The olynomial X2+ Y4 catures its rimes, 148 (1998), [2] John Friedlander and Henry Iwaniec, Asymtotic sieve for rimes, 148 (1998), [3] University of TongJi,Higher mathematics, 465(1991) [4] E. Bombieri, The asymtotic sieve, Mem. Acad. Naz. dei XL, 1/2 (1976), [5] W. Due, J.B. Friedlander, and H. Iwaniec, Equidistribution of roots of a quadratic congruence to rime moduli, Ann. of Math. 141 (1995), [6] C.L. Stewart and J. To, On rans of twists of ellitic curves and ower-free values of binary forms, J. Amer. Math. Soc. 8 (1995), [7] E. Fouvry and H. Iwaniec, Gaussian rimes, Acta Arith. 79 (1997), [8] J. Friedlander and H. Iwaniec, Bombieri's sieve, in Analytic Number Theory, Proc. Halberstam Conf., Allerton Par Illnois, June 1995, ed. B. C. Berndt et al., , BirhÄauser (Boston), [9], The olynomial X2 + Y 4 catures its rimes, Ann. of Math. 148 (1998), [10] G. Harman, On the distribution of modulo one, J. London Math. Soc. 27 (1983),9-18.

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Solutions Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. A prime number

More information

CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN

CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN Int. J. Number Theory 004, no., 79-85. CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN School of Mathematical Sciences Huaiyin Normal University Huaian, Jiangsu 00, P.R. China zhihongsun@yahoo.com

More information

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers

Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Math Circle Beginners Group February 28, 2016 Euclid and Prime Numbers Warm-up Problems 1. What is a prime number? Give an example of an even prime number and an odd prime number. (a) Circle the prime

More information

Legendre polynomials and Jacobsthal sums

Legendre polynomials and Jacobsthal sums Legendre olynomials and Jacobsthal sums Zhi-Hong Sun( Huaiyin Normal University( htt://www.hytc.edu.cn/xsjl/szh Notation: Z the set of integers, N the set of ositive integers, [x] the greatest integer

More information

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,

More information

Research Statement. Enrique Treviño. M<n N+M

Research Statement. Enrique Treviño. M<n N+M Research Statement Enrique Treviño My research interests lie in elementary analytic number theory. Most of my work concerns finding explicit estimates for character sums. While these estimates are interesting

More information

On the Diophantine Equation x 2 = 4q n 4q m + 9

On the Diophantine Equation x 2 = 4q n 4q m + 9 JKAU: Sci., Vol. 1 No. 1, : 135-141 (009 A.D. / 1430 A.H.) On the Diohantine Equation x = 4q n 4q m + 9 Riyadh University for Girls, Riyadh, Saudi Arabia abumuriefah@yahoo.com Abstract. In this aer, we

More information

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...} WORKSHEET ON NUMBERS, MATH 215 FALL 18(WHYTE) We start our study of numbers with the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } and their subset of natural numbers: N = {1, 2, 3,...} For now we will not

More information

SQUARE PATTERNS AND INFINITUDE OF PRIMES

SQUARE PATTERNS AND INFINITUDE OF PRIMES SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following patterns for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2 mod

More information

MATH342 Practice Exam

MATH342 Practice Exam MATH342 Practice Exam This exam is intended to be in a similar style to the examination in May/June 2012. It is not imlied that all questions on the real examination will follow the content of the ractice

More information

Math 261 Exam 2. November 7, The use of notes and books is NOT allowed.

Math 261 Exam 2. November 7, The use of notes and books is NOT allowed. Math 261 Eam 2 ovember 7, 2018 The use of notes and books is OT allowed Eercise 1: Polynomials mod 691 (30 ts In this eercise, you may freely use the fact that 691 is rime Consider the olynomials f( 4

More information

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

GENERALIZING THE TITCHMARSH DIVISOR PROBLEM

GENERALIZING THE TITCHMARSH DIVISOR PROBLEM GENERALIZING THE TITCHMARSH DIVISOR PROBLEM ADAM TYLER FELIX Abstract Let a be a natural number different from 0 In 963, Linni roved the following unconditional result about the Titchmarsh divisor roblem

More information

ON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES

ON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES C O L L O Q U I U M M A T H E M A T I C U M VOL. * 0* NO. * ON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES BY YOUNESS LAMZOURI, M. TIP PHAOVIBUL and ALEXANDRU ZAHARESCU

More information

When do Fibonacci invertible classes modulo M form a subgroup?

When do Fibonacci invertible classes modulo M form a subgroup? Calhoun: The NPS Institutional Archive DSace Reository Faculty and Researchers Faculty and Researchers Collection 2013 When do Fibonacci invertible classes modulo M form a subgrou? Luca, Florian Annales

More information

MA3H1 TOPICS IN NUMBER THEORY PART III

MA3H1 TOPICS IN NUMBER THEORY PART III MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced

More information

The sum of digits function in finite fields

The sum of digits function in finite fields The sum of digits function in finite fields Cécile Dartyge, András Sárközy To cite this version: Cécile Dartyge, András Sárközy. The sum of digits function in finite fields. Proceedings of the American

More information

Carmichael numbers with a totient of the form a 2 + nb 2

Carmichael numbers with a totient of the form a 2 + nb 2 Carmichael numbers with a totient of the form a 2 + nb 2 William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bankswd@missouri.edu Abstract Let ϕ be the Euler function.

More information

Jacobi symbols and application to primality

Jacobi symbols and application to primality Jacobi symbols and alication to rimality Setember 19, 018 1 The grou Z/Z We review the structure of the abelian grou Z/Z. Using Chinese remainder theorem, we can restrict to the case when = k is a rime

More information

RESEARCH STATEMENT OF LIANGYI ZHAO

RESEARCH STATEMENT OF LIANGYI ZHAO RESEARCH STATEMENT OF LIANGYI ZHAO I. Research Overview My research interests mainly lie in analytic number theory and include mean-value type theorems, exponential and character sums, L-functions, elliptic

More information

Diophantine Equations and Congruences

Diophantine Equations and Congruences International Journal of Algebra, Vol. 1, 2007, no. 6, 293-302 Diohantine Equations and Congruences R. A. Mollin Deartment of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada,

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively 6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise

More information

On pseudosquares and pseudopowers

On pseudosquares and pseudopowers On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie

More information

MATH10040: Numbers and Functions Homework 1: Solutions

MATH10040: Numbers and Functions Homework 1: Solutions MATH10040: Numbers and Functions Homework 1: Solutions 1. Prove that a Z and if 3 divides into a then 3 divides a. Solution: The statement to be proved is equivalent to the statement: For any a N, if 3

More information

Almost All Palindromes Are Composite

Almost All Palindromes Are Composite Almost All Palindromes Are Comosite William D Banks Det of Mathematics, University of Missouri Columbia, MO 65211, USA bbanks@mathmissouriedu Derrick N Hart Det of Mathematics, University of Missouri Columbia,

More information

Algebraic number theory LTCC Solutions to Problem Sheet 2

Algebraic number theory LTCC Solutions to Problem Sheet 2 Algebraic number theory LTCC 008 Solutions to Problem Sheet ) Let m be a square-free integer and K = Q m). The embeddings K C are given by σ a + b m) = a + b m and σ a + b m) = a b m. If m mod 4) then

More information

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski

More information

THE LEAST PRIME QUADRATIC NONRESIDUE IN A PRESCRIBED RESIDUE CLASS MOD 4

THE LEAST PRIME QUADRATIC NONRESIDUE IN A PRESCRIBED RESIDUE CLASS MOD 4 THE LEAST PRIME QUADRATIC NONRESIDUE IN A PRESCRIBED RESIDUE CLASS MOD 4 PAUL POLLACK Abstract For all rimes 5, there is a rime quadratic nonresidue q < with q 3 (mod 4 For all rimes 3, there is a rime

More information

Class IX Chapter 5 Introduction to Euclid's Geometry Maths

Class IX Chapter 5 Introduction to Euclid's Geometry Maths Class IX Chapter 5 Introduction to Euclid's Geometry Maths Exercise 5.1 Question 1: Which of the following statements are true and which are false? Give reasons for your answers. (i) Only one line can

More information

Practice Final Solutions

Practice Final Solutions Practice Final Solutions 1. True or false: (a) If a is a sum of three squares, and b is a sum of three squares, then so is ab. False: Consider a 14, b 2. (b) No number of the form 4 m (8n + 7) can be written

More information

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c. Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

Properties of the Integers

Properties of the Integers Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun The Fibonacci Quarterly 44006, no., 11-130. PRIMALITY TESTS FOR NUMBERS OF THE FORM k m ± 1 Zhi-Hong Sun eartment of Mathematics, Huaiyin Teachers College, Huaian, Jiangsu 3001, P.R. China E-mail: zhsun@hytc.edu.cn

More information

University of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): 10.

University of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): 10. Booker, A. R., & Pomerance, C. (07). Squarefree smooth numbers and Euclidean rime generators. Proceedings of the American Mathematical Society, 45(), 5035-504. htts://doi.org/0.090/roc/3576 Peer reviewed

More information

Abstract. Roma Tre April 18 20, th Mini Symposium of the Roman Number Theory Association (RNTA) Michel Waldschmidt

Abstract. Roma Tre April 18 20, th Mini Symposium of the Roman Number Theory Association (RNTA) Michel Waldschmidt Roma Tre April 8 0, 08 4th Mini Symposium of the Roman umber Theory Association (RTA) Representation of integers by cyclotomic binary forms Michel Waldschmidt Institut de Mathématiques de Jussieu Paris

More information

Elementary Number Theory

Elementary Number Theory Elementary Number Theory 21.8.2013 Overview The course discusses properties of numbers, the most basic mathematical objects. We are going to follow the book: David Burton: Elementary Number Theory What

More information

When do the Fibonacci invertible classes modulo M form a subgroup?

When do the Fibonacci invertible classes modulo M form a subgroup? Annales Mathematicae et Informaticae 41 (2013). 265 270 Proceedings of the 15 th International Conference on Fibonacci Numbers and Their Alications Institute of Mathematics and Informatics, Eszterházy

More information

Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 32 (2016), ISSN

Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 32 (2016), ISSN Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 3 06, 3 3 www.emis.de/journals ISSN 786-009 A NOTE OF THREE PRIME REPRESENTATION PROBLEMS SHICHUN YANG AND ALAIN TOGBÉ Abstract. In this note, we

More information

Math 5330 Spring Notes Prime Numbers

Math 5330 Spring Notes Prime Numbers Math 5330 Sring 208 Notes Prime Numbers The study of rime numbers is as old as mathematics itself. This set of notes has a bunch of facts about rimes, or related to rimes. Much of this stuff is old dating

More information

Sundaram's Sieve. by Julian Havil. Sundaram's Sieve

Sundaram's Sieve. by Julian Havil. Sundaram's Sieve 1997 2009, Millennium Mathematics Project, University of Cambridge. Permission is granted to print and copy this page on paper for non commercial use. For other uses, including electronic redistribution,

More information

FERMAT S TEST KEITH CONRAD

FERMAT S TEST KEITH CONRAD FERMAT S TEST KEITH CONRAD 1. Introduction Fermat s little theorem says for prime p that a p 1 1 mod p for all a 0 mod p. A naive extension of this to a composite modulus n 2 would be: for all a 0 mod

More information

ON THE RESIDUE CLASSES OF (n) MODULO t

ON THE RESIDUE CLASSES OF (n) MODULO t #A79 INTEGERS 3 (03) ON THE RESIDUE CLASSES OF (n) MODULO t Ping Ngai Chung Deartment of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts briancn@mit.edu Shiyu Li Det of Mathematics,

More information

8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

More information

We introduce one more operation on sets, perhaps the most important

We introduce one more operation on sets, perhaps the most important 11. The power set Please accept my resignation. I don t want to belong to any club that will accept me as a member. Groucho Marx We introduce one more operation on sets, perhaps the most important one:

More information

NOTES ON RAMANUJAN'S SINGULAR MODULI. Bruce C. Berndt and Heng Huat Chan. 1. Introduction

NOTES ON RAMANUJAN'S SINGULAR MODULI. Bruce C. Berndt and Heng Huat Chan. 1. Introduction NOTES ON RAMANUJAN'S SINGULAR MODULI Bruce C. Berndt Heng Huat Chan 1. Introduction Singular moduli arise in the calculation of class invariants, so we rst dene the class invariants of Ramanujan Weber.

More information

SOME REMARKS ON ARTIN'S CONJECTURE

SOME REMARKS ON ARTIN'S CONJECTURE Canad. Math. Bull. Vol. 30 (1), 1987 SOME REMARKS ON ARTIN'S CONJECTURE BY M. RAM MURTY AND S. SR1NIVASAN ABSTRACT. It is a classical conjecture of E. Artin that any integer a > 1 which is not a perfect

More information

Number Theory Math 420 Silverman Exam #1 February 27, 2018

Number Theory Math 420 Silverman Exam #1 February 27, 2018 Name: Number Theory Math 420 Silverman Exam #1 February 27, 2018 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name neatly at the top of this page. Write your final answer

More information

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

The inverse Goldbach problem

The inverse Goldbach problem 1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the

More information

LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS

LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS HELMUT MAIER AND MICHAEL TH. RASSIAS Abstract. We rove a modification as well as an imrovement

More information

On pseudosquares and pseudopowers

On pseudosquares and pseudopowers On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie

More information

CHAPTER 3. Congruences. Congruence: definitions and properties

CHAPTER 3. Congruences. Congruence: definitions and properties CHAPTER 3 Congruences Part V of PJE Congruence: definitions and properties Definition. (PJE definition 19.1.1) Let m > 0 be an integer. Integers a and b are congruent modulo m if m divides a b. We write

More information

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.

Mathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. 1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose

More information

Math 131 notes. Jason Riedy. 6 October, Linear Diophantine equations : Likely delayed 6

Math 131 notes. Jason Riedy. 6 October, Linear Diophantine equations : Likely delayed 6 Math 131 notes Jason Riedy 6 October, 2008 Contents 1 Modular arithmetic 2 2 Divisibility rules 3 3 Greatest common divisor 4 4 Least common multiple 4 5 Euclidean GCD algorithm 5 6 Linear Diophantine

More information

Math 3000 Section 003 Intro to Abstract Math Midterm 1

Math 3000 Section 003 Intro to Abstract Math Midterm 1 Math 3000 Section 003 Intro to Abstract Math Midterm 1 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Name: Points: Read all problems carefully and write

More information

BOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia

BOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia GLASNIK MATMATIČKI Vol. 39(59(2004, 199 205 BOUNDS FOR TH SIZ OF STS WITH TH PROPRTY D(n Andrej Dujella University of Zagreb, Croatia Abstract. Let n be a nonzero integer and a 1 < a 2 < < a m ositive

More information

The prime number is a natural number greater than 1, is divisible by itself and the only one.

The prime number is a natural number greater than 1, is divisible by itself and the only one. The prime number is a natural number greater than 1, is divisible by itself and the only one. And a set of prime numbers is finished. Euclid has proved that in 300 BC. Most Greeks did not consider the

More information

COMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635

COMP239: Mathematics for Computer Science II. Prof. Chadi Assi EV7.635 COMP239: Mathematics for Computer Science II Prof. Chadi Assi assi@ciise.concordia.ca EV7.635 The Euclidean Algorithm The Euclidean Algorithm Finding the GCD of two numbers using prime factorization is

More information

1. Introduction. = (2n)! (n N)

1. Introduction. = (2n)! (n N) Included in: Combinatorial Additive Number Theory: CANT 2011 2012 (edited by M.B. Nathanson, Sringer Proc. in Math. & Stat., Vol. 101, Sringer, New Yor, 2014,. 257 312. ON SUMS RELATED TO CENTRAL BINOMIAL

More information

Some sophisticated congruences involving Fibonacci numbers

Some sophisticated congruences involving Fibonacci numbers A tal given at the National Center for Theoretical Sciences (Hsinchu, Taiwan; July 20, 2011 and Shanghai Jiaotong University (Nov. 4, 2011 Some sohisticated congruences involving Fibonacci numbers Zhi-Wei

More information

The theory of numbers

The theory of numbers 1 AXIOMS FOR THE INTEGERS 1 The theory of numbers UCU Foundations of Mathematics course 2017 Author: F. Beukers 1 Axioms for the integers Roughly speaking, number theory is the mathematics of the integers.

More information

arxiv: v1 [math.nt] 9 Sep 2015

arxiv: v1 [math.nt] 9 Sep 2015 REPRESENTATION OF INTEGERS BY TERNARY QUADRATIC FORMS: A GEOMETRIC APPROACH GABRIEL DURHAM arxiv:5090590v [mathnt] 9 Se 05 Abstract In957NCAnkenyrovidedanewroofofthethreesuarestheorem using geometry of

More information

Notes: Pythagorean Triples

Notes: Pythagorean Triples Math 5330 Spring 2018 Notes: Pythagorean Triples Many people know that 3 2 + 4 2 = 5 2. Less commonly known are 5 2 + 12 2 = 13 2 and 7 2 + 24 2 = 25 2. Such a set of integers is called a Pythagorean Triple.

More information

EULER S THEOREM KEITH CONRAD

EULER S THEOREM KEITH CONRAD EULER S THEOREM KEITH CONRAD. Introduction Fermat s little theorem is an important property of integers to a prime modulus. Theorem. (Fermat). For prime p and any a Z such that a 0 mod p, a p mod p. If

More information

MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.

MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described

More information

4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus...

4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus... PREFACE These notes have been prepared by Dr Mike Canfell (with minor changes and extensions by Dr Gerd Schmalz) for use by the external students in the unit PMTH 338 Number Theory. This booklet covers

More information

Series Handout A. 1. Determine which of the following sums are geometric. If the sum is geometric, express the sum in closed form.

Series Handout A. 1. Determine which of the following sums are geometric. If the sum is geometric, express the sum in closed form. Series Handout A. Determine which of the following sums are geometric. If the sum is geometric, exress the sum in closed form. 70 a) k= ( k ) b) 50 k= ( k )2 c) 60 k= ( k )k d) 60 k= (.0)k/3 2. Find the

More information

#A45 INTEGERS 12 (2012) SUPERCONGRUENCES FOR A TRUNCATED HYPERGEOMETRIC SERIES

#A45 INTEGERS 12 (2012) SUPERCONGRUENCES FOR A TRUNCATED HYPERGEOMETRIC SERIES #A45 INTEGERS 2 (202) SUPERCONGRUENCES FOR A TRUNCATED HYPERGEOMETRIC SERIES Roberto Tauraso Diartimento di Matematica, Università di Roma Tor Vergata, Italy tauraso@mat.uniroma2.it Received: /7/, Acceted:

More information

All About Numbers Definitions and Properties

All About Numbers Definitions and Properties All About Numbers Definitions and Properties Number is a numeral or group of numerals. In other words it is a word or symbol, or a combination of words or symbols, used in counting several things. Types

More information

Math 3320 Problem Set 10 Solutions 1

Math 3320 Problem Set 10 Solutions 1 Math 3320 Problem Set 10 Solutions 1 1. For the form Q(x,y)=x 2 +xy+y 2 do the following things: (a) Draw enough of the topograph to show all the values less than 100 that occur in the topograph. You do

More information

Intermediate Math Circles March 6, 2013 Number Theory I

Intermediate Math Circles March 6, 2013 Number Theory I What is Number Theory? Intermediate Math Circles March 6, 01 Number Theory I A branch of mathematics where mathematicians examine and study patterns found within the natural number set (positive integers).

More information

ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION

ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION JOSEPH H. SILVERMAN Acknowledgements Page vii Thanks to the following eole who have sent me comments and corrections

More information

On the Greatest Prime Divisor of N p

On the Greatest Prime Divisor of N p On the Greatest Prime Divisor of N Amir Akbary Abstract Let E be an ellitic curve defined over Q For any rime of good reduction, let E be the reduction of E mod Denote by N the cardinality of E F, where

More information

Primes. Rational, Gaussian, Industrial Strength, etc. Robert Campbell 11/29/2010 1

Primes. Rational, Gaussian, Industrial Strength, etc. Robert Campbell 11/29/2010 1 Primes Rational, Gaussian, Industrial Strength, etc Robert Campbell 11/29/2010 1 Primes and Theory Number Theory to Abstract Algebra History Euclid to Wiles Computation pencil to supercomputer Practical

More information

Infinitely Many Insolvable Diophantine Equations

Infinitely Many Insolvable Diophantine Equations ACKNOWLEDGMENT. After this aer was submitted, the author received messages from G. D. Anderson and M. Vuorinen that concerned [10] and informed him about references [1] [7]. He is leased to thank them

More information

SIGN CHANGES OF COEFFICIENTS OF HALF INTEGRAL WEIGHT MODULAR FORMS

SIGN CHANGES OF COEFFICIENTS OF HALF INTEGRAL WEIGHT MODULAR FORMS SIGN CHANGES OF COEFFICIENTS OF HALF INTEGRAL WEIGHT MODULAR FORMS JAN HENDRIK BRUINIER AND WINFRIED KOHNEN Abstract. For a half integral weight modular form f we study the signs of the Fourier coefficients

More information

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p,

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p, 13. Quadratic Residues We now turn to the question of when a quadratic equation has a solution modulo m. The general quadratic equation looks like ax + bx + c 0 mod m. Assuming that m is odd or that b

More information

Mersenne and Fermat Numbers

Mersenne and Fermat Numbers NUMBER THEORY CHARLES LEYTEM Mersenne and Fermat Numbers CONTENTS 1. The Little Fermat theorem 2 2. Mersenne numbers 2 3. Fermat numbers 4 4. An IMO roblem 5 1 2 CHARLES LEYTEM 1. THE LITTLE FERMAT THEOREM

More information

Polynomial analogues of Ramanujan congruences for Han s hooklength formula

Polynomial analogues of Ramanujan congruences for Han s hooklength formula Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition

More information

On the irreducibility of a polynomial associated with the Strong Factorial Conjecture

On the irreducibility of a polynomial associated with the Strong Factorial Conjecture On the irreducibility of a olynomial associated with the Strong Factorial Conecture Michael Filaseta Mathematics Deartment University of South Carolina Columbia, SC 29208 USA E-mail: filaseta@math.sc.edu

More information

Results of modern sieve methods in prime number theory and more

Results of modern sieve methods in prime number theory and more Results of modern sieve methods in prime number theory and more Karin Halupczok (WWU Münster) EWM-Conference 2012, Universität Bielefeld, 12 November 2012 1 Basic ideas of sieve theory 2 Classical applications

More information

Infinitely Many Quadratic Diophantine Equations Solvable Everywhere Locally, But Not Solvable Globally

Infinitely Many Quadratic Diophantine Equations Solvable Everywhere Locally, But Not Solvable Globally Infinitely Many Quadratic Diohantine Equations Solvable Everywhere Locally, But Not Solvable Globally R.A. Mollin Abstract We resent an infinite class of integers 2c, which turn out to be Richaud-Degert

More information

#26: Number Theory, Part I: Divisibility

#26: Number Theory, Part I: Divisibility #26: Number Theory, Part I: Divisibility and Primality April 25, 2009 This week, we will spend some time studying the basics of number theory, which is essentially the study of the natural numbers (0,

More information

Products of ratios of consecutive integers

Products of ratios of consecutive integers Products of ratios of consecutive integers Régis de la Bretèche, Carl Pomerance & Gérald Tenenbaum 27/1/23, 9h26 For Jean-Louis Nicolas, on his sixtieth birthday 1. Introduction Let {ε n } 1 n

More information

Characteristics of Fibonacci-type Sequences

Characteristics of Fibonacci-type Sequences Characteristics of Fibonacci-tye Sequences Yarden Blausa May 018 Abstract This aer resents an exloration of the Fibonacci sequence, as well as multi-nacci sequences and the Lucas sequence. We comare and

More information

Journal of Combinatorics and Number Theory 1(2009), no. 1, ON SUMS OF PRIMES AND TRIANGULAR NUMBERS. Zhi-Wei Sun

Journal of Combinatorics and Number Theory 1(2009), no. 1, ON SUMS OF PRIMES AND TRIANGULAR NUMBERS. Zhi-Wei Sun Journal of Combinatorics and Number Theory 1(009), no. 1, 65 76. ON SUMS OF PRIMES AND TRIANGULAR NUMBERS Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 10093, People s Republic of China

More information

MthEd/Math 300 Williams Fall 2011 Midterm Exam 3

MthEd/Math 300 Williams Fall 2011 Midterm Exam 3 Name: MthEd/Math 300 Williams Fall 2011 Midterm Exam 3 Closed Book / Closed Note. Answer all problems. You may use a calculator for numerical computations. Section 1: For each event listed in the first

More information

Congruences and Exponential Sums with the Euler Function

Congruences and Exponential Sums with the Euler Function Fields Institute Communications Volume 00, 0000 Congruences and Exonential Sums with the Euler Function William D. Banks Deartment of Mathematics, University of Missouri Columbia, MO 652 USA bbanks@math.missouri.edu

More information

Commutative Rings and Fields

Commutative Rings and Fields Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two

More information

Practice Final Solutions

Practice Final Solutions Practice Final Solutions 1. Find integers x and y such that 13x + 1y 1 SOLUTION: By the Euclidean algorithm: One can work backwards to obtain 1 1 13 + 2 13 6 2 + 1 1 13 6 2 13 6 (1 1 13) 7 13 6 1 Hence

More information

CITS2211 Discrete Structures (2017) Cardinality and Countability

CITS2211 Discrete Structures (2017) Cardinality and Countability CITS2211 Discrete Structures (2017) Cardinality and Countability Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets Reading Sections 45 and 81 84 of Mathematics

More information

Cool Results on Primes

Cool Results on Primes Cool Results on Primes LA Math Circle (Advanced) January 24, 2016 Recall that last week we learned an algorithm that seemed to magically spit out greatest common divisors, but we weren t quite sure why

More information

CSE 311: Foundations of Computing. Lecture 12: Two s Complement, Primes, GCD

CSE 311: Foundations of Computing. Lecture 12: Two s Complement, Primes, GCD CSE 311: Foundations of Computing Lecture 12: Two s Complement, Primes, GCD n-bit Unsigned Integer Representation Represent integer as sum of powers of 2: If 2 where each {0,1} then representation is b

More information

Chapter 7. Number Theory. 7.1 Prime Numbers

Chapter 7. Number Theory. 7.1 Prime Numbers Chapter 7 Number Theory 7.1 Prime Numbers Any two integers can be multiplied together to produce a new integer. For example, we can multiply the numbers four and five together to produce twenty. In this

More information

[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics

[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics 400 lecture note #2 [Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 1) Basics An argument is a sequence of statements ( s1, s2,, sn). All statements in an argument, excet for

More information

22. The Quadratic Sieve and Elliptic Curves. 22.a The Quadratic Sieve

22. The Quadratic Sieve and Elliptic Curves. 22.a The Quadratic Sieve 22. The Quadratic Sieve and Elliptic Curves 22.a The Quadratic Sieve Sieve methods for finding primes or for finding factors of numbers are methods by which you take a set P of prime numbers one by one,

More information

Nanjing Univ. J. Math. Biquarterly 32(2015), no. 2, NEW SERIES FOR SOME SPECIAL VALUES OF L-FUNCTIONS

Nanjing Univ. J. Math. Biquarterly 32(2015), no. 2, NEW SERIES FOR SOME SPECIAL VALUES OF L-FUNCTIONS Naning Univ. J. Math. Biquarterly 2205, no. 2, 89 28. NEW SERIES FOR SOME SPECIAL VALUES OF L-FUNCTIONS ZHI-WEI SUN Astract. Dirichlet s L-functions are natural extensions of the Riemann zeta function.

More information

arxiv:math/ v1 [math.nt] 3 Dec 2004

arxiv:math/ v1 [math.nt] 3 Dec 2004 arxiv:math/0412079v1 [math.nt] 3 Dec 2004 PRIMITIVE DIVISORS OF QUADRATIC POLYNOMIAL SEQUENCES G. EVEREST, S. STEVENS, D. TAMSETT AND T. WARD Abstract. We consider rimitive divisors of terms of integer

More information