# Study of Some Properties of Squares of Whole Numbers

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Study of Some Properties of Squares of Whole Numbers Rupam Goswami Research Scholar Department of Electronics and Communication Engineering National Institute of Technology Silchar, Silchar, India Pijus Kanti De Associate Professor Department of Mathematics National Institute of Technology Silchar, Silchar, India Basab Das Assistant Professor Department of Electronics and Telecommunication Engineering GIMT, Azara, India ABSTRACT In this paper, some important properties of squares of whole numbers are reported. An algorithm is presented to show the results that involve the differences between squares of whole numbers and multiples of five closest to the corresponding squares. Also, such kind of difference has a sequence, 0,, -, -,, which is followed for every five consecutive whole numbers starting from 0. The algorithm thus developed, has been demonstrated with some numerical examples, and graphical deductions. General Terms Number Theory, Algorithms Keywords Whole number, The Division Algorithm, Square of a whole number, MATLAB. INTRODUCTION Squares of whole numbers and its properties have been considered to be of prime importance in Number Theory. The relevance of squares of numbers in Pythagorean Triangles dates back to time long before Pythagoras [] [2] [3]. The G. A. Plympton Collection at Columbia University houses a Babylonian Clay Tablet which reveals that the Babylonians were well-aware of the theorem more than 3500 years ago []. Around 2000 B. C., the Egyptians and ancient Indians also used the primitive Pythagorean triangles. The association of Fibonacci and Lucas Numbers with the Pythagorean Triangles has diversified the application of squares of whole numbers [4]. Diophantus lemma on the sum of two squares, Euler s (743) lemma on the sums of four squares [] and Lagrange s (770) theorem on expression of a whole number as the sum of four squares [] are the notable fundamental works in Number Theory which deal with the properties of squares of whole numbers. The Fermat s Last Theorem [] [2] and Beal s Conjecture [] further discuss the use of squares of whole numbers. An interesting relationship between Pell s Equation [] [5] [6] and Pythagorean Triples [] [7] x-y-z such that x and y are consecutive integers, leads to intuitive possibilities of more properties of squares of whole numbers. Rest of the paper is composed as follows: section 2 briefly describes the definitions and preliminaries of whole number and square of numbers. Section 3 describes the Division Algorithm. Section 4 deals with the proposed study in the present paper arrangement of whole numbers in a table, and difference between multiples of 5 closest to squares of consecutive numbers. In section 5, a new algorithm has been developed to demonstrate our proposed approach. The algorithm has been verified with some numerical examples. Section 6 discusses the results of the proposed study with the help of some examples and plots. Finally, the paper is concluded in Section DEFINITIONS AND PRELIMINARIES 2. Whole Number The set of positive integers, together with 0 constitutes the set of whole numbers, defined by W 0,,2,3,4,... [] The whole numbers collectively comprise of the natural numbers and the number 0'. However, this is a convention or a notion and not a general agreement. The number 0 has been considered as a natural number in many cases [3] [8] [9]. 2.2 Square of a whole number A square of a whole number is another whole number obtained by multiplying the given number with itself. 3. THE DIVISION ALGORITHM Divisibility [2] [5] [0] [] is one of the basic concepts in number theory. If a and b be two integers, then b is a divisor of a, and a is a multiple of b if there exists an integer c such that a cb If b divides a, then we denote the operation as b a. Theorem (Division Algorithm) [2] [3] [0] []: Let a and b be integers with b 0. There exist unique integers, r and s such that a rb s and 0 s b. The integer r is called the quotient and the integer s is called the remainder in the division of a by b. 4. PROPOSED STUDY 4. Arrangement of Whole Numbers in a Table Let x W such that all x are arranged in a table (Table ) in rows of 5 columns. Then we have the following conclusions: (a) The position of the whole number x in the table is given by (p, q) where p x / 5 and q = x mod 5. 2 (b) The difference between Y x and Z which is multiple of 5 closest to Y, is either - or 0 or +. 4

2 (c) Y Z in each row follows an exact sequence which is 0,, -, -,. We have further two conclusions from this: i. Since Y Z = 0 for q = 0, so the multiple of 5 closest to the square of the number located in the first column of any row is the square of the number itself. ii. The algebraic sum of Y Z vanishes in each row. 4.2 Difference between Multiples of 5 Closest to Squares of Consecutive Numbers The difference between the consecutive values of Z can again be arranged in a matrix of 5 columns as shown in Table 2. 2 Here, Z (p, q) refers to the multiple of 5 closest to Y x where the position of x is defined by (p, q). Let r denote any row number. Then, the conclusions derived from Table 2 for the r th row are: (a) The number in the first column of Table 2 is given by nr 0r () (b) The numbers in the next three columns are equal and found to be 5(2r ) each. The sum of the values in the three columns is n2r 5(2r ) (2) (c) The number in the fifth and last column of any row r is given as n3r 0(r ) (3) Then the sum of all the numbers in the r th row is given by nr nr n2r n3r 0r 5(2r ) 0(r ) or, nr 50r 25 25(2r ) (4) 4.3 Finding the Square of any Whole Number In order to find the square of a whole number, x, it is required to traverse in the row in which x is located. According to the method of arrangement explained in Section 4., p x / 5 denotes the row in which the whole number x is located. By utilizing the conclusions of Table and Table 2, the square can be determined using the three steps of traversal as discussed below: (a) Determining the square of a whole number x whose position is (p, 0): The first step to reach the required square in the p th row in the matrix is to compute the square of the whole number located in the first column, that is, (p,0). Using (4), the square of a whole number located in the first column of the p th row is given by: p nr (5) r 0 S where p x / 5. For a whole number whose q = 0, its square is given by (5). However for others, the following two steps need to be followed. (b) Determining the difference Z (p, q) S r for q =, 2, 3, and 4: From conclusions in Section 2, each square is related to the multiple of 5 closest to it. As the pattern of difference, Y Z, between the square of a whole number and the multiples of 5 closest to it in a row is known, so, the square of a number can be found out once we have the multiple of 5 closest to it. In order to do so for a whole number x, we calculate the difference Z (p, q) S where p x / 5 and q xmod5. S2 0p (0p 5)(q ) (6) (c) Square of x: In a row in Table, the difference between a square and the multiple of 5 closest to it follows a definite pattern (L):, -, -, for values of q equal to, 2, 3, 4 respectively. Therefore, the square of a whole number, x is given by: S q 0 Y S S2 L q 0 (7) TABLE : (A) to (F). Squares of some whole numbers to reflect the properties of their squares The various symbols have the following meanings with respect to the whole number, x: p x / 5 q = x mod 5 Y = x 2 Z = multiple of 5 closest to Y x p Y

3 Z Y Z (A) x p Y Z Y Z (B) x p Y Z Y - Z (C) x p Y Z Y - Z (D) x p Y Z Y Z (E) 6

4 x p Y Z Y - Z (F) TABLE 2: Difference between consecutive values of Z derived from Table p Z(p,) Z(p,0) Z(p,2) Z(p,) Z(p,3) Z(p,2) Z(p,4) Z(p,3) Z(p+,0) Z(p,4) Here, Z (p, q) refers to the multiple of 5 closest to x 2 where the row number is p x / 5 and column number is q = x mod 5 5. ALGORITHM OF THE PROPOSED APPROACH STEP : Consider a whole number, x. STEP 2: Determine the position of x in the table where whole numbers are arranged in rows of 5; assign the row number to p and column number to q. p x / 5 and q xmod5 STEP 3: Compute the first square of the row in which x is located and assign it to S p S 25(2r ) r 0 STEP 4: Compute the difference between S and the value of the multiple of 5 closest to Y = x 2 and assign it to S 2. STEP 5: If q = 0 If q = 0 S2 0 else S 2 [0p {(0p 5)(q )}] 0 else if q = else if q = 2 else if q = 3 else if q = 4 Display Y as square of x. 6. RESULTS AND DISCUSSION 6. Findings Some numerical examples have been tabulated in Table 3, showing the values of S, S 2, and Y. The results have been derived using the mathematical tool, MATLAB. The examples of whole number have been considered in such a manner that they reflect the properties of the squares for all possible values of q (0,, 2, 3, 4). TABLE 3: Numerical examples of the proposed algorithm x S S 2 Y

5 Variation of S with Whole Number, x The variation of the parameter S mentioned in equation (5) with 30 whole numbers ranging from 0 to 29 has been shown in Figure. As evident, S being the square of the first number located in p th row (where p x / 5 ), it remains same for a set of 5 numbers with the value of q ranging from 0 to Variation of S 2 with Whole Number, x A variation of S 2 mentioned in equation (6), with 30 whole numbers ranging from 0 to 29 has been depicted in Figure 2. For a set of whole numbers falling in the same row, S 2 increases linearly. Observing equations (6) and (7), we have used S2 0for those whole numbers which lie in the first column of a row (q = 0). The slope of the locus of S 2 increases as we move from a lower value of p to a higher one. Fig : Plot of S versus whole numbers mentioned in Table and Table 23 Fig 2: Plot of S 2 versus whole numbers mentioned in Table and Table 2 8

6 7. CONCLUSION In this paper attention has been made to the study of squares of whole numbers and their properties. a. The difference of square of a whole number and multiple of 5 closest to the square of whole number is studied. It has been observed that this difference gives the result either - or 0 or + in case of any whole number. b. Further, these differences for each and every 5 whole numbers follow a particular repetitive pattern, 0,, -, -,, whose sum vanishes. In case of representing the whole numbers in a tabular form, suppose (p, q) is the position of the whole number where p x / 5 and q = x mod 5. c. When q = 0, the above difference vanishes, that is, square of any whole number is equal to the multiple of 5 closest to the square of the whole number. The results of the algorithm developed in this paper establish the properties of the squares of whole numbers reported in this paper. This work suggests that whole numbers can be arranged in a matrix of 5 columns where each row possesses similar properties, and the position of each number can be defined. This may prove to be a major connecting link between Number Theory and Matrix Algebra. Moreover, detailed analyses of the new intermediate parameters, S and S 2, are essential in order to discover more properties of whole numbers and their squares. 8. REFERENCES [] Koshy, T Elementary Number Theory with Applications. Academic Press [2] Dudley, U. 969 Elementary Number Theory. W H Freeman and Company [3] Niven, I., Zuckerman, H. S., and Montgomery, H. L. 99 An Introduction to the Theory of Numbers. John Wiley & Sons, Inc. [4] Aires, A. P., Catarino, P., Campos, H., Borges, A., and Vasco, P. 204 s-generalized Fibonacci Numbers: Some Identities, a Generating Function and Pythagorean Triples Int. J. Math. Anal. 8, [5] Hardy, G. H. and Wright, E. M. 975 An Introduction to the Theory of Numbers. Oxford University Press [6] Yokota, H. 200 Solution of polynomial Pell s equation. J. Number Theor. 30 (Sep., 200), [7] Goins, E. and Togbe, A On Pythagorean Quadruples. Int. J. Pure Appl. Math. 35, [8] Halmos, P. R. 974 Naïve Set Theory. Springer-Verlag [9] Ribenboim, P. 996 Catalan s Conjecture. Amer. Math. Monthly 03 (Aug. Sep., 996), [0] Jones, G. A. and Jones, M. A Elementary Number Theory. Springer London [] Nathanson, M. B Elementary Methods in Number Theory. Springer New York IJCA TM : 9

### The Equation x 2 + y 2 = z 2

The Equation x 2 + y 2 = z 2 The equation x 2 + y 2 = z 2 is associated with the Pythagorean theorem: In a right triangle the sum of the squares on the sides is equal to the square on the hypotenuse. We

### Coding Theory Pythagorean Codes Massoud Malek. By looking at the legs of a right-angle triangle (a, b, c), Pythagoras gave us the first theorem:

By looking at the legs of a right-angle triangle (a, b, c), Pythagoras gave us the first theorem: a 2 + b 2 = c 2 The leg c, is called the hypotenuse. If no other number except one divides both a and b,

### 4.2 Euclid s Classification of Pythagorean Triples

178 4. Number Theory: Fermat s Last Theorem Exercise 4.7: A primitive Pythagorean triple is one in which any two of the three numbers are relatively prime. Show that every multiple of a Pythagorean triple

### MATH 361: NUMBER THEORY FIRST LECTURE

MATH 361: NUMBER THEORY FIRST LECTURE 1. Introduction As a provisional definition, view number theory as the study of the properties of the positive integers, Z + = {1, 2, 3, }. Of particular interest,

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### SUM OF TWO SQUARES JAHNAVI BHASKAR

SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted

### Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University

Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called

### Characterizing the Sum of Two Cubes

1 3 47 6 3 11 Journal of Integer Sequences, Vol. 6 (003), Article 03.4.6 Characterizing the Sum of Two Cubes Kevin A. Broughan University of Waikato Hamilton 001 New Zealand kab@waikato.ac.nz Abstract

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Squares and Square Roots

SQUARES AND SQUARE ROOTS 89 Squares and Square Roots CHAPTER 6 6.1 Introduction You know that the area of a square = side side (where side means the length of a side ). Study the following table. Side

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Chapter Two. Number Theory

Chapter Two Number Theory 2.1 INTRODUCTION Number theory is that area of mathematics dealing with the properties of the integers under the ordinary operations of addition, subtraction, multiplication and

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

### JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials

### Integer Factorization using the Quadratic Sieve

Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give

### MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### Congruent Number Problem

University of Waterloo October 28th, 2015 Number Theory Number theory, can be described as the mathematics of discovering and explaining patterns in numbers. There is nothing in the world which pleases

### Pythagorean Triples. becomes

Solution Commentary: Solution of Main Problems: Pythagorean Triples 1. If m = (n + 1), n = [m -1]/ and n+1 = [m +1]/. Then, by substitution, the equation n + (n + 1) = (n+1) m + 1 becomes + m =. Now, because

### An introduction to number theory and Diophantine equations

An introduction to number theory and Diophantine equations Lillian Pierce April 20, 2010 Lattice points and circles What is the area of a circle of radius r? You may have just thought without hesitation

### THE CONGRUENT NUMBER PROBLEM

THE CONGRUENT NUMBER PROBLEM KEITH CONRAD 1. Introduction A right triangle is called rational when its legs and hypotenuse are all rational numbers. Examples of rational right triangles include Pythagorean

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

### Solution to Exercise 2.2. Both m and n are divisible by d, som = dk and n = dk. Thus m ± n = dk ± dk = d(k ± k ),som + n and m n are divisible by d.

[Chap. ] Pythagorean Triples 6 (b) The table suggests that in every primitive Pythagorean triple, exactly one of a, b,orc is a multiple of 5. To verify this, we use the Pythagorean Triples Theorem to write

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### PYTHAGOREAN NUMBERS. Bowling Green State University, Bowling Green, OH (Submitted February 1988)

S u p r i y a Mohanty a n d S. P. Mohanty Bowling Green State University, Bowling Green, OH 43403-0221 (Submitted February 1988) Let M be a right angled triangle with legs x and y and hypotenuse z. Then

### 1.2. Successive Differences

1. An Application of Inductive Reasoning: Number Patterns In the previous section we introduced inductive reasoning, and we showed how it can be applied in predicting what comes next in a list of numbers

### Factoring Algorithms

Factoring Algorithms The p 1 Method and Quadratic Sieve November 17, 2008 () Factoring Algorithms November 17, 2008 1 / 12 Fermat s factoring method Fermat made the observation that if n has two factors

### Section 6-2 Mathematical Induction

6- Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that

### Odd Perfect Numbers. way back to the ancient Greek era. A perfect number is both a positive integer that is the sum of

Stephanie Mijat Math 301 Odd Perfect Numbers Perfect numbers have been an interesting topic of study for mathematicians dating all the way back to the ancient Greek era. A perfect number is both a positive

### WHAT S HAPPENING IN THE MATHEMATICAL SCIENCES

Plimpton 322. (Photo from Mathematical Cuneiform Tablets, Otto Neugebauer and Abraham Sachs, 1945, courtesy of the American Oriental Society; drawing by Eleanor Robson.) 54 Rewriting History Most mathematicians

### Mathematics of Cryptography Part I

CHAPTER 2 Mathematics of Cryptography Part I (Solution to Odd-Numbered Problems) Review Questions 1. The set of integers is Z. It contains all integral numbers from negative infinity to positive infinity.

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem Copyright Cengage Learning. All rights reserved.

### SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

### The square-free kernel of x 2n a 2n

ACTA ARITHMETICA 101.2 (2002) The square-free kernel of x 2n a 2n by Paulo Ribenboim (Kingston, Ont.) Dedicated to my long-time friend and collaborator Wayne McDaniel, at the occasion of his retirement

### Square Roots and the Pythagorean Theorem

4.8 Square Roots and the Pythagorean Theorem 4.8 OBJECTIVES 1. Find the square root of a perfect square 2. Use the Pythagorean theorem to find the length of a missing side of a right triangle 3. Approximate

### Alex, I will take congruent numbers for one million dollars please

Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory

### Stanford University Educational Program for Gifted Youth (EPGY) Number Theory. Dana Paquin, Ph.D.

Stanford University Educational Program for Gifted Youth (EPGY) Dana Paquin, Ph.D. paquin@math.stanford.edu Summer 2010 Note: These lecture notes are adapted from the following sources: 1. Ivan Niven,

### Pythagorean Theorem: Proof and Applications

Pythagorean Theorem: Proof and Applications Kamel Al-Khaled & Ameen Alawneh Department of Mathematics and Statistics, Jordan University of Science and Technology IRBID 22110, JORDAN E-mail: kamel@just.edu.jo,

### a = bq + r where 0 r < b.

Lecture 5: Euclid s algorithm Introduction The fundamental arithmetic operations are addition, subtraction, multiplication and division. But there is a fifth operation which I would argue is just as fundamental

### Course Title: Honors Algebra Course Level: Honors Textbook: Algebra 1 Publisher: McDougall Littell

Course Title: Honors Algebra Course Level: Honors Textbook: Algebra Publisher: McDougall Littell The following is a list of key topics studied in Honors Algebra. Identify and use the properties of operations

### On Generalized Fermat Numbers 3 2n +1

Applied Mathematics & Information Sciences 4(3) (010), 307 313 An International Journal c 010 Dixie W Publishing Corporation, U. S. A. On Generalized Fermat Numbers 3 n +1 Amin Witno Department of Basic

### In a triangle with a right angle, there are 2 legs and the hypotenuse of a triangle.

PROBLEM STATEMENT In a triangle with a right angle, there are legs and the hypotenuse of a triangle. The hypotenuse of a triangle is the side of a right triangle that is opposite the 90 angle. The legs

### RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES DARRYL MCCULLOUGH AND ELIZABETH WADE In [9], P. W. Wade and W. R. Wade (no relation to the second author gave a recursion formula that produces Pythagorean

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### Pythagorean Triples Pythagorean triple similar primitive

Pythagorean Triples One of the most far-reaching problems to appear in Diophantus Arithmetica was his Problem II-8: To divide a given square into two squares. Namely, find integers x, y, z, so that x 2

### 7. Some irreducible polynomials

7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of

Copyright by Christina Lau 011 The Report Committee for Christina Lau Certifies that this is the approved version of the following report: Pythagorean Theorem Extensions APPROVED BY SUPERVISING COMMITTEE:

### MTH 382 Number Theory Spring 2003 Practice Problems for the Final

MTH 382 Number Theory Spring 2003 Practice Problems for the Final (1) Find the quotient and remainder in the Division Algorithm, (a) with divisor 16 and dividend 95, (b) with divisor 16 and dividend -95,

### z 0 and y even had the form

Gaussian Integers The concepts of divisibility, primality and factoring are actually more general than the discussion so far. For the moment, we have been working in the integers, which we denote by Z

### SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

### Continued Fractions. Darren C. Collins

Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history

### Recall that two vectors in are perpendicular or orthogonal provided that their dot

Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### Mathematics of Cryptography

Number Theory Modular Arithmetic: Two numbers equivalent mod n if their difference is multiple of n example: 7 and 10 are equivalent mod 3 but not mod 4 7 mod 3 10 mod 3 = 1; 7 mod 4 = 3, 10 mod 4 = 2.

### THE CONGRUENT NUMBER PROBLEM

THE CONGRUENT NUMBER PROBLEM KEITH CONRAD 1. Introduction A right triangle is called rational when its legs and hypotenuse are all rational numbers. Examples of rational right triangles include Pythagorean

### Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

### Section Summary. Integer Representations. Base Conversion Algorithm Algorithms for Integer Operations

Section 4.2 Section Summary Integer Representations Base b Expansions Binary Expansions Octal Expansions Hexadecimal Expansions Base Conversion Algorithm Algorithms for Integer Operations Representations

### Prime and Composite Terms in Sloane s Sequence A056542

1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.3.3 Prime and Composite Terms in Sloane s Sequence A056542 Tom Müller Institute for Cusanus-Research University and Theological

### Solutions to Practice Problems

Solutions to Practice Problems March 205. Given n = pq and φ(n = (p (q, we find p and q as the roots of the quadratic equation (x p(x q = x 2 (n φ(n + x + n = 0. The roots are p, q = 2[ n φ(n+ ± (n φ(n+2

### Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

### vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 466 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

### CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical

### MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.

### ELEMENTARY NUMBER THEORY AND METHODS OF PROOF

CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.4 Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem

### SOLUTIONS FOR PROBLEM SET 2

SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such

### Chapter 11 Number Theory

Chapter 11 Number Theory Number theory is one of the oldest branches of mathematics. For many years people who studied number theory delighted in its pure nature because there were few practical applications

### Notes on Matrix Multiplication and the Transitive Closure

ICS 6D Due: Wednesday, February 25, 2015 Instructor: Sandy Irani Notes on Matrix Multiplication and the Transitive Closure An n m matrix over a set S is an array of elements from S with n rows and m columns.

### Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study

### Lecture 1: Elementary Number Theory

Lecture 1: Elementary Number Theory The integers are the simplest and most fundamental objects in discrete mathematics. All calculations by computers are based on the arithmetical operations with integers

### 1 Orthogonal projections and the approximation

Math 1512 Fall 2010 Notes on least squares approximation Given n data points (x 1, y 1 ),..., (x n, y n ), we would like to find the line L, with an equation of the form y = mx + b, which is the best fit

### Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

Chapter 3 Number Theory 159 3.1 Prime Numbers Prime numbers serve as the basic building blocs in the multiplicative structure of the integers. As you may recall, an integer n greater than one is prime

### Big Ideas in Mathematics

Big Ideas in Mathematics which are important to all mathematics learning. (Adapted from the NCTM Curriculum Focal Points, 2006) The Mathematics Big Ideas are organized using the PA Mathematics Standards

### Polynomials. Dr. philippe B. laval Kennesaw State University. April 3, 2005

Polynomials Dr. philippe B. laval Kennesaw State University April 3, 2005 Abstract Handout on polynomials. The following topics are covered: Polynomial Functions End behavior Extrema Polynomial Division

### 3 0 + 4 + 3 1 + 1 + 3 9 + 6 + 3 0 + 1 + 3 0 + 1 + 3 2 mod 10 = 4 + 3 + 1 + 27 + 6 + 1 + 1 + 6 mod 10 = 49 mod 10 = 9.

SOLUTIONS TO HOMEWORK 2 - MATH 170, SUMMER SESSION I (2012) (1) (Exercise 11, Page 107) Which of the following is the correct UPC for Progresso minestrone soup? Show why the other numbers are not valid

### MATH 2030: SYSTEMS OF LINEAR EQUATIONS. ax + by + cz = d. )z = e. while these equations are not linear: xy z = 2, x x = 0,

MATH 23: SYSTEMS OF LINEAR EQUATIONS Systems of Linear Equations In the plane R 2 the general form of the equation of a line is ax + by = c and that the general equation of a plane in R 3 will be we call

### THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM a 2 + b 2 = c 2 CFE 3285V OPEN CAPTIONED ALLIED VIDEO CORPORTATION 1993 Grade Levels: 9-12 14 minutes DESCRIPTION Reviews the definition of a right triangle before a brief history

### 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.

### Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur

Cryptography and Network Security Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Module No. # 01 Lecture No. # 05 Classic Cryptosystems (Refer Slide Time: 00:42)

### 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

### Practice Problems for First Test

Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers, and we have reason to believe that it is a mystery into which the human mind will never penetrate.-

### Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

### FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM

Acta Math. Univ. Comenianae Vol. LXXXI, (01), pp. 03 09 03 ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible

### SMMG December 2 nd, 2006 Dr. Edward Burger (Williams College) Discovering Beautiful Patterns in Nature and Number. Fun Fibonacci Facts

SMMG December nd, 006 Dr. Edward Burger (Williams College) Discovering Beautiful Patterns in Nature and Number. The Fibonacci Numbers Fun Fibonacci Facts Examine the following sequence of natural numbers.

### Math 313 Lecture #10 2.2: The Inverse of a Matrix

Math 1 Lecture #10 2.2: The Inverse of a Matrix Matrix algebra provides tools for creating many useful formulas just like real number algebra does. For example, a real number a is invertible if there is

### PRIME FACTORS OF CONSECUTIVE INTEGERS

PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in

### The Laws of Cryptography Cryptographers Favorite Algorithms

2 The Laws of Cryptography Cryptographers Favorite Algorithms 2.1 The Extended Euclidean Algorithm. The previous section introduced the field known as the integers mod p, denoted or. Most of the field

### Algebra 1-2. A. Identify and translate variables and expressions.

St. Mary's College High School Algebra 1-2 The Language of Algebra What is a variable? A. Identify and translate variables and expressions. The following apply to all the skills How is a variable used

### 8.7 Mathematical Induction

8.7. MATHEMATICAL INDUCTION 8-135 8.7 Mathematical Induction Objective Prove a statement by mathematical induction Many mathematical facts are established by first observing a pattern, then making a conjecture

Pythagorean Quadruples 1. Pythagorean and Primitive Pythagorean Quadruples A few years ago, I became interested with those 3 vectors with integer coordinates and integer length or norm. The simplest example

### A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions Marcel B. Finan Arkansas Tech University c All Rights Reserved First Draft February 8, 2006 1 Contents 25

### Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers

Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers Amnon Yekutieli Department of Mathematics Ben Gurion University email: amyekut@math.bgu.ac.il Notes available at http://www.math.bgu.ac.il/~amyekut/lectures