Rational Points On Elliptic Curves - Solutions. (i) Throughout, we ve been looking at elliptic curves in the general form. y 2 = x 3 + Ax + B

Size: px
Start display at page:

Download "Rational Points On Elliptic Curves - Solutions. (i) Throughout, we ve been looking at elliptic curves in the general form. y 2 = x 3 + Ax + B"

Transcription

1 Rational Points On Elliptic Curves - Solutions (Send corrections to cbruni@uwaterloo.ca) (i) Throughout, we ve been looking at elliptic curves in the general form y 2 = x 3 + Ax + B However we did claim that an elliptic curve has equation of the form y 2 equals a cubic (with nonzero discriminant). Show that if we have an elliptic curve of the form y 2 = x 3 + Rx 2 + Sx + T Then we can shift coordinates so that we get an equation that eliminates the x 2 term. Hint: Send (x, y) on the elliptic curve y 2 = x 3 + Rx 2 + Sx + T to the value (x R/3, y) then simplify. Note: In the form y 2 = x 3 +Ax+B, the discriminant is given by = 16(4A 3 27B 2 ). Also note that this trick doesn t always work in finite fields (and the definition of an elliptic curve needs to be a bit more general to work for Z 2 and Z 3 but I ll leave this for interest reading). Solution: Proceeding as the hint suggests, we have (x R/3) 3 + R(x R/3) 2 + S(x R/3) + T = x 3 Rx 2 + R 2 x/3 R 3 /27 + Rx 2 2R 2 x/3 + R 3 /9 + Sx RS/3 + T = x 3 + (S R 2 /3)x R 3 /27 + R 3 /9 RS/3 + T (ii) What is the discriminant of an elliptic curve associated to the congruent number problem y 2 = x 3 N 2 x? Solution: = 16(4( N 2 ) 3 27(0) 2 ) = 64N 6 (iii) Compute the following values in their respective fields. Reduce to the least nonnegative integer in Z in Z in Z in Z 5 5. (1)(2)(3)(4) in Z 5 6. (1)(2)(3)(4)(5)(6) in Z 7 1

2 7. (1)(2)(3)(4)(5)(6)(7)(8)(9)(10) in Z 11 (Do you notice a pattern? Can you prove it?) Solution: (mod 7) (mod 7) (mod 11) in Z 5 (Can you prove in general if a c (mod p) then a k c k (mod p)?) 5. (1)(2)(3)(4) 1 (mod 5) in Z 5 6. (1)(2)(3)(4)(5)(6) 1 (mod 7) in Z 7 7. (1)(2)(3)(4)(5)(6)(7)(8)(9)(10) 1 (mod 11) in Z 11 (The pattern in the last three questions is known as Wilson s Theorem) (iv) Find the number of points on the elliptic curve y 2 = x 3 + x + 1 over the finite fields Z 3, Z 7, Z 11 and Z 13. Hint: Sometimes it s easier to compute a value using an equivalent negative value. For examine in Z 11 the number 10 1 (mod 11). Solution: For both this and the next problem, it will help us to compute the squares in Z p. The table below helps us achieve this y y 2 (mod 3) (mod 5) (mod 7) (mod 11) (mod 13) (There is lots of symmetry in the above table!) Notice that there are many unnecessary entries above (for example, there are only three numbers in Z 3 so we needed to only compute the squares of 0, 1 and 2). 2

3 In Z 3, we have that for x = 0, 1, 2, y 2 = (0) 3 + (0) + 1 = 1 1 (mod 3) y 2 = (1) 3 + (1) + 1 = 3 0 (mod 3) y 2 = (2) 3 + (2) + 1 = 11 2 (mod 3) Hence we have that (0, 1), (0, 2) [since 1 and 2 squared give 1 in Z 3 ] and (1, 0) are the three solutions (plus the point at infinity). In Z 7, y 2 = (0) 3 + (0) + 1 = 1 1 (mod 7) y 2 = (1) 3 + (1) + 1 = 3 3 (mod 7) y 2 = (2) 3 + (2) + 1 = 11 4 (mod 7) y 2 = (3) 3 + (3) (mod 7) y 2 = (4) 3 + (4) (mod 7) y 2 = (5) 3 + (5) (mod 7) y 2 = (6) 3 + (6) (mod 7) Only 0, 1, 2 and 4 are squares in Z 7 hence the points on this elliptic curve over Z 7 are (0, 1), (0, 6), (1, 0), (2, 2), (2, 5), (4, 3), (4, 4) and the point at infinity. In Z 11, y 2 = (0) 3 + (0) + 1 = 1 1 (mod 11) y 2 = (1) 3 + (1) + 1 = 3 3 (mod 11) y 2 = (2) 3 + (2) + 1 = 11 0 (mod 11) y 2 = (3) 3 + (3) (mod 11) y 2 = (4) 3 + (4) (mod 11) y 2 = (5) 3 + (5) (mod 11) y 2 = (6) 3 + (6) (mod 11) y 2 = (7) 3 + (7) (mod 11) y 2 = (8) 3 + (8) (mod 11) y 2 = (9) 3 + (9) (mod 11) y 2 = (10) 3 + (10) (mod 11) Only 0, 1, 3, 4, 5 and 9 are squares in Z 11 hence the points on this elliptic curve over Z 11 are (0, 1), (0, 10), (1, 5), (1, 6), (2, 0), (3, 3), (3, 8), (4, 5), (4, 6), (6, 5), (6, 6), (8, 2), (8, 9) and the point at infinity. 3

4 In Z 13, y 2 = (0) 3 + (0) + 1 = 1 1 (mod 13) y 2 = (1) 3 + (1) + 1 = 3 3 (mod 13) y 2 = (2) 3 + (2) + 1 = (mod 13) y 2 = (3) 3 + (3) (mod 13) y 2 = (4) 3 + (4) (mod 13) y 2 = (5) 3 + (5) (mod 13) y 2 = (6) 3 + (6) (mod 13) y 2 = (7) 3 + (7) (mod 13) y 2 = (8) 3 + (8) (mod 13) y 2 = (9) 3 + (9) (mod 13) y 2 = (10) 3 + (10) (mod 13) y 2 = (11) 3 + (11) (mod 13) y 2 = (12) 3 + (12) (mod 13) Only 0, 1, 3, 4, 9, 10 and 12 are squares in Z 13 hence the points on this elliptic curve over Z 13 are (0, 1), (0, 12), (1, 4), (1, 9), (4, 2), (4, 11), (5, 1), (5, 12), (7, 0), (8, 1), (8, 12), (10, 6), (10, 7), (11, 2), (11, 11), (12, 5), (12, 8) and the point at infinity. (v) Find the number of points on the elliptic curve y 2 = x 3 4x over the finite fields Z 3, Z 5 and Z 7. Solution: In Z 3, we have that for x = 0, 1, 2, y 2 = (0) 3 4(0) (mod 3) y 2 = (1) 3 4(1) (mod 3) y 2 = (2) 3 4(2) (mod 3) Hence we have that (0, 1), (0, 2), (1, 1), (1, 2) and the point at infinity are the solutions over Z 3. In Z 5, y 2 = (0) 3 4(0) (mod 5) y 2 = (1) 3 4(1) (mod 5) y 2 = (2) 3 4(2) (mod 5) y 2 = (3) 3 4(3) (mod 5) y 2 = (4) 3 4(4) (mod 5) Only 0, 1 and 4 are squares in Z 5 hence the points on this elliptic curve over Z 5 are (0, 1), (0, 4), (4, 1), (4, 4) and the point at infinity. 4

5 In Z 7, y 2 = (0) 3 4(0) (mod 7) y 2 = (1) 3 4(1) (mod 7) y 2 = (2) 3 4(2) (mod 7) y 2 = (3) 3 4(3) (mod 7) y 2 = (4) 3 4(4) (mod 7) y 2 = (5) 3 4(5) (mod 7) y 2 = (6) 3 4(6) (mod 7) Only 0, 1, 2 and 4 are squares in Z 7 hence the points on this elliptic curve over Z 7 are (0, 3), (0, 4), (2, 1), (2, 6), (3, 0), (4, 3), (4, 4), (6, 2), (6, 5) and the point at infinity. (vi) There are many algorithms available for computing rational points. Sage Math Cloud has some of these available. Using these for the curves y 2 = x 3 N 2 x with N = 13, 14 and 15, we find that y 2 = x x contains the point P = ( 36/25, 1938/125) y 2 = x x contains the point Q = (18, 48) y 2 = x x contains the point R = ( 9, 36) Doubling each points gives 2P = ( / , / ) 2Q = (4225/144, /1728) 2R = (289/16, 2737/64) See if you can find the associated triangles in the case of N = 14 and N = 15. The case even when N = 13 is far too large to want to do by hand! Hint: You may want to use a calculator. Solution: For N = 14, we see that x = 4225/144 and y = /1728. Let u = x = 65/12, d = 12 and v = y/u = 3713/144. If we follow the steps from the notes, we can see that a = d/2( x + N + x N) = 63 and b = d/2( x + N x N) = 16. Thus, the triangle should have side lengths 2a/d = b/d = 8 3 2u = For N = 15, we see that x = 289/16 and y = 2737/64. Let u = x = 17/4, d = 4 and v = y/u = 161/16. If we follow the steps from the notes, we can see that a = d/2( x + N + x N) = 63 and b = d/2( x + N x N) = 16. Thus, the triangle should have side lengths 2a/d = 15 2b/d = 4 2u = (For N = 13, the a and b values are and respectively and the u value is / Yikes!) 5

Applications of Fermat s Little Theorem and Congruences

Applications of Fermat s Little Theorem and Congruences Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4

More information

Carmen s Core Concepts (Math 135)

Carmen s Core Concepts (Math 135) Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 7 1 Congruence Definition 2 Congruence is an Equivalence Relation (CER) 3 Properties of Congruence (PC) 4 Example 5 Congruences

More information

Modular arithmetic Math 2320

Modular arithmetic Math 2320 Modular arithmetic Math 220 Fix an integer m 2, called the modulus. For any other integer a, we can use the division algorithm to write a = qm + r. The reduction of a modulo m is the remainder r resulting

More information

Practice Midterm 2 Solutions

Practice Midterm 2 Solutions Practice Midterm 2 Solutions May 30, 2013 (1) We want to show that for any odd integer a coprime to 7, a 3 is congruent to 1 or 1 mod 7. In fact, we don t need the assumption that a is odd. By Fermat s

More information

Congruence. Solving linear congruences. A linear congruence is an expression in the form. ax b (modm)

Congruence. Solving linear congruences. A linear congruence is an expression in the form. ax b (modm) Congruence Solving linear congruences A linear congruence is an expression in the form ax b (modm) a, b integers, m a positive integer, x an integer variable. x is a solution if it makes the congruence

More information

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand. Midterm #2: practice MATH 311 Intro to Number Theory midterm: Thursday, Oct 20 Please print your name: Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating

More information

The congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.

The congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation. Congruences A congruence is a statement about divisibility. It is a notation that simplifies reasoning about divisibility. It suggests proofs by its analogy to equations. Congruences are familiar to us

More information

Math 127: Equivalence Relations

Math 127: Equivalence Relations Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other

More information

MODULAR ARITHMETIC II: CONGRUENCES AND DIVISION

MODULAR ARITHMETIC II: CONGRUENCES AND DIVISION MODULAR ARITHMETIC II: CONGRUENCES AND DIVISION MATH CIRCLE (BEGINNERS) 02/05/2012 Modular arithmetic. Two whole numbers a and b are said to be congruent modulo n, often written a b (mod n), if they give

More information

ALGEBRA: Chapter I: QUESTION BANK

ALGEBRA: Chapter I: QUESTION BANK 1 ALGEBRA: Chapter I: QUESTION BANK Elements of Number Theory Congruence One mark questions: 1 Define divisibility 2 If a b then prove that a kb k Z 3 If a b b c then PT a/c 4 If a b are two non zero integers

More information

University of British Columbia. Math 312, Midterm, 6th of June 2017

University of British Columbia. Math 312, Midterm, 6th of June 2017 University of British Columbia Math 312, Midterm, 6th of June 2017 Name (please be legible) Signature Student number Duration: 90 minutes INSTRUCTIONS This test has 7 problems for a total of 100 points.

More information

Math 412: Number Theory Lecture 6: congruence system and

Math 412: Number Theory Lecture 6: congruence system and Math 412: Number Theory Lecture 6: congruence system and classes Gexin Yu gyu@wm.edu College of William and Mary Chinese Remainder Theorem Chinese Remainder Theorem: let m 1, m 2,..., m k be pairwise coprimes.

More information

SOLUTIONS TO PROBLEM SET 5. Section 9.1

SOLUTIONS TO PROBLEM SET 5. Section 9.1 SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3

More information

Math 3560 HW Set 6. Kara. October 17, 2013

Math 3560 HW Set 6. Kara. October 17, 2013 Math 3560 HW Set 6 Kara October 17, 013 (91) Let I be the identity matrix 1 Diagonal matrices with nonzero entries on diagonal form a group I is in the set and a 1 0 0 b 1 0 0 a 1 b 1 0 0 0 a 0 0 b 0 0

More information

6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method

6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method Exercises Exercises 1. Show that 15 is an inverse of 7 modulo 26. 2. Show that 937 is an inverse of 13 modulo 2436. 3. By inspection (as discussed prior to Example 1), find an inverse of 4 modulo 9. 4.

More information

Cryptography Math 1580 Silverman First Hour Exam Mon Oct 2, 2017

Cryptography Math 1580 Silverman First Hour Exam Mon Oct 2, 2017 Name: Cryptography Math 1580 Silverman First Hour Exam Mon Oct 2, 2017 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name legibly at the top of this page. No calculators

More information

LECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.

LECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. LECTURE 3: CONGRUENCES 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. Definition 1.1. Suppose that a, b Z and m N. We say that a is congruent to

More information

Solutions for the Practice Final

Solutions for the Practice Final Solutions for the Practice Final 1. Ian and Nai play the game of todo, where at each stage one of them flips a coin and then rolls a die. The person who played gets as many points as the number rolled

More information

Distribution of Primes

Distribution of Primes Distribution of Primes Definition. For positive real numbers x, let π(x) be the number of prime numbers less than or equal to x. For example, π(1) = 0, π(10) = 4 and π(100) = 25. To use some ciphers, we

More information

RMT 2015 Power Round Solutions February 14, 2015

RMT 2015 Power Round Solutions February 14, 2015 Introduction Fair division is the process of dividing a set of goods among several people in a way that is fair. However, as alluded to in the comic above, what exactly we mean by fairness is deceptively

More information

Solutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00

Solutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00 18.781 Solutions to Problem Set 6 - Fall 008 Due Tuesday, Oct. 1 at 1:00 1. (Niven.8.7) If p 3 is prime, how many solutions are there to x p 1 1 (mod p)? How many solutions are there to x p 1 (mod p)?

More information

Modular Arithmetic. claserken. July 2016

Modular Arithmetic. claserken. July 2016 Modular Arithmetic claserken July 2016 Contents 1 Introduction 2 2 Modular Arithmetic 2 2.1 Modular Arithmetic Terminology.................. 2 2.2 Properties of Modular Arithmetic.................. 2 2.3

More information

CLASS NOTES. A mathematical proof is an argument which convinces other people that something is true.

CLASS NOTES. A mathematical proof is an argument which convinces other people that something is true. Propositional Statements A mathematical proof is an argument which convinces other people that something is true. The implication If p then q written as p q means that if p is true, then q must also be

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets

More information

Quadratic Residues. Legendre symbols provide a computational tool for determining whether a quadratic congruence has a solution. = a (p 1)/2 (mod p).

Quadratic Residues. Legendre symbols provide a computational tool for determining whether a quadratic congruence has a solution. = a (p 1)/2 (mod p). Quadratic Residues 4--015 a is a quadratic residue mod m if x = a (mod m). Otherwise, a is a quadratic nonresidue. Quadratic Recirocity relates the solvability of the congruence x = (mod q) to the solvability

More information

Modular Arithmetic and Doomsday

Modular Arithmetic and Doomsday Modular Arithmetic and Doomsday Blake Thornton Much of this is due directly to Joshua Zucker and Paul Zeitz. 1. Subtraction Magic Trick. While blindfolded, a magician asks a member from the audience to

More information

6.2 Modular Arithmetic

6.2 Modular Arithmetic 6.2 Modular Arithmetic Every reader is familiar with arithmetic from the time they are three or four years old. It is the study of numbers and various ways in which we can combine them, such as through

More information

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,

An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g., Binary exponentiation An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g., What are the last two digits of the number 2 284? In the absence

More information

#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick

#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick #A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS Thomas A. Plick tomplick@gmail.com Received: 10/5/14, Revised: 9/17/16, Accepted: 1/23/17, Published: 2/13/17 Abstract We show that out of the

More information

MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005

MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005 MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005 Deartment of Mathematical and Statistical Sciences University of Alberta Question 1. Find integers

More information

Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02

Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02 Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02 Public Polynomial congruences come up constantly, even when one is dealing with much deeper problems

More information

Solution: This is sampling without repetition and order matters. Therefore

Solution: This is sampling without repetition and order matters. Therefore June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes

More information

Constructions of Coverings of the Integers: Exploring an Erdős Problem

Constructions of Coverings of the Integers: Exploring an Erdős Problem Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions

More information

Wilson s Theorem and Fermat s Theorem

Wilson s Theorem and Fermat s Theorem Wilson s Theorem and Fermat s Theorem 7-27-2006 Wilson s theorem says that p is prime if and only if (p 1)! = 1 (mod p). Fermat s theorem says that if p is prime and p a, then a p 1 = 1 (mod p). Wilson

More information

Fermat s little theorem. RSA.

Fermat s little theorem. RSA. .. Computing large numbers modulo n (a) In modulo arithmetic, you can always reduce a large number to its remainder a a rem n (mod n). (b) Addition, subtraction, and multiplication preserve congruence:

More information

Chapter 2 Review WS Period: Date:

Chapter 2 Review WS Period: Date: Geometry Name: Chapter 2 Review WS Period: Date:. A transversal intersects two parallel lines. The measures of a pair of alternate interior angles are 5v and 2w. The measures of a pair of same-side exterior

More information

In this section, you will learn the basic trigonometric identities and how to use them to prove other identities.

In this section, you will learn the basic trigonometric identities and how to use them to prove other identities. 4.6 Trigonometric Identities Solutions to equations that arise from real-world problems sometimes include trigonometric terms. One example is a trajectory problem. If a volleyball player serves a ball

More information

1.6 Congruence Modulo m

1.6 Congruence Modulo m 1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number

More information

LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS

LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS DANIEL BACZKOWSKI, OLAOLU FASORANTI, AND CARRIE E. FINCH Abstract. In this paper, we show that there are infinitely many Sierpiński numbers in the sequence of

More information

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.

Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand. Midterm #: practice MATH Intro to Number Theory midterm: Thursday, Nov 7 Please print your name: Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating

More information

Discrete Math Class 4 ( )

Discrete Math Class 4 ( ) Discrete Math 37110 - Class 4 (2016-10-06) 41 Division vs congruences Instructor: László Babai Notes taken by Jacob Burroughs Revised by instructor DO 41 If m ab and gcd(a, m) = 1, then m b DO 42 If gcd(a,

More information

The Real Number System and Pythagorean Theorem Unit 9 Part B

The Real Number System and Pythagorean Theorem Unit 9 Part B The Real Number System and Pythagorean Theorem Unit 9 Part B Standards: 8.NS.1 Know that numbers that are not rational are called irrational. Understand informally that every number has a decimal expansion;

More information

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013 CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the Inverse

More information

Number Theory/Cryptography (part 1 of CSC 282)

Number Theory/Cryptography (part 1 of CSC 282) Number Theory/Cryptography (part 1 of CSC 282) http://www.cs.rochester.edu/~stefanko/teaching/11cs282 1 Schedule The homework is due Sep 8 Graded homework will be available at noon Sep 9, noon. EXAM #1

More information

2. Nine points are distributed around a circle in such a way that when all ( )

2. Nine points are distributed around a circle in such a way that when all ( ) 1. How many circles in the plane contain at least three of the points (0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)? Solution: There are ( ) 9 3 = 8 three element subsets, all

More information

Mathematics in your head the secrets of mental math

Mathematics in your head the secrets of mental math Mathematics in your head the secrets of mental math 1. Fundamentals: mental addition, subtraction, multiplication and division, and gestimation. Addition: 42 + 3 = 45 42 + 30 = 72 42 + 300 = 342 42 + 3000

More information

Launchpad Maths. Arithmetic II

Launchpad Maths. Arithmetic II Launchpad Maths. Arithmetic II LAW OF DISTRIBUTION The Law of Distribution exploits the symmetries 1 of addition and multiplication to tell of how those operations behave when working together. Consider

More information

Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014

Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 7 Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 Cryptography studies techniques for secure communication in the presence of third parties. A typical

More information

Solutions to Exercises Chapter 6: Latin squares and SDRs

Solutions to Exercises Chapter 6: Latin squares and SDRs Solutions to Exercises Chapter 6: Latin squares and SDRs 1 Show that the number of n n Latin squares is 1, 2, 12, 576 for n = 1, 2, 3, 4 respectively. (b) Prove that, up to permutations of the rows, columns,

More information

NUMBER THEORY AMIN WITNO

NUMBER THEORY AMIN WITNO NUMBER THEORY AMIN WITNO.. w w w. w i t n o. c o m Number Theory Outlines and Problem Sets Amin Witno Preface These notes are mere outlines for the course Math 313 given at Philadelphia

More information

An elementary study of Goldbach Conjecture

An elementary study of Goldbach Conjecture An elementary study of Goldbach Conjecture Denise Chemla 26/5/2012 Goldbach Conjecture (7 th, june 1742) states that every even natural integer greater than 4 is the sum of two odd prime numbers. If we

More information

Course Syllabus - Online Prealgebra

Course Syllabus - Online Prealgebra Week 1 Week 2 Week 3 Week 4 Week 5 Week 6 1.1 Whole Numbers, Place Value Practice Problems for section 1.1 HW 1A 1.2 Adding Whole Numbers Practice Problems for section 1.2 HW 1B 1.3 Subtracting Whole Numbers

More information

Twenty-sixth Annual UNC Math Contest First Round Fall, 2017

Twenty-sixth Annual UNC Math Contest First Round Fall, 2017 Twenty-sixth Annual UNC Math Contest First Round Fall, 07 Rules: 90 minutes; no electronic devices. The positive integers are,,,,.... Find the largest integer n that satisfies both 6 < 5n and n < 99..

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem The Chinese Remainder Theorem 8-3-2014 The Chinese Remainder Theorem gives solutions to systems of congruences with relatively prime moduli The solution to a system of congruences with relatively prime

More information

Walking on Numbers and a Self-Referential Formula

Walking on Numbers and a Self-Referential Formula Walking on Numbers and a Self-Referential Formula Awesome Math Summer Camp, Cornell University August 3, 2017 Coauthors for Walking on Numbers Figure: Kevin Kupiec, Marina Rawlings and me. Background Walking

More information

CH 21 2-SPACE. Ch 21 2-Space. y-axis (vertical) x-axis. Introduction

CH 21 2-SPACE. Ch 21 2-Space. y-axis (vertical) x-axis. Introduction 197 CH 21 2-SPACE Introduction S omeone once said A picture is worth a thousand words. This is especially true in math, where many ideas are very abstract. The French mathematician-philosopher René Descartes

More information

Tutorial 1. (ii) There are finite many possible positions. (iii) The players take turns to make moves.

Tutorial 1. (ii) There are finite many possible positions. (iii) The players take turns to make moves. 1 Tutorial 1 1. Combinatorial games. Recall that a game is called a combinatorial game if it satisfies the following axioms. (i) There are 2 players. (ii) There are finite many possible positions. (iii)

More information

Math 1201 Unit 2 Powers and Exponents Final Review

Math 1201 Unit 2 Powers and Exponents Final Review Math 1201 Unit 2 Powers and Exponents Final Review Multiple Choice 1. Write the prime factorization of 630. 2. Write the prime factorization of 4116. 3. Determine the greatest common factor of 56 and 88.

More information

Year 10 Term 1 Homework

Year 10 Term 1 Homework Yimin Math Centre Year 10 Term 1 Homework Student Name: Grade: Date: Score: Table of contents 6 Year 10 Term 1 Week 6 Homework 1 6.1 Triangle trigonometry................................... 1 6.1.1 The

More information

MULTI-VARIABLE OPTIMIZATION NOTES. 1. Identifying Critical Points

MULTI-VARIABLE OPTIMIZATION NOTES. 1. Identifying Critical Points MULTI-VARIABLE OPTIMIZATION NOTES HARRIS MATH CAMP 2018 1. Identifying Critical Points Definition. Let f : R 2! R. Then f has a local maximum at (x 0,y 0 ) if there exists some disc D around (x 0,y 0 )

More information

Solutions to the 2004 CMO written March 31, 2004

Solutions to the 2004 CMO written March 31, 2004 Solutions to the 004 CMO written March 31, 004 1. Find all ordered triples (x, y, z) of real numbers which satisfy the following system of equations: xy = z x y xz = y x z yz = x y z Solution 1 Subtracting

More information

A Quick Introduction to Modular Arithmetic

A Quick Introduction to Modular Arithmetic A Quick Introduction to Modular Arithmetic Art Duval University of Texas at El Paso November 16, 2004 1 Idea Here are a few quick motivations for modular arithmetic: 1.1 Sorting integers Recall how you

More information

5.1N Key Features of Rational Functions

5.1N Key Features of Rational Functions 5.1N Key Features of Rational Functions A. Vocabulary Review Domain: Range: x-intercept: y-intercept: Increasing: Decreasing: Constant: Positive: Negative: Maximum: Minimum: Symmetry: End Behavior/Limits:

More information

Grade 6/7/8 Math Circles April 1/2, Modular Arithmetic

Grade 6/7/8 Math Circles April 1/2, Modular Arithmetic Faculty of Mathematics Waterloo, Ontario N2L 3G1 Modular Arithmetic Centre for Education in Mathematics and Computing Grade 6/7/8 Math Circles April 1/2, 2014 Modular Arithmetic Modular arithmetic deals

More information

ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey

ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey Shah [1] and Bruckner [2] have considered the problem

More information

NIM Games: Handout 1

NIM Games: Handout 1 NIM Games: Handout 1 Based on notes by William Gasarch 1 One-Pile NIM Games Consider the following two-person game in which players alternate making moves. There are initially n stones on the board. During

More information

Section II.9. Orbits, Cycles, and the Alternating Groups

Section II.9. Orbits, Cycles, and the Alternating Groups II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.

More information

Public Key Encryption

Public Key Encryption Math 210 Jerry L. Kazdan Public Key Encryption The essence of this procedure is that as far as we currently know, it is difficult to factor a number that is the product of two primes each having many,

More information

Modular Arithmetic. Kieran Cooney - February 18, 2016

Modular Arithmetic. Kieran Cooney - February 18, 2016 Modular Arithmetic Kieran Cooney - kieran.cooney@hotmail.com February 18, 2016 Sums and products in modular arithmetic Almost all of elementary number theory follows from one very basic theorem: Theorem.

More information

Directions: Show all of your work. Use units and labels and remember to give complete answers.

Directions: Show all of your work. Use units and labels and remember to give complete answers. AMS II QTR 4 FINAL EXAM REVIEW TRIANGLES/PROBABILITY/UNIT CIRCLE/POLYNOMIALS NAME HOUR This packet will be collected on the day of your final exam. Seniors will turn it in on Friday June 1 st and Juniors

More information

Math 259 Winter Recitation Handout 6: Limits in Two Dimensions

Math 259 Winter Recitation Handout 6: Limits in Two Dimensions Math 259 Winter 2009 Recitation Handout 6: its in Two Dimensions As we have discussed in lecture, investigating the behavior of functions with two variables, f(x, y), can be more difficult than functions

More information

Two congruences involving 4-cores

Two congruences involving 4-cores Two congruences involving 4-cores ABSTRACT. The goal of this paper is to prove two new congruences involving 4- cores using elementary techniques; namely, if a 4 (n) denotes the number of 4-cores of n,

More information

Stupid Columnsort Tricks Dartmouth College Department of Computer Science, Technical Report TR

Stupid Columnsort Tricks Dartmouth College Department of Computer Science, Technical Report TR Stupid Columnsort Tricks Dartmouth College Department of Computer Science, Technical Report TR2003-444 Geeta Chaudhry Thomas H. Cormen Dartmouth College Department of Computer Science {geetac, thc}@cs.dartmouth.edu

More information

THE ENUMERATION OF PERMUTATIONS SORTABLE BY POP STACKS IN PARALLEL

THE ENUMERATION OF PERMUTATIONS SORTABLE BY POP STACKS IN PARALLEL THE ENUMERATION OF PERMUTATIONS SORTABLE BY POP STACKS IN PARALLEL REBECCA SMITH Department of Mathematics SUNY Brockport Brockport, NY 14420 VINCENT VATTER Department of Mathematics Dartmouth College

More information

Anthony Chan. September, Georgia Adult Education Conference

Anthony Chan. September, Georgia Adult Education Conference Anthony Chan September, 2018 1 2018 Georgia Adult Education Conference Attendees will be able to: Make difficult math concepts simple and help their students discover math principles on their own. This

More information

Grade 8 Module 3 Lessons 1 14

Grade 8 Module 3 Lessons 1 14 Eureka Math 2015 2016 Grade 8 Module 3 Lessons 1 14 Eureka Math, A Story of R a t i o s Published by the non-profit Great Minds. Copyright 2015 Great Minds. No part of this work may be reproduced, distributed,

More information

Algorithmic Number Theory and Cryptography (CS 303)

Algorithmic Number Theory and Cryptography (CS 303) Algorithmic Number Theory and Cryptography (CS 303) Modular Arithmetic Jeremy R. Johnson 1 Introduction Objective: To become familiar with modular arithmetic and some key algorithmic constructions that

More information

Dealing with some maths

Dealing with some maths Dealing with some maths Hayden Tronnolone School of Mathematical Sciences University of Adelaide August 20th, 2012 To call a spade a spade First, some dealing... Hayden Tronnolone (University of Adelaide)

More information

Chapter 3, Part 1: Intro to the Trigonometric Functions

Chapter 3, Part 1: Intro to the Trigonometric Functions Haberman MTH 11 Section I: The Trigonometric Functions Chapter 3, Part 1: Intro to the Trigonometric Functions In Example 4 in Section I: Chapter, we observed that a circle rotating about its center (i.e.,

More information

Study Guide: Similarity and Dilations

Study Guide: Similarity and Dilations Study Guide: Similarity and ilations ilations dilation is a transformation that moves a point a specific distance from a center of dilation as determined by the scale factor (r). Properties of ilations

More information

Introduction. and Z r1 Z rn. This lecture aims to provide techniques. CRT during the decription process in RSA is explained.

Introduction. and Z r1 Z rn. This lecture aims to provide techniques. CRT during the decription process in RSA is explained. THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT Introduction The rst Chinese problem in indeterminate analysis is encountered in a book written by the Chinese mathematician Sun Tzi. The problem

More information

Math 3 Geogebra Discovery - Equidistance Decemeber 5, 2014

Math 3 Geogebra Discovery - Equidistance Decemeber 5, 2014 Math 3 Geogebra Discovery - Equidistance Decemeber 5, 2014 Today you and your partner are going to explore two theorems: The Equidistance Theorem and the Perpendicular Bisector Characterization Theorem.

More information

Countability. Jason Filippou UMCP. Jason Filippou UMCP) Countability / 12

Countability. Jason Filippou UMCP. Jason Filippou UMCP) Countability / 12 Countability Jason Filippou CMSC250 @ UMCP 06-23-2016 Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 1 / 12 Outline 1 Infinity 2 Countability of integers and rationals 3 Uncountability of R Jason

More information

Edge-disjoint tree representation of three tree degree sequences

Edge-disjoint tree representation of three tree degree sequences Edge-disjoint tree representation of three tree degree sequences Ian Min Gyu Seong Carleton College seongi@carleton.edu October 2, 208 Ian Min Gyu Seong (Carleton College) Trees October 2, 208 / 65 Trees

More information

DISCRETE STRUCTURES COUNTING

DISCRETE STRUCTURES COUNTING DISCRETE STRUCTURES COUNTING LECTURE2 The Pigeonhole Principle The generalized pigeonhole principle: If N objects are placed into k boxes, then there is at least one box containing at least N/k of the

More information

Unit 6 Task 2: The Focus is the Foci: ELLIPSES

Unit 6 Task 2: The Focus is the Foci: ELLIPSES Unit 6 Task 2: The Focus is the Foci: ELLIPSES Name: Date: Period: Ellipses and their Foci The first type of quadratic relation we want to discuss is an ellipse. In terms of its conic definition, you can

More information

Math 122: Final Exam Review Sheet

Math 122: Final Exam Review Sheet Exam Information Math 1: Final Exam Review Sheet The final exam will be given on Wednesday, December 1th from 8-1 am. The exam is cumulative and will cover sections 5., 5., 5.4, 5.5, 5., 5.9,.1,.,.4,.,

More information

Assignment 5 unit3-4-radicals. Due: Friday January 13 BEFORE HOMEROOM

Assignment 5 unit3-4-radicals. Due: Friday January 13 BEFORE HOMEROOM Assignment 5 unit3-4-radicals Name: Due: Friday January 13 BEFORE HOMEROOM Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Write the prime factorization

More information

AGS Math Algebra 2 Correlated to Kentucky Academic Expectations for Mathematics Grades 6 High School

AGS Math Algebra 2 Correlated to Kentucky Academic Expectations for Mathematics Grades 6 High School AGS Math Algebra 2 Correlated to Kentucky Academic Expectations for Mathematics Grades 6 High School Copyright 2008 Pearson Education, Inc. or its affiliate(s). All rights reserved AGS Math Algebra 2 Grade

More information

Game Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games

Game Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games Game Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games May 17, 2011 Summary: We give a winning strategy for the counter-taking game called Nim; surprisingly, it involves computations

More information

PART I: Emmett s teacher asked him to analyze the table of values of a quadratic function to find key features. The table of values is shown below:

PART I: Emmett s teacher asked him to analyze the table of values of a quadratic function to find key features. The table of values is shown below: Math (L-3a) Learning Targets: I can find the vertex from intercept solutions calculated by quadratic formula. PART I: Emmett s teacher asked him to analyze the table of values of a quadratic function to

More information

b) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively.

b) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively. Solutions to Exam 1 Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively prime positive integers. Prove that m φ(n) + n φ(m) 1 (mod mn). Solution: a) Fermat s Little

More information

Cardinality revisited

Cardinality revisited Cardinality revisited A set is finite (has finite cardinality) if its cardinality is some (finite) integer n. Two sets A,B have the same cardinality iff there is a one-to-one correspondence from A to B

More information

Implementation / Programming: Random Number Generation

Implementation / Programming: Random Number Generation Introduction to Modeling and Simulation Implementation / Programming: Random Number Generation OSMAN BALCI Professor Department of Computer Science Virginia Polytechnic Institute and State University (Virginia

More information

Zhanjiang , People s Republic of China

Zhanjiang , People s Republic of China Math. Comp. 78(2009), no. 267, 1853 1866. COVERS OF THE INTEGERS WITH ODD MODULI AND THEIR APPLICATIONS TO THE FORMS x m 2 n AND x 2 F 3n /2 Ke-Jian Wu 1 and Zhi-Wei Sun 2, 1 Department of Mathematics,

More information

Assignment 2. Due: Monday Oct. 15, :59pm

Assignment 2. Due: Monday Oct. 15, :59pm Introduction To Discrete Math Due: Monday Oct. 15, 2012. 11:59pm Assignment 2 Instructor: Mohamed Omar Math 6a For all problems on assignments, you are allowed to use the textbook, class notes, and other

More information

Mathematics 205 HWK 19b Solutions Section 16.2 p750. (x 2 y) dy dx. 2x 2 3

Mathematics 205 HWK 19b Solutions Section 16.2 p750. (x 2 y) dy dx. 2x 2 3 Mathematics 5 HWK 9b Solutions Section 6. p75 Problem, 6., p75. Evaluate (x y) dy dx. Solution. (x y) dy dx x ( ) y dy dx [ x x dx ] [ ] y x dx Problem 9, 6., p75. For the region as shown, write f da as

More information

Exam 1 7 = = 49 2 ( ) = = 7 ( ) =

Exam 1 7 = = 49 2 ( ) = = 7 ( ) = Exam 1 Problem 1. a) Define gcd(a, b). Using Euclid s algorithm comute gcd(889, 168). Then find x, y Z such that gcd(889, 168) = x 889 + y 168 (check your answer!). b) Let a be an integer. Prove that gcd(3a

More information

THE CHINESE REMAINDER CLOCK TUTORIAL

THE CHINESE REMAINDER CLOCK TUTORIAL THE CHINESE REMAINDER CLOCK TUTORIAL CONTENTS 1. Division with Remainder 1 1.1. The division equation 1 1.2. About dividend and divisor 2 1.3. About quotient and remainder 2 1.4. Summary 3 2. Remainders

More information