40(4)
... Articles should be submitted using the format of articles in any current issues of THE FIBONACCI QUARTERLY. They should be typewritten or reproduced typewritten copies, that are clearly readable, double spaced with wide margins and on only one side of the paper. The full name and address of the auth ...
... Articles should be submitted using the format of articles in any current issues of THE FIBONACCI QUARTERLY. They should be typewritten or reproduced typewritten copies, that are clearly readable, double spaced with wide margins and on only one side of the paper. The full name and address of the auth ...
A Triangular Journey
... The triangular numbers are one of the most important and valuable series in mathematics. A series is the sum of a sequence. The sequence of natural numbers 1 + 2 + 3 + 4 + … has the formula ½n(n + 1) where n is the number of numbers being added. This formula is multiplicative and demands that a stud ...
... The triangular numbers are one of the most important and valuable series in mathematics. A series is the sum of a sequence. The sequence of natural numbers 1 + 2 + 3 + 4 + … has the formula ½n(n + 1) where n is the number of numbers being added. This formula is multiplicative and demands that a stud ...
19(5)
... identity sets have been omitted. They are tedious and do involve complicated, albeit fairly elementary, calculations. For some readers, the proofs would involve the use of composition algebras which are not developed in the article and which may not be well known. The author has completed a suppleme ...
... identity sets have been omitted. They are tedious and do involve complicated, albeit fairly elementary, calculations. For some readers, the proofs would involve the use of composition algebras which are not developed in the article and which may not be well known. The author has completed a suppleme ...
NT5
... the largest integer that divides both x and y . We denote the greatest common divisor of x and y GCD ( x , y ). Similarly, the GCD of a set of integers is the largest number that divides all of the integers in the set. Your second task today will be to come up with a procedure for finding the GCD of ...
... the largest integer that divides both x and y . We denote the greatest common divisor of x and y GCD ( x , y ). Similarly, the GCD of a set of integers is the largest number that divides all of the integers in the set. Your second task today will be to come up with a procedure for finding the GCD of ...
A54 INTEGERS 10 (2010), 733-745 REPRESENTATION NUMBERS
... v are adjacent if and only if gcd(f (u)−f (v), r) = 1: we refer to f as a representative labeling of G. Equivalently, G is representable modulo r if there exists an injective map f : V (G) → Zr such that vi is adjacent to vj if and only if f (i) − f (j) is a unit of (the ring) Zr . The representatio ...
... v are adjacent if and only if gcd(f (u)−f (v), r) = 1: we refer to f as a representative labeling of G. Equivalently, G is representable modulo r if there exists an injective map f : V (G) → Zr such that vi is adjacent to vj if and only if f (i) − f (j) is a unit of (the ring) Zr . The representatio ...
