Squares from D( 4) and D(20) Triples
|
|
- Andra Emma Boyd
- 5 years ago
- Views:
Transcription
1 dvances in Pure Mathematics - doi:/apm Published Online September ( Squares from D( ) D() Triples bstract Zvono Čerin Koperniova 7 Zagreb roatia cerin@mathhr Received May ; revised May ; accepted June We study the eight infinite sequences triples natural numbers Fn Fn Fn7 B F n Fn Fn 7 Fn Fn F n D Fn Fn F n L n L n Ln7 L L L L L L L L L n n n 7 n n n n n n The sequences B D are built from the Fibonacci numbers F n while the sequences from the Lucas numbers L n Each triple in the sequences B D has the property D (i e adding to the product any two different components them is a square) Similarly each triple in the sequences has the property D We show some interesting properties these sequences that give various methods how to get squares from them Keywords: Fibonacci Numbers Lucas Numbers Square Symmetric Sum lternating Sum Product omponent Introduction For integers a b c let us write a c provided a b= c For the triples X = abc Y = d e f X = abc the notation Y X X means that d e bc a ca b f ab c When Y = let us write X X Y for X X Hence X is the D triple (see [] ) if only if there is a triple X such that X X We now construct the infinite sequences B D the D -triples the D -triples They are F F n n F B n 7 F n Fn Fn7 F n F n Fn D F n Fn Fn L n Ln Ln7 LnLnLn7 L n Ln Ln LnL nln where the Fibonacci Lucas sequences natural numbers F n Ln are defined by the recurrence relations F = F = Fn = F n Fn for n L = L = Ln = Ln Ln for n The numbers F mae the integer sequence from [] while the numbers L mae For an integer let us use π p r for F n L n F n b L n The goal this article is to explore the properties the sequences B D Each member these sequences is an Euler D - or D -triple (see []) so that many their properties follow from the properties the general (pencils ) Euler triples (see [] ) It is therefore interesting to loo for those properties in which at least two the sequences appear This paper presents several results this ind giving many squares from the components various sums products the sequences B D Most our theorems have also versions for the associated sequences = π π π B = π π π = π D = π = = π π = π π that satisfy the relations B B D D The overall principle in this paper is that if you can get complete squares by adding a fixed number to the products different components some triples natural numbers then you will be able to get complete squares by adding some other fixed numbers to all inds expressions constructions built from the components these triples Our tas was to find out these numbers to identify those expressions constructions ll results in this paper are identities among Fibonacci opyright SciRes
2 Z ČERIN 7 /or Lucas numbers varied difficulty We shall write down the pros only a small portion them to save the space leaving the rest to the dedicated reader In most cases we prove or only outline the pro the first among several parts the theorem The other parts have similar pros sometimes with far more complicated details Following this introduction in the section we first show that the selected products four components among triples from either the sequences B D or the sequences B D become squares by adding some fixed integers The Section considers the various products two symmetric quadratic sums components sees to get squares in the same way (by adding a fixed integer) The next Section does a similar tas for certain products four symmetric linear sums components In the Section the numerous products two sums squares components are shown as differences squares The long Section contains similar results for products two symmetric linear sums components the three natural products (dot forward shifted dot bacward shifted dot) two triples integers Finally the last section 7 replaces these dot products with the two forms a stard vector product in the Euclidean -space Squares from Products omponents The relations imply that the components satisfy Our first theorem shows that the product is in a similar relation with respect to Of course the other products as well as BB etc exhibit a similar property The missing cases from the list coincide with the one the previous cases Theorem The following hold for the products components: p BB p p p p DD p BB p p Pro Let = = = Since j j F j = L = j j j it follows that n n n7 n7 = = n n = = n 7 n7 fter the substitutions = = n the sum the product becomes However this is precisely the square p This shows the first relation The version the previous theorem for the sequences B D is the following result Notice that in this theorem there are no repetitions cases Theorem The products the components satisfy: p BB p7 r DD r p7 BB p p DD p p BB p r DD p n n Pro Since = n n = n n = n n = the sum after the substitutions = = n becomes However the square p has the same value This proves the first relation p The same ind relations hold also for the products components from four among the sequences B D Theorem The relations that hold for the products components: B D p p p opyright SciRes
3 Z ČERIN B p BD p D p B p Dp D p B D p p p Pro Since B = = the first relation is the consequence the first relation in Theorem Similarly the fifth relation follows from the sixth relation in the Theorem The other relations in this theorem have pros similar to the pros Theorems There is again the version the previous theorem for the products components from four among the sequences B D Theorem The products components satisfy: B p7 r D p D p B p r B r D r B p 7 p D r BD r D p Pro The first the sixth the ninth the tenth relations are the easy consequences the second the last the seventh the fourth relations in Theorem In order to prove the second relation note that the components are n n n n n n n n It is now clear from the pro Theorem that the sum is precisely the square r This requires the identities π = p π = p pp = r Squares from Symmetric Sums Let : be the basic symmetric functions defined for x = abc by x a b c x bc ca ab x abc Let : be defined by = x bc ca ab x = a b c Note that x is the determinant the matrix abc (see [] ) For the sums the components the following relations are true Theorem The following is true for the sums the components: p p B r p 7 7 7r p D p 7 p p B p r D p Pro Since B = r = r the sum B is r that we recog- nize as the square p This proves the sixth relation B p The sums B have constant values On the other h π r D r Theorem The following is true for the sums the components: 7p p B p 7p 7 p p D p p = π π 7 Pro Since = π π the sum is the square p p This proves the third relation Some similar relations mae up the following two results Theorem 7 The following is true for the sums the components: B p B r D r B Pro Since = π = it follows that = = B opyright SciRes
4 Z ČERIN p B = π = Theorem The following is true for the sums the components: B r Pro Since = r r B = r r B = = it follows that = r r = r Products Sums as Differences Squares The products the sums the components the four triples among B D show the same ind relations This is also true for the associated triples B D Notice that in the next four theorems the added third number is always a square so that the product on the left h side in each relation is a difference squares Theorem The following relations hold for the sums : B p p r D p + p B r + p B D p p D p B p p p D p p7 B p 7 p B D p D p p7 Pro The sums the components B are equal π π π π Hence the sum B is the square p This proves the above first relation Theorem The following relations hold for the sums : B p p D r7 D r B p r p p 7 D p p B p r B D p p D p B are equal π π Pro The sums the components Hence the product B is the square p since π = p This proves the above first relation In the next result we combine the sums in each product Theorem The following relations hold for the sums : B p r B p p 7 r p r p D p p D p 7 p B r p B D p p D r r D p p Pro With the above information about the sums the components B the sum B is r p = p r p π π = p p This proves the first relation Theorem The following relations hold for the sums : B p r B p p p p p D p7 p D p p7 opyright SciRes
5 Z ČERIN B 7 p B p p7 B D p r B D p r 7 7 D D p r p p Pro The sums the components are equal π π π Hence the sum the product B is p π π = pp p p= p r This proves the above first relation Squares from the Sums Squares B For a natural number > let the sums : powers be defined for x = abc by x = a b c x = a b c We proceed with the version the Theorem for the sums the squares components Theorem The following relations are true for the sums : p r B 7 p p 7r p D 7 r p p r B 7p p 7 7 7r p D 7r p Pro Since are 7 p p 7p p the difference is equal where are 77 7 But one can easily chec that this is the square p r This concludes the pro the first relation The next is the version the Theorem for the alternating sums the squares components Theorem The following relations are true for the sums : p r B p r r p D r r 7 r p B 7r p 7 r p D p p Pro Notice that the alternating sums squares components are r r r r Hence the sum is equal However one can easily chec that this is the square p r This proves the first relation Multiplied by five these products the sums components show the same behavior Theorem For the sums the following relations hold: p p B pp p p D p p p r B r p 7 r p D r r Pro With the above values the sum 7 is equal But this is the square p p This outlines the pro the first relation Squares from the Products Let us introduce three binary operations on the set triples integers by the rules abc uvw = aubvcw opyright SciRes
6 Z ČERIN abc uvw = avbwcu the operations are also the source abc uvw = awbucv squares from components the sixteen sequences This section contains four theorems which show that Theorem The following relations hold for the sequences : B p p p 7 D B 7 r p r p 7 B D r D p 7 B p r r r p p D B B D D r r 7 p p7 r B p D B r r 7p p BD p r D p 7 B is the square p Pro Since B = 7p p This proves the first relation =7p p it follows that the difference Theorem 7 The following relations hold for the sequences : ( B ) ( ) p ( ) ( ) p r D B p r p p 7 B D p r D p p 7p p r p B r r r r D B r r p B D D opyright SciRes
7 Z ČERIN p 7 p p B 77 D B p p p p p B D p D Pro Since the sums B are r r it follows that the sum B is B r r p i e the square p This concludes the pro the first relation Theorem The following relations hold for the sequences : r p p r 7 p r p p D B B D D 7 p p p B p p p 7 D B p p r p B D p r D p r p B p 7 D p B p p 7 r p B D p D Pro Since the sums B are π π π it fol- B is lows that the sum p π π i e B which is the square r p This is the outline the pro the first relation Theorem The following relations hold for the sequences : p r p p 7 p r p p D B p 7 p r r B D D 7 opyright SciRes
8 p Z ČERIN B p r 7 D 7 B p p p p B D p p D p p p B p p r p D B p B D p D Pro Since the sums B are 7 π π 7π it follows that the sum B is π 7π 7 p ie 7 7 which is the square 7 p r This is the outline the pro the first relation 7 Squares from the Products This section uses the binary operations defined by abc de f = bfcecd af aebd abc de f= bfcecd af aebd Note that restricted on the stard Euclidean -space the product is the familiar vector cross-product Theorem The following relations hold for the triples : Pro Since the sums r B B p r D D r are π π it follows that the sum is pp ie the square r This concludes the pro the first relation Theorem The following relations hold for the triples : 7 p p B B p 7 7 r r ( ) D D p p Pro Since the sums are r r 7 r r 7 it follows that the difference the product 7 is opyright SciRes
9 Z ČERIN r r which simplifies to 7 7 ie to the square p p This proves the first relation Notice that in our final result the third added constant value is in all cases the complete square Theorem The following relations hold for the triples : B p p p 7r p p p D B B D r p D p p r B p 7 D r p B r p 7 B D r p D p B Pro Since the sums are p r p p it follows that the sum B is the product p r p p which simplifies to the square p This proves the first relation References [] E Brown Sets in Which xy Is lways a Square Mathematics omputation Vol No 7 pp - [] N Sloane On-Line Encyclopedia Integer Sequences njas/sequences/ [] L Euler ommentationes rithmeticae I Opera Omnia Series I volume II BG Teubner Basel [] Z Čerin On Pencils Euler Triples I (in press) [] Z Čerin On Pencils Euler Triples II (in press) [] M Radić Definition Determinant Rectangular Matrix Glasni Matematic Vol No pp 7- opyright SciRes
On Sums of Products of Horadam Numbers
KYUNGPOOK Math J 49(009), 483-49 On Sums of Products of Horadam Numbers Zvonko ƒerin Kopernikova 7, 10010 Zagreb, Croatia, Europe e-mail : cerin@mathhr Abstract In this paper we give formulae for sums
More informationAREAS OF POLYGONS WITH COORDINATES OF VERTICES FROM HORADAM AND LUCAS NUMBERS. 1. Introduction
SARAJEVO JOURNAL OF MATHEMATICS Vol.13 (26), No.2, (2017), 179188 DOI: 10.5644/SJM.13.2.05 AREAS OF POLYGONS WITH COORDINATES OF VERTICES FROM HORADAM AND LUCAS NUMBERS ZVONKO ƒerin In memory of my dear
More informationChapter 4 ARITHMETIC AND GEOMETRIC PROGRESSIONS 2, 5, 8, 11, 14,..., 101
Chapter 4 ARITHMETIC AND GEOMETRIC PROGRESSIONS A finite sequence such as 2, 5, 8, 11, 14,..., 101 in which each succeeding term is obtained by adding a fixed number to the preceding term is called an
More informationALTERNATING SUMS OF FIBONACCI PRODUCTS
ALTERNATING SUMS OF FIBONACCI PRODUCTS ZVONKO ČERIN Abstract. We consider alternating sums of squares of odd even terms of the Fibonacci sequence alternating sums of their products. These alternating sums
More informationSums of Squares and Products of Jacobsthal Numbers
1 2 47 6 2 11 Journal of Integer Sequences, Vol. 10 2007, Article 07.2.5 Sums of Squares and Products of Jacobsthal Numbers Zvonko Čerin Department of Mathematics University of Zagreb Bijenička 0 Zagreb
More informationON SUMS OF SQUARES OF ODD AND EVEN TERMS OF THE LUCAS SEQUENCE
ON SUMS OF SQUARES OF ODD AND EVEN TERMS OF THE LUCAS SEQUENCE ZVONKO ČERIN 1. Introduction The Fibonacci and Lucas sequences F n and L n are defined by the recurrence relations and F 1 = 1, F 2 = 1, F
More informationON SUMS OF SQUARES OF PELL-LUCAS NUMBERS. Gian Mario Gianella University of Torino, Torino, Italy, Europe.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A15 ON SUMS OF SQUARES OF PELL-LUCAS NUMBERS Zvonko Čerin University of Zagreb, Zagreb, Croatia, Europe cerin@math.hr Gian Mario Gianella
More information15th Bay Area Mathematical Olympiad. BAMO Exam. February 26, Solutions to BAMO-8 and BAMO-12 Problems
15th Bay Area Mathematical Olympiad BAMO Exam February 26, 2013 Solutions to BAMO-8 and BAMO-12 Problems 1 How many different sets of three points in this equilateral triangular grid are the vertices of
More informationInteger Sequences Related to Compositions without 2 s
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 6 (2003), Article 03.2.3 Integer Sequences Related to Compositions without 2 s Phyllis Chinn Department of Mathematics Humboldt State University Arcata,
More informationDIOPHANTINE QUADRUPLES FOR SQUARES OF FIBONACCI AND LUCAS NUMBERS
PORTUGALIAE MATHEMATICA Vol. 52 Fasc. 3 1995 DIOPHANTINE QUADRUPLES FOR SQUARES OF FIBONACCI AND LUCAS NUMBERS Andrej Dujella Abstract: Let n be an integer. A set of positive integers is said to have the
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationOn the Interpolation of series *
On the Interpolation of series * Leonhard Euler 389 A series is said to be interpolated, if its terms are assigned which correspond to fractional or even surdic indices. Therefore, if the general term
More informationWhat are binary numbers and why do we use them? BINARY NUMBERS. Converting decimal numbers to binary numbers
What are binary numbers and why do we use them? BINARY NUMBERS Converting decimal numbers to binary numbers The number system we commonly use is decimal numbers, also known as Base 10. Ones, tens, hundreds,
More informationCONVOLUTION TREES AND PASCAL-T TRIANGLES. JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 1986) 1.
JOHN C. TURNER University of Waikato, Hamilton, New Zealand (Submitted December 986). INTRODUCTION Pascal (6-66) made extensive use of the famous arithmetical triangle which now bears his name. He wrote
More informationTENTH ROOTS AND THE GOLDEN RATIO. J. M. H. PETERS Liverpool Polytechnic, Liverpool L3 3AF, England (Submitted November 1984) 1.
J. M. H. PETERS Liverpool Polytechnic, Liverpool L3 3AF, Engl (Submitted November 1984) 1. INTRODUCTION The ratio of the radius of a circle a side of the inscribed regular decagon equals the golden ratio
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationFIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)
Christopher P. French Grinnell College, Grinnell, IA 0112 (Submitted June 2004-Final Revision September 2004) ABSTRACT We prove that when n is odd, the continued fraction expansion of Fn+ begins with a
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationAlgebra Placement Test Review 1
Name: Date: Period: Algebra Placement Test Review 1 Simplif. 1. 5. 8. 5 4. 8 5. 5 6. 8 Rewrite using eponents. 7. 777777 8. 7777 9. 111111 Write in epanded form. 10. 5 11. 5 Simplif. 1. 1 1 4 1. 1 16 10
More informationSequences and Summations. CS/APMA 202 Rosen section 3.2 Aaron Bloomfield
Sequences and Summations CS/APMA 202 Rosen section 3.2 Aaron Bloomfield 1 Definitions Sequence: an ordered list of elements Like a set, but: Elements can be duplicated Elements are ordered 2 Sequences
More information1 Diophantine quintuple conjecture
Conjectures and results on the size and number of Diophantine tuples Andrej Dujella Department of Mathematics, University of Zagreb Bijenička cesta 30, 10000 Zagreb, CROATIA E-mail: duje@math.hr URL :
More information15 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 2012
1 th Annual Harvard-MIT Mathematics Tournament Saturday 11 February 01 1. Let f be the function such that f(x) = { x if x 1 x if x > 1 What is the total length of the graph of f(f(...f(x)...)) from x =
More informationASSIGNMENT 12 PROBLEM 4
ASSIGNMENT PROBLEM 4 Generate a Fibonnaci sequence in the first column using f 0 =, f 0 =, = f n f n a. Construct the ratio of each pair of adjacent terms in the Fibonnaci sequence. What happens as n increases?
More informationTILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX
#A05 INTEGERS 9 (2009), 53-64 TILING PROOFS OF SOME FORMULAS FOR THE PELL NUMBERS OF ODD INDEX Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN 37996-1300 shattuck@math.utk.edu
More informationSection 11.1 Sequences
Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a
More informationHanoi Open Mathematical Competition 2017
Hanoi Open Mathematical Competition 2017 Junior Section Saturday, 4 March 2017 08h30-11h30 Important: Answer to all 15 questions. Write your answers on the answer sheets provided. For the multiple choice
More information2015 Manitoba Mathematical Competition Key Thursday, February 24, 2015
015 Manitoba Mathematical Competition Key Thursday, February 4, 015 1. (a) Solve for x: 5 x 7 + x 3x = 3 (b) Find the ratio of x to y, given that x y x + y = 5 Solution: (a) Multiplying through by 3x gives
More informationMath 283 Spring 2013 Presentation Problems 4 Solutions
Math 83 Spring 013 Presentation Problems 4 Solutions 1. Prove that for all n, n (1 1k ) k n + 1 n. Note that n means (1 1 ) 3 4 + 1 (). n 1 Now, assume that (1 1k ) n n. Consider k n (1 1k ) (1 1n ) n
More informationCommutative 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 informationOn the Shifted Product of Binary Recurrences
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), rticle 10.6.1 On the Shifted Product of Binary Recurrences Omar Khadir epartment of Mathematics University of Hassan II Mohammedia, Morocco
More informationNumbers and their divisors
Chapter 1 Numbers and their divisors 1.1 Some number theoretic functions Theorem 1.1 (Fundamental Theorem of Arithmetic). Every positive integer > 1 is uniquely the product of distinct prime powers: n
More informationESSAI sur la maniére de trouver le terme général des séries recurrentes.
ESSAI sur la maniére de trouver le terme général des séries recurrentes. JEAN TREMBLEY Mémoires de l Académie royale des sciences et belles-lettres... Berlin, 1797 pp. -105 One knows that the general term
More informationThe Integers. Peter J. Kahn
Math 3040: Spring 2009 The Integers Peter J. Kahn Contents 1. The Basic Construction 1 2. Adding integers 6 3. Ordering integers 16 4. Multiplying integers 18 Before we begin the mathematics of this section,
More informationArithmetic Problems. Chapter Reconstruction of division problems AMM E1 This is Problem E1 of the AMERICAN MATHEMATICAL MONTHLY: x x x x
Chapter 1 Arithmetic Problems 1.1 Reconstruction of division problems 1.1.1 AMM E1 This is Problem E1 of the AMERICAN MATHEMATICAL MONTHLY: x 7 ) Clearly, the last second digit of the quotient is 0. Let
More informationInvestigating Geometric and Exponential Polynomials with Euler-Seidel Matrices
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 (2011), Article 11.4.6 Investigating Geometric and Exponential Polynomials with Euler-Seidel Matrices Ayhan Dil and Veli Kurt Department of Mathematics
More informationPart III, Sequences and Series CS131 Mathematics for Computer Scientists II Note 16 RECURRENCES
CS131 Part III, Sequences and Series CS131 Mathematics for Computer Scientists II Note 16 RECURRENCES A recurrence is a rule which defines each term of a sequence using the preceding terms. The Fibonacci
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationPrecalculus Summer Assignment 2015
Precalculus Summer Assignment 2015 The following packet contains topics and definitions that you will be required to know in order to succeed in CP Pre-calculus this year. You are advised to be familiar
More informationCO-ORDINATE GEOMETRY. 1. Find the points on the y axis whose distances from the points (6, 7) and (4,-3) are in the. ratio 1:2.
UNIT- CO-ORDINATE GEOMETRY Mathematics is the tool specially suited for dealing with abstract concepts of any ind and there is no limit to its power in this field.. Find the points on the y axis whose
More informationThe sum x 1 + x 2 + x 3 is (A): 4 (B): 6 (C): 8 (D): 14 (E): None of the above. How many pairs of positive integers (x, y) are there, those satisfy
Important: Answer to all 15 questions. Write your answers on the answer sheets provided. For the multiple choice questions, stick only the letters (A, B, C, D or E) of your choice. No calculator is allowed.
More informationIB Mathematics HL Year 2 Unit 11: Completion of Algebra (Core Topic 1)
IB Mathematics HL Year Unit : Completion of Algebra (Core Topic ) Homewor for Unit Ex C:, 3, 4, 7; Ex D: 5, 8, 4; Ex E.: 4, 5, 9, 0, Ex E.3: (a), (b), 3, 7. Now consider these: Lesson 73 Sequences and
More informationChapter 5. Number Theory. 5.1 Base b representations
Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More information1 Hanoi Open Mathematical Competition 2017
1 Hanoi Open Mathematical Competition 017 1.1 Junior Section Question 1. Suppose x 1, x, x 3 are the roots of polynomial P (x) = x 3 6x + 5x + 1. The sum x 1 + x + x 3 is (A): 4 (B): 6 (C): 8 (D): 14 (E):
More informationa 2 + b 2 = (p 2 q 2 ) 2 + 4p 2 q 2 = (p 2 + q 2 ) 2 = c 2,
5.3. Pythagorean triples Definition. A Pythagorean triple is a set (a, b, c) of three integers such that (in order) a 2 + b 2 c 2. We may as well suppose that all of a, b, c are non-zero, and positive.
More informationSolutions to Exercises 4
Discrete Mathematics Lent 29 MA2 Solutions to Eercises 4 () Define sequence (b n ) n by b n ( n n..., where we use n ) for > n. Verify that b, b 2 2, and that, for every n 3, we have b n b n b n 2. Solution.
More informationBinary Quadratic Forms as Equal Sums of Like Powers. Titus Piezas III
Binary Quadratic Forms as Equal Sums of Like Powers Titus Piezas III Abstract: A summary of some results for binary quadratic forms as equal sums of like powers will be given, in particular several sum-product
More informationSynopsis by section of Euler s paper E796,
1 Synopsis by section of Euler s paper E796 Recherches sur le problem de trois nombres carres tels que la somme de deux quelconques moins le troisieme fasse un nombre carre Research into the problem of
More informationSection Summary. Sequences. Recurrence Relations. Summations. Examples: Geometric Progression, Arithmetic Progression. Example: Fibonacci Sequence
Section 2.4 Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations Introduction Sequences are ordered lists of elements.
More informationSeveral Generating Functions for Second-Order Recurrence Sequences
47 6 Journal of Integer Sequences, Vol. 009), Article 09..7 Several Generating Functions for Second-Order Recurrence Sequences István Mező Institute of Mathematics University of Debrecen Hungary imezo@math.lte.hu
More informationSolving Linear Systems Using Gaussian Elimination
Solving Linear Systems Using Gaussian Elimination DEFINITION: A linear equation in the variables x 1,..., x n is an equation that can be written in the form a 1 x 1 +...+a n x n = b, where a 1,...,a n
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Corrected Version, 7th April 013 Comments to the author at keithmatt@gmail.com Chapter 1 LINEAR EQUATIONS 1.1
More informationDivisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
More informationFormulas for sums of squares and products of Pell numbers
Formulas for sums of squares and products of Pell numbers TEORIA DEI NUMERI Nota di Zvonko ČERIN e Gian Mario GIANELLA presentata dal socio Corrispondente Marius I. STOKA nell adunanza del 1 Giugno 2006.
More informationarxiv: v2 [math.nt] 23 Sep 2011
ELLIPTIC DIVISIBILITY SEQUENCES, SQUARES AND CUBES arxiv:1101.3839v2 [math.nt] 23 Sep 2011 Abstract. Elliptic divisibility sequences (EDSs) are generalizations of a class of integer divisibility sequences
More informationand the compositional inverse when it exists is A.
Lecture B jacques@ucsd.edu Notation: R denotes a ring, N denotes the set of sequences of natural numbers with finite support, is a generic element of N, is the infinite zero sequence, n 0 R[[ X]] denotes
More informationSection 4.3: Quadratic Formula
Objective: Solve quadratic equations using the quadratic formula. In this section we will develop a formula to solve any quadratic equation ab c 0 where a b and c are real numbers and a 0. Solve for this
More information1. Revision Description Reflect and Review Teasers Answers Recall of Rational Numbers:
1. Revision Description Reflect Review Teasers Answers Recall of Rational Numbers: A rational number is of the form, where p q are integers q 0. Addition or subtraction of rational numbers is possible
More informationDependence and independence
Roberto s Notes on Linear Algebra Chapter 7: Subspaces Section 1 Dependence and independence What you need to now already: Basic facts and operations involving Euclidean vectors. Matrices determinants
More informationDesigning Two-level Fractional Factorial Experiments in Blocks of Size Two
Sankhyā : The Indian Journal of Statistics 2004, Volume 66, Part 2, pp 325-340 c 2004, Indian Statistical Institute Designing Two-level Fractional Factorial Experiments in Blocks of Size Two P.C. Wang
More informationGenerating Functions of Partitions
CHAPTER B Generating Functions of Partitions For a complex sequence {α n n 0,, 2, }, its generating function with a complex variable q is defined by A(q) : α n q n α n [q n ] A(q). When the sequence has
More informationA LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS
Applicable Analysis and Discrete Mathematics, 1 (27, 371 385. Available electronically at http://pefmath.etf.bg.ac.yu A LINEAR BINOMIAL RECURRENCE AND THE BELL NUMBERS AND POLYNOMIALS H. W. Gould, Jocelyn
More informationWashington State Math Championship Mental Math Grades 5
Washington State Math Championship 2006 Mental Math Grades 5 1. What is the volume of a cube with edge 0.5? 2. What is the perimeter of a square that has an area 64? 3. What is one ninth times 207? 4.
More informationOn products of quartic polynomials over consecutive indices which are perfect squares
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 513, Online ISSN 367 875 Vol. 4, 018, No. 3, 56 61 DOI: 10.7546/nntdm.018.4.3.56-61 On products of quartic polynomials over consecutive indices
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS
More informationGENERATING FUNCTIONS OF CENTRAL VALUES IN GENERALIZED PASCAL TRIANGLES. CLAUDIA SMITH and VERNER E. HOGGATT, JR.
GENERATING FUNCTIONS OF CENTRAL VALUES CLAUDIA SMITH and VERNER E. HOGGATT, JR. San Jose State University, San Jose, CA 95. INTRODUCTION In this paper we shall examine the generating functions of the central
More informationDISCUSSION CLASS OF DAX IS ON 22ND MARCH, TIME : 9-12 BRING ALL YOUR DOUBTS [STRAIGHT OBJECTIVE TYPE]
DISCUSSION CLASS OF DAX IS ON ND MARCH, TIME : 9- BRING ALL YOUR DOUBTS [STRAIGHT OBJECTIVE TYPE] Q. Let y = cos x (cos x cos x). Then y is (A) 0 only when x 0 (B) 0 for all real x (C) 0 for all real x
More informationCS Non-recursive and Recursive Algorithm Analysis
CS483-04 Non-recursive and Recursive Algorithm Analysis Instructor: Fei Li Room 443 ST II Office hours: Tue. & Thur. 4:30pm - 5:30pm or by appointments lifei@cs.gmu.edu with subject: CS483 http://www.cs.gmu.edu/
More informationCOM S 330 Lecture Notes Week of Feb 9 13
Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...
More informationEquations and Inequalities
Equations and Inequalities 2 Figure 1 CHAPTER OUTLINE 2.1 The Rectangular Coordinate Systems and Graphs 2.2 Linear Equations in One Variable 2.3 Models and Applications 2.4 Complex Numbers 2.5 Quadratic
More informationFibonacci and k Lucas Sequences as Series of Fractions
DOI: 0.545/mjis.06.4009 Fibonacci and k Lucas Sequences as Series of Fractions A. D. GODASE AND M. B. DHAKNE V. P. College, Vaijapur, Maharashtra, India Dr. B. A. M. University, Aurangabad, Maharashtra,
More informationAnother Proof of Nathanson s Theorems
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 (2011), Article 11.8.4 Another Proof of Nathanson s Theorems Quan-Hui Yang School of Mathematical Sciences Nanjing Normal University Nanjing 210046
More informationHigh School Math Contest
High School Math Contest University of South Carolina February th, 017 Problem 1. If (x y) = 11 and (x + y) = 169, what is xy? (a) 11 (b) 1 (c) 1 (d) (e) 8 Solution: Note that xy = (x + y) (x y) = 169
More informationFermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.
Fermat s Little Theorem Fermat s little theorem is a statement about primes that nearly characterizes them. Theorem: Let p be prime and a be an integer that is not a multiple of p. Then a p 1 1 (mod p).
More informationFull file at
INSTRUCTOR S SOLUTIONS MANUAL to accompany ELEMENTARY NUMBER THEORY AND ITS APPLICATIONS FIFTH EDITION Bart Goddard Kenneth H. Rosen AT&T Labs This work is protected by United States copyright laws and
More informationSequences. 1. Number sequences. 2. Arithmetic sequences. Consider the illustrated pattern of circles:
Sequences 1. Number sequences Consider the illustrated pattern of circles: The first layer has just one blue ball. The second layer has three pink balls. The third layer has five black balls. The fourth
More informationMathematics for Health and Physical Sciences
1 Mathematics for Health and Physical Sciences Collection edited by: Wendy Lightheart Content authors: Wendy Lightheart, OpenStax, Wade Ellis, Denny Burzynski, Jan Clayton, and John Redden Online:
More informationCounting Palindromic Binary Strings Without r-runs of Ones
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 16 (013), Article 13.8.7 Counting Palindromic Binary Strings Without r-runs of Ones M. A. Nyblom School of Mathematics and Geospatial Science RMIT University
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationPractical Session #3 - Recursions
Practical Session #3 - Recursions Substitution method Guess the form of the solution and prove it by induction Iteration Method Convert the recurrence into a summation and solve it Tightly bound a recurrence
More informationALGEBRA+NUMBER THEORY +COMBINATORICS
ALGEBRA+NUMBER THEORY +COMBINATORICS COMP 321 McGill University These slides are mainly compiled from the following resources. - Professor Jaehyun Park slides CS 97SI - Top-coder tutorials. - Programming
More informationGROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION
Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations
More informationUNM - PNM STATEWIDE MATHEMATICS CONTEST XLIX. February 4, 2017 Second Round Three Hours
UNM - PNM STATEWIDE MATHEMATICS CONTEST XLIX February 4, 2017 Second Round Three Hours 1. What are the last two digits of 2017 2017? Answer: 77. From Round 1, we now that (2017) 4 7 4 1 mod 10. Thus 7
More informationIntroduction to Algorithms
Lecture 1 Introduction to Algorithms 1.1 Overview The purpose of this lecture is to give a brief overview of the topic of Algorithms and the kind of thinking it involves: why we focus on the subjects that
More informationPure Core 1. Revision Notes
Pure Core Revision Notes Ma 06 Pure Core Algebra... Indices... Rules of indices... Surds... 4 Simplifing surds... 4 Rationalising the denominator... 4 Quadratic functions... 5 Completing the square....
More information411 SAT ALGEBRA AND GEOMETRY QUESTIONS
SAT ALGEBRA AND GEOMETRY QUESTIONS SAT ALGEBRA AND GEOMETRY QUESTIONS NEW YORK Copyright 00 LearningExpress, LLC. All rights reserved under International and Pan-American Copyright Conventions. Published
More informationDiophantine quadruples and Fibonacci numbers
Diophantine quadruples and Fibonacci numbers Andrej Dujella Department of Mathematics, University of Zagreb, Croatia Abstract A Diophantine m-tuple is a set of m positive integers with the property that
More informationSMT China 2014 Team Test Solutions August 23, 2014
. Compute the remainder when 2 30 is divided by 000. Answer: 824 Solution: Note that 2 30 024 3 24 3 mod 000). We will now consider 24 3 mod 8) and 24 3 mod 25). Note that 24 3 is divisible by 8, but 24
More informationPELLANS SEQUENCE AND ITS DIOPHANTINE TRIPLES. Nurettin Irmak and Murat Alp
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 100114 016, 59 69 DOI: 10.98/PIM161459I PELLANS SEQUENCE AND ITS DIOPHANTINE TRIPLES Nurettin Irmak and Murat Alp Abstract. We introduce a novel
More information2005 Euclid Contest. Solutions
Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario 2005 Euclid Contest Tuesday, April 19, 2005 Solutions c
More informationGOLDEN SEQUENCES OF MATRICES WITH APPLICATIONS TO FIBONACCI ALGEBRA
GOLDEN SEQUENCES OF MATRICES WITH APPLICATIONS TO FIBONACCI ALGEBRA JOSEPH ERCOLANO Baruch College, CUNY, New York, New York 10010 1. INTRODUCTION As is well known, the problem of finding a sequence of
More informationIntroduction to Divide and Conquer
Introduction to Divide and Conquer Sorting with O(n log n) comparisons and integer multiplication faster than O(n 2 ) Periklis A. Papakonstantinou York University Consider a problem that admits a straightforward
More informationOn the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations
On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract We conjecture that there is at least one composite term in
More informationGEORGE RANCH HIGH SCHOOL ALGEBRA I PAP SUMMER PREP PACKET
GEORGE RANCH HIGH SCHOOL ALGEBRA I PAP SUMMER PREP PACKET 2016 Integer Addition, Subtraction, Multiplication, Division BASIC DEFINITIONS: INTEGERS Positive and Negative numbers (and zero) whose decimal
More information1 What is the area model for multiplication?
for multiplication represents a lovely way to view the distribution property the real number exhibit. This property is the link between addition and multiplication. 1 1 What is the area model for multiplication?
More information10.1 Radical Expressions and Functions Math 51 Professor Busken
0. Radical Expressions and Functions Math 5 Professor Busken Objectives Find square roots without a calculator Simplify expressions of the form n a n Evaluate radical functions and find the domain of radical
More informationNEUTRIX CALCULUS I NEUTRICES AND DISTRIBUTIONS 1) J. G. VAN DER CORPUT. (Communicated at the meeting of January 30, 1960)
MATHEMATICS NEUTRIX CALCULUS I NEUTRICES AND DISTRIBUTIONS 1) BY J. G. VAN DER CORPUT (Communicated at the meeting of January 30, 1960) It is my intention to give in this lecture an exposition of a certain
More informationPrimary classes of compositions of numbers
Annales Mathematicae et Informaticae 41 (2013) pp. 193 204 Proceedings of the 15 th International Conference on Fibonacci Numbers and Their Applications Institute of Mathematics and Informatics, Eszterházy
More informationLecture 8 : Structural Induction DRAFT
CS/Math 240: Introduction to Discrete Mathematics 2/15/2011 Lecture 8 : Structural Induction Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last week we discussed proofs by induction. We
More information= 1 when k = 0 or k = n. Otherwise, Fact 4.5 (page 98) says. n(n 1)(n 2) (n k + 3)(n k + 2)(n k + 1) (n k + 1)(n k + 2)(n k + 3) (n 2)(n 1) n
Solutions for Chapter 6 189 6.7 Solutions for Chapter 6 Sections 6.1, 6.2 and 6.3 1. Write an algorithm whose input is an integer n and whose output is the first n Fibonacci numbers. Algorithm: to compute
More informationSecondary Two Mathematics: An Integrated Approach Module 3 - Part One Imaginary Number, Exponents, and Radicals
Secondary Two Mathematics: An Integrated Approach Module 3 - Part One Imaginary Number, Exponents, and Radicals By The Mathematics Vision Project: Scott Hendrickson, Joleigh Honey, Barbara Kuehl, Travis
More information