DOCSLIB.ORG

Author 452 Part 2

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Author 452 Part 2 1 INDEX OF AUTHORS A Abderrezzak, Abdelhamid Multivariate Symmetric Identities 34.5(1996)386 Abercrombie, Alexander G. Letter: Prime Factors of Fx(p), where p is prime 3.2(1975)171 Abrahams, Julia Coupled Sequences of Generalized Fibonacci Trees and Unequal Costs Coding Problems 35.4(1997)309 Nonexhaustive Generalized Fibonacci Trees in Unequal Costs Coding Problem 38.2(2000)127 Varn Codes and Generalized Fibonacci Trees 33.1(1995)21 Abramson, Morton Combinations, Compositions and Occupancy Problems 9.3(1971)225 Restricted Combinations and Compositions 14.5(1976)439 Abrate, Marco Fibonacci Sequences of Quaternions 46/47.4(2008/2009)356 Acosta-de-Orozco, Maria T. & Gomez-Calderon, J. Local Minimal Polynomials over Finite Fields 34.2(1996)139 Andaloro, Paul On Total Stopping Times Under 3x + 1 Iteration 38.1(2000)73 Adelberg, Arnold Higher Order Bernoulli Polynomials and Newton Polygons, PVII(1998)1 Universal Bernoulli Polynomials and P-Adic Congruences, PIX(2004)1 Adiga, Chandrashekar & Bhargava, S. & Somashekara, D.D. Three-Square Theorem as an Application of Andrew's Identity 31.2(1993)129 Somashekara, D.D. & Bhargava, S. Three-Square Theorem as an Application of Andrew's Identity 31.2(1993)129 Adikesavan, A.S. & Narayanaswami, S. Modification of Goka's Binary Sequence, A 17.3(1979)212 Adler, Irving Concerning the Divisors of N and the Exponents they Belong to Modulo (N-1) or (N + 1)27.3(1989)259 Sequences with a Characteristic Number 9.2(1971)147; Shorter Proof, A 7.5(1969)538 Simple Continued Fraction Represents a Mediant Nest of Intervals, A 16.6(1978)527 Three Diophantine Equations, Part I: 6.6(1968)360; Part II: 7.2(1969)181 Agarwal, A.K. Combinatorial Interpretations of the q-Analogues of L2n+1 29.2(1991)137 Note on n(x,y)-Reflected Lattice Paths A, 25.4(1987)317 On a New Kind of Numbers 28.3(1990)194 Properties of a Recurring Sequence 27.2(1989)169 INDEX OF AUTHORS 2 A Agratini, Octavian Generalization of Durrmeyer-Type Polynomials and Their Approximation Properties, A, PIX(2004)9 Aho, A.V. & Sloane, N.J.A. Some Doubly Exponential Sequences 11.4(1973)429 Ahuja, J.C. Orthogonal Expansion Derived from the Extreme Value Distribution 7.5(1969)488 Ahuja, J.C. & Enneking, E.A. Concavity Property and a Recurrence Relation for Associated Lah Numbers 17.2(1979)158 Generalized Bell Numbers 14.1(1976)67 Nash, S.W. Note on Orthogonal Polynomials, A 4.1(1966)49 Aiello, W. & Hardy, G.E. & Subbarao, M.V. On the Existence of e-Multiperfect Numbers 25.1(1987)65 Subbarao, M.V. & Hardy, G.E. On the Existence of e-Multiperfect Numbers 25.1(1987)65 Ainsworth, O.R. On Generating Functions 15.2(1977)161 Ainsworth, O.R. & Morris, J.E., Jr. Property of Quasi-Orthogonal Polynomials, A 18.2(1980)163 Neggers, J. Family of Polynomials and Powers of the Secant, A 21.2(1983)132 Akritas, Alkiviadis G. Sylvester's Forgotten Form of the Resultant 31.4(1993)325 Akritas, A.G. & Bradford, P.G. Role of the Fibonacci Sequence in the Isolation of the Real Roots of Polynomial Equations, The, PIII(1990)1 Alameddine, A.F. Fibonacci Numbers and Bipyramids 27.3(1989)247 Alberti, Furio Another Proof for a Continued Fraction Identity 11.5(1973)533 Root Property of a Psi-Type Equation, A 19.1(1981)56 Alder, Henry L. &[ Lewis, J.K. & Muwafi, A.A. Euler's Partition Identity-Are there Any More Like it? 23.2(1985)113 3 INDEX OF AUTHORS A Alder, Henry L. & Muwafi, Amin A. Generalizations of Euler's Recurrence Formula for Partitions 13.4(1975)337 Identities Relating to the Number of Partitions into an Even and Odd Number of Parts 13.2(1975)147 Muwafi, A.A. & Lewis, J.K. Euler's Partition Identity-Are there Any More Like it? 23.2(1985)113 Alexanderson, G.L. & Hillman, A.P. Motivation for Continued Fractions, A 2.2(1964)145 Hoggatt, V.E., Jr. Property of Multinomial Coefficients, A 9.4(1971)351 Sums of Partition Sets in Generalized Pascal Triangles I, 14.2(1976)117 Klosinski, L.F. Fibonacci Analogue of Gaussian Binomial Coefficients, A 12.2(1974)129 Alford, Cecil O. & Fielder, D.C. Contributions from Cascaded Combinations to the Naming of Special Permutations, PV(1993)207 Investigating Special Binary Sequences with Some Computer Help, PVIII(1999)121 Investigation of Sequences Derived from Hoggatt Sums and Hoggatt Triangles, An, PIII(1990)77 More Applications of a Partition Driven Symmetric Table, PVI(1996)93 Observations from Computer Experiments on an Integer Equation, PVII(1998)93 On a Conjecture by Hoggatt with Extensions to Hoggatt Sums and Hoggatt Triangles 27.2(1989)160 Pascal's Triangle: Top Gun or Just One of the Gang, PIV(1991)77 Alfred, U., Br. (Also see under Brousseau, Alfred, Br) Additional Factors of the Fibonacci and Lucas Series 1.1(1963)34 Book Reviews: Recurring Sequences by Dov Jarden 4.3(1966)208; 5.4(1967)328 Algebra Through Problem Solving by Abraham P. Hillman 4.3(1966)264 Continued Fractions of Fibonacci and Lucas Ratios 2.4(1964)269 Digit Muses, A 2.3(1964)210; Errata 3.1(1965)66 Dying Rabbit Problem Revived 1.4(1963)53 Exploring Fibonacci Magic Squares 2.3(1964)216 Fibonacci Numbers 1.1(1963)57 Fibonacci Numbers with a Calculator 2.2(1964)138 Fibonacci Polygons 1.3(1963)60 Fibonacci Representation of Integers, The 1.4(1963)72; 2.2(1964)114 INDEX OF AUTHORS 4 A Alfred, U., Br. (Cf. Brousseau, Alfred, Br) Exploring Fibonacci Residues 2.1(1964)42 Generalized Fibonacci-Lucas Relations 3.4(1965)319 Geometric-Algebraic Fibonacci Patterns 2.4(1964)318 Recurrent Sequences 1.2(1963)81; Errata 2.1(1964)66 Special Fibonacci Relations 4.3(1966)262 Math Morals 3.1(1965)53 Note on Third Order Determinants 3.1(1965)59 On Square Lucas Numbers 2.1(1964)11 On the Form of Primitive Factors of Fibonacci Numbers 1.1(1963)43 On the Ordering of Fibonacci Sequences 1.4(1963)43; Errata 2.1(1964)38 Periodic Properties of Fibonacci Summations 1.3(1963)33 Primes which Are Factors of All Fibonacci Sequences 2.1(1964)33 Seeking the Lost Gold Mine or Exploring for Fibonacci Factorizations 3.2(1965)129 Some Determinants Involving Powers of Fibonacci Numbers 2.2(1964)81 Strip Method of Summing Linear Fibonacci Expressions, A 3.3(1965)224 Alladi, Krishnaswami Approximation of Irrationals with Farey Fibonacci Fractions 13.3(1975)255 Farey Sequence of Fibonacci Numbers, A 13.1(1975)1 On Polynomials Generated by Triangular Arrays 14.5(1976)461 On the Probability that n and Ù(n)Are Relatively Prime 19.3(1981)228 Rapid Method to Form Farey Fibonacci Fractions, A 13.1(1975)31 Alladi, Krishnaswami & Hoggatt, V.E., Jr. Compositions and Recurrence Relations Part I: Compositions with Ones and Twos 13.3(1975)233; Part II: 15.3(1977)239 Compositions with Ones and Twos 13.3(1975)233 Generalized Fibonacci Tiling 13.2(1975)137 In-Winding Spirals 14.2(1976)144 Limiting Ratios of Convolved Recursive Sequences 15.3(1977)211 On Tribonacci Numbers and Related Functions 15.1(1977)42 Shannon, A.G. On a Property of Consecutive Farey-Fibonacci Fractions 15.2(1977)153 Alameddine, Ahmad Fawzi Bounds on the Fibonacci Number of a Maximal Outerplanar Graph 36.3(1998)206 Allard, A. & Lecomte, P. Periods and Entry Points in Fibonacci Sequence 17.1(1979)51 5 INDEX OF AUTHORS A Allen, H.D. Metric Paper to Fall Short of "Golden Mean" 15.3(1977)220 Almkvist, Gert Solution to a Tantalizing Problem, A 24.4(1986)316 Alonso, James Arithmetic Sequences of Higher Order 14.2(1976)147 Al-Salam, Nadhla A. Some Operational Formulas for the q-Laguerre Polynomials 22.2(1984)166 Al-Salam, W.A. & Verma, A. Fibonacci Numbers and Eulerian Polynomials 9.1(1971)18 Alspach, Brian & Heinrich, K. Perfect Magic Cubes of Order 4m 19.2(1981)97 Altevogt, Rudolf & Davis, T.A. Golden Mean of the Human Body 17.4(1979)340 Altimi ik, E. & Dursun, T. On the Almost Hilbert-Smith Matrices 40.4(2002)339 Alvfeldt, Olov Brain Teaser Related to Fibonacci Numbers, A 7.3(1969)310 Anatassova, Vassia K. & Turner, J.C. On Triangles and Squares Marked with Goldpoints - Studies of Golden Tiles, PVIII(1999)11 Anaya, Janet Crump & Hoggatt, V.E., Jr. Primer for the Fibonacci Numbers, A, Part XI: Multisection Generating Functions for the Columns of Pascal's Triangle 11.1(1973)85 Anaya, Robert & Crump, J. Generalized Greatest Integer Function Theorem, A 10.2(1972)207 Andaloro, Paul J. 3x + 1 Problem and Directed Graphs The 40.1(2002)43 Andersen, Harold & Brousseau, Alfred, Br. & Povse, J. Curious Property of Unit Fractions of the Form 1/d where (d,10) = 1, A 11.1(1973)91 Povse, J. & Brousseau, Alfred, Br. Curious Property of Unit Fractions of the Form 1/d where (d,10) = 1, A 11.1(1973)91 INDEX OF AUTHORS 6 A Anderson, David A. & Loyer, M.W. Diophantine Equation Nb22 = c + N + 1, The 17.1(1979)69 Anderson, Jean H. Spirals, Checkerboards, Polyominoes, and the Fibonacci Sequence 8.1(1970)90 Anderson, O.D. Some More Patterns from Pascal's Triangle 16.4(1978)296 Anderson, Peter G. Advances in Linear Pixel Shuffling, PVI(1996)1 Anderson, Peter G. Book Review: Proofs that Really Count: The Art of Combinatorial Proof by Arthur T.
Load more

Recommended publications
  • Bi-Unitary Multiperfect Numbers, I
    Notes on Number Theory and Discrete Mathematics Print ISSN 1310–5132, Online ISSN 2367–8275 Vol. 26, 2020, No. 1, 93–171 DOI: 10.7546/nntdm.2020.26.1.93-171 Bi-unitary multiperfect numbers, I Pentti Haukkanen1 and Varanasi Sitaramaiah2 1 Faculty of Information Technology and Communication Sciences, FI-33014 Tampere University, Finland e-mail: [email protected] 2 1/194e, Poola Subbaiah Street, Taluk Office Road, Markapur Prakasam District, Andhra Pradesh, 523316 India e-mail: [email protected] Dedicated to the memory of Prof. D. Suryanarayana Received: 19 December 2019 Revised: 21 January 2020 Accepted: 5 March 2020 Abstract: A divisor d of a positive integer n is called a unitary divisor if gcd(d; n=d) = 1; and d is called a bi-unitary divisor of n if the greatest common unitary divisor of d and n=d is unity. The concept of a bi-unitary divisor is due to D. Surynarayana [12]. Let σ∗∗(n) denote the sum of the bi-unitary divisors of n: A positive integer n is called a bi-unitary perfect number if σ∗∗(n) = 2n. This concept was introduced by C. R. Wall in 1972 [15], and he proved that there are only three bi-unitary perfect numbers, namely 6, 60 and 90. In 1987, Peter Hagis [6] introduced the notion of bi-unitary multi k-perfect numbers as solu- tions n of the equation σ∗∗(n) = kn. A bi-unitary multi 3-perfect number is called a bi-unitary triperfect number. A bi-unitary multiperfect number means a bi-unitary multi k-perfect number with k ≥ 3: Hagis [6] proved that there are no odd bi-unitary multiperfect numbers.
    [Show full text]
  • On the Prime Number Subset of the Fibonacci Numbers
    Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach On the Prime Number Subset of the Fibonacci Numbers Lacey Fish1 Brandon Reid2 Argen West3 1Department of Mathematics Louisiana State University Baton Rouge, LA 2Department of Mathematics University of Alabama Tuscaloosa, AL 3Department of Mathematics University of Louisiana Lafayette Lafayette, LA Lacey Fish, Brandon Reid, Argen West SMILE Presentations, 2010 LSU, UA, ULL Sieve Theory Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach Basic Definitions What is a sieve? What is a sieve? A sieve is a method to count or estimate the size of “sifted sets” of integers. Well, what is a sifted set? A sifted set is made of the remaining numbers after filtering. Lacey Fish, Brandon Reid, Argen West LSU, UA, ULL Sieve Theory Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach Basic Definitions What is a sieve? What is a sieve? A sieve is a method to count or estimate the size of “sifted sets” of integers. Well, what is a sifted set? A sifted set is made of the remaining numbers after filtering. Lacey Fish, Brandon Reid, Argen West LSU, UA, ULL Sieve Theory Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach Basic Definitions History Two Famous and Useful Sieves Sieve of Eratosthenes Brun’s Sieve Lacey Fish, Brandon Reid, Argen West
    [Show full text]
  • ON SOME GAUSSIAN PELL and PELL-LUCAS NUMBERS Abstract
    Ordu Üniv. Bil. Tek. Derg., Cilt:6, Sayı:1, 2016,8-18/Ordu Univ. J. Sci. Tech., Vol:6, No:1,2016,8-18 ON SOME GAUSSIAN PELL AND PELL-LUCAS NUMBERS Serpil Halıcı*1 Sinan Öz2 1Pamukkale Uni., Science and Arts Faculty,Dept. of Math., KınıklıCampus, Denizli, Turkey 2Pamukkale Uni., Science and Arts Faculty,Dept. of Math., Denizli, Turkey Abstract In this study, we consider firstly the generalized Gaussian Fibonacci and Lucas sequences. Then we define the Gaussian Pell and Gaussian Pell-Lucas sequences. We give the generating functions and Binet formulas of Gaussian Pell and Gaussian Pell- Lucas sequences. Moreover, we obtain some important identities involving the Gaussian Pell and Pell-Lucas numbers. Keywords. Recurrence Relation, Fibonacci numbers, Gaussian Pell and Pell-Lucas numbers. Özet Bu çalışmada, önce genelleştirilmiş Gaussian Fibonacci ve Lucas dizilerini dikkate aldık. Sonra, Gaussian Pell ve Gaussian Pell-Lucas dizilerini tanımladık. Gaussian Pell ve Gaussian Pell-Lucas dizilerinin Binet formüllerini ve üreteç fonksiyonlarını verdik. Üstelik, Gaussian Pell ve Gaussian Pell-Lucas sayılarını içeren bazı önemli özdeşlikler elde ettik. AMS Classification. 11B37, 11B39.1 * [email protected], 8 S. Halıcı, S. Öz 1. INTRODUCTION From (Horadam 1961; Horadam 1963) it is well known Generalized Fibonacci sequence {푈푛}, 푈푛+1 = 푝푈푛 + 푞푈푛−1 , 푈0 = 0 푎푛푑 푈1 = 1, and generalized Lucas sequence {푉푛} are defined by 푉푛+1 = 푝푉푛 + 푞푉푛−1 , 푉0 = 2 푎푛푑 푉1 = 푝, where 푝 and 푞 are nonzero real numbers and 푛 ≥ 1. For 푝 = 푞 = 1, we have classical Fibonacci and Lucas sequences. For 푝 = 2, 푞 = 1, we have Pell and Pell- Lucas sequences.
    [Show full text]
  • Counting Restricted Partitions of Integers Into Fractions: Symmetry and Modes of the Generating Function and a Connection to Ω(T)
    Counting Restricted Partitions of Integers into Fractions: Symmetry and Modes of the Generating Function and a Connection to !(t) Z. Hoelscher and E. Palsson ∗ December 1, 2020 Abstract - Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions for integers smaller than the denominator form symmetric patterns. If the number of terms is restricted to h, then the nonzero terms of the generating function are unimodal, with the integer h having the most partitions. Such properties can be applied to a particular class of nonlinear Diophantine equations. We also examine partitions with even numerators. We prove that there are 2!(t) − 2 partitions of an integer t into fractions with the first x consecutive even integers for numerators and equal denominators of y, where 0 < y < x < t. We then use this to produce corollaries such as a Dirichlet series identity and an extension of the prime omega function to the complex plane, though this extension is not analytic everywhere. Keywords : Integer partitions; Restricted partitions; Partitions into fractions Mathematics Subject Classification (2020) : 05A17 1 Introduction Integer partitions are a classic part of number thoery. In the most general, unrestricted case, one seeks to express positive integers as the sum of smaller positive integers. Often the function p(n) is used to denote the count of the partitions of n. No simple formula for this is known, though a generating function can be written [1].
    [Show full text]
  • A NEW LARGEST SMITH NUMBER Patrick Costello Department of Mathematics and Statistics, Eastern Kentucky University, Richmond, KY 40475 (Submitted September 2000)
    A NEW LARGEST SMITH NUMBER Patrick Costello Department of Mathematics and Statistics, Eastern Kentucky University, Richmond, KY 40475 (Submitted September 2000) 1. INTRODUCTION In 1982, Albert Wilansky, a mathematics professor at Lehigh University wrote a short article in the Two-Year College Mathematics Journal [6]. In that article he identified a new subset of the composite numbers. He defined a Smith number to be a composite number where the sum of the digits in its prime factorization is equal to the digit sum of the number. The set was named in honor of Wi!anskyJs brother-in-law, Dr. Harold Smith, whose telephone number 493-7775 when written as a single number 4,937,775 possessed this interesting characteristic. Adding the digits in the number and the digits of its prime factors 3, 5, 5 and 65,837 resulted in identical sums of42. Wilansky provided two other examples of numbers with this characteristic: 9,985 and 6,036. Since that time, many things have been discovered about Smith numbers including the fact that there are infinitely many Smith numbers [4]. The largest Smith numbers were produced by Samuel Yates. Using a large repunit and large palindromic prime, Yates was able to produce Smith numbers having ten million digits and thirteen million digits. Using the same large repunit and a new large palindromic prime, the author is able to find a Smith number with over thirty-two million digits. 2. NOTATIONS AND BASIC FACTS For any positive integer w, we let S(ri) denote the sum of the digits of n.
    [Show full text]
  • Generalizing Ruth-Aaron Numbers
    Generalizing Ruth-Aaron Numbers Y. Jiang and S.J. Miller Abstract - Let f(n) be the sum of the prime divisors of n, counted with multiplicity; thus f(2020) = f(22 ·5·101) = 110. Ruth-Aaron numbers, or integers n with f(n) = f(n+1), have been an interest of many number theorists since the famous 1974 baseball game gave them the elegant name after two baseball stars. Many of their properties were first discussed by Erd}os and Pomerance in 1978. In this paper, we generalize their results in two directions: by raising prime factors to a power and allowing a small difference between f(n) and f(n + 1). We x(log log x)3 log log log x prove that the number of integers up to x with fr(n) = fr(n+1) is O (log x)2 , where fr(n) is the Ruth-Aaron function replacing each prime factor with its r−th power. We also prove that the density of n remains 0 if jfr(n) − fr(n + 1)j ≤ k(x), where k(x) is a function of x with relatively low rate of growth. Moreover, we further the discussion of the infinitude of Ruth-Aaron numbers and provide a few possible directions for future study. Keywords : Ruth-Aaron numbers; largest prime factors; multiplicative functions; rate of growth Mathematics Subject Classification (2020) : 11N05; 11N56; 11P32 1 Introduction On April 8, 1974, Henry Aarony hit his 715th major league home run, sending him past Babe Ruth, who had a 714, on the baseball's all-time list.
    [Show full text]
  • Adopting Number Sequences for Shielding Information
    Manish Bansal et al, International Journal of Computer Science and Mobile Computing, Vol.3 Issue.11, November- 2014, pg. 660-667 Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 3, Issue. 11, November 2014, pg.660 – 667 RESEARCH ARTICLE Adopting Number Sequences for Shielding Information Mrs. Sandhya Maitra, Mr. Manish Bansal, Ms. Preety Gupta Associate Professor - Department of Computer Applications and Institute of Information Technology and Management, India Student - Department of Computer Applications and Institute of Information Technology and Management, India Student - Department of Computer Applications and Institute of Information Technology and Management, India [email protected] , [email protected] , [email protected] Abstract:-The advancement of technology and global communication networks puts up the question of safety of conveyed data and saved data over these media. Cryptography is the most efficient and feasible mode to transfer security services and also Cryptography is becoming effective tool in numerous applications for information security. This paper studies the shielding of information with the help of cryptographic function and number sequences. The efficiency of the given method is examined, which assures upgraded cryptographic services in physical signal and it is also agile and clear for realization. 1. Introduction Cryptography is the branch of information security. The basic goal of cryptography is to make communication secure in the presence of third party (intruder). Encryption is the mechanism of transforming information into unreadable (cipher) form. This is accomplished for data integrity, forward secrecy, authentication and mainly for data confidentiality.
    [Show full text]
  • On the Connections Between Pell Numbers and Fibonacci P-Numbers
    Notes on Number Theory and Discrete Mathematics Print ISSN 1310–5132, Online ISSN 2367–8275 Vol. 27, 2021, No. 1, 148–160 DOI: 10.7546/nntdm.2021.27.1.148-160 On the connections between Pell numbers and Fibonacci p-numbers Anthony G. Shannon1, Ozg¨ ur¨ Erdag˘2 and Om¨ ur¨ Deveci3 1 Warrane College, University of New South Wales Kensington, Australia e-mail: [email protected] 2 Department of Mathematics, Faculty of Science and Letters Kafkas University 36100, Turkey e-mail: [email protected] 3 Department of Mathematics, Faculty of Science and Letters Kafkas University 36100, Turkey e-mail: [email protected] Received: 24 April 2020 Revised: 4 January 2021 Accepted: 7 January 2021 Abstract: In this paper, we define the Fibonacci–Pell p-sequence and then we discuss the connection of the Fibonacci–Pell p-sequence with the Pell and Fibonacci p-sequences. Also, we provide a new Binet formula and a new combinatorial representation of the Fibonacci–Pell p-numbers by the aid of the n-th power of the generating matrix of the Fibonacci–Pell p-sequence. Furthermore, we derive relationships between the Fibonacci–Pell p-numbers and their permanent, determinant and sums of certain matrices. Keywords: Pell sequence, Fibonacci p-sequence, Matrix, Representation. 2010 Mathematics Subject Classification: 11K31, 11C20, 15A15. 1 Introduction The well-known Pell sequence fPng is defined by the following recurrence relation: Pn+2 = 2Pn+1 + Pn for n ≥ 0 in which P0 = 0 and P1 = 1. 148 There are many important generalizations of the Fibonacci sequence. The Fibonacci p-sequence [22, 23] is one of them: Fp (n) = Fp (n − 1) + Fp (n − p − 1) for p = 1; 2; 3;::: and n > p in which Fp (0) = 0, Fp (1) = ··· = Fp (p) = 1.
    [Show full text]
  • On the Largest Odd Component of a Unitary Perfect Number*
    ON THE LARGEST ODD COMPONENT OF A UNITARY PERFECT NUMBER* CHARLES R. WALL Trident Technical College, Charleston, SC 28411 (Submitted September 1985) 1. INTRODUCTION A divisor d of an integer n is a unitary divisor if gcd (d9 n/d) = 1. If d is a unitary divisor of n we write d\\n9 a natural extension of the customary notation for the case in which d is a prime power. Let o * (n) denote the sum of the unitary divisors of n: o*(n) = £ d. d\\n Then o* is a multiplicative function and G*(pe)= 1 + p e for p prime and e > 0. We say that an integer N is unitary perfect if o* (N) = 2#. In 1966, Sub- baro and Warren [2] found the first four unitary perfect numbers: 6 = 2 * 3 ; 60 = 223 - 5 ; 90 = 2 * 325; 87,360 = 263 • 5 • 7 • 13. In 1969s I announced [3] the discovery of another such number, 146,361,936,186,458,562,560,000 = 2183 • 5^7 • 11 • 13 • 19 • 37 • 79 • 109 * 157 • 313, which I later proved [4] to be the fifth unitary perfect number. No other uni- tary perfect numbers are known. Throughout what follows, let N = 2am (with m odd) be unitary perfect and suppose that K is the largest odd component (i.e., prime power unitary divisor) of N. In this paper we outline a proof that, except for the five known unitary perfect numbers, K > 2 2. TECHNIQUES In light of the fact that 0*(pe) = 1 + pe for p prime, the problem of find- ing a unitary perfect number is equivalent to that of expressing 2 as a product of fractions, with each numerator being 1 more than its denominator, and with the denominators being powers of distinct primes.
    [Show full text]
  • Types of Integer Harmonic Numbers (Ii)
    Bulletin of the Transilvania University of Bra¸sov • Vol 9(58), No. 1 - 2016 Series III: Mathematics, Informatics, Physics, 67-82 TYPES OF INTEGER HARMONIC NUMBERS (II) Adelina MANEA1 and Nicu¸sorMINCULETE2 Abstract In the first part of this paper we obtained several bi-unitary harmonic numbers which are higher than 109, using the Mersenne prime numbers. In this paper we investigate bi-unitary harmonic numbers of some particular forms: 2k · n, pqt2, p2q2t, with different primes p, q, t and a squarefree inte- ger n. 2010 Mathematics Subject Classification: 11A25. Key words: harmonic numbers, bi-unitary harmonic numbers. 1 Introduction The harmonic numbers introduced by O. Ore in [8] were named in this way by C. Pomerance in [11]. They are defined as positive integers for which the harmonic mean of their divisors is an integer. O. Ore linked the perfect numbers with the harmonic numbers, showing that every perfect number is harmonic. A list of the harmonic numbers less than 2 · 109 is given by G. L. Cohen in [1], finding a total of 130 of harmonic numbers, and G. L. Cohen and R. M. Sorli in [2] have continued to this list up to 1010. The notion of harmonic numbers is extended to unitary harmonic numbers by K. Nageswara Rao in [7] and then to bi-unitary harmonic numbers by J. S´andor in [12]. Our paper is inspired by [12], where J. S´andorpresented a table containing all the 211 bi-unitary harmonic numbers up to 109. We extend the J. S´andors's study, looking for other bi-unitary harmonic numbers, greater than 109.
    [Show full text]
  • Fibonacci and -Lucas Numbers
    Hindawi Publishing Corporation Chinese Journal of Mathematics Volume 2013, Article ID 107145, 7 pages http://dx.doi.org/10.1155/2013/107145 Research Article Incomplete -Fibonacci and -Lucas Numbers José L. Ramírez Instituto de Matematicas´ y sus Aplicaciones, Universidad Sergio Arboleda, Colombia Correspondence should be addressed to JoseL.Ram´ ´ırez; [email protected] Received 10 July 2013; Accepted 11 September 2013 Academic Editors: B. Li and W. van der Hoek Copyright © 2013 JoseL.Ram´ ´ırez. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We define the incomplete k-Fibonacci and k-Lucas numbers; we study the recurrence relations and some properties of these numbers. 1. Introduction In [6],theauthorsdefinetheincompleteFibonacciandLucas -numbers. Also the authors define the incomplete bivariate Fibonacci numbers and their generalizations have many Fibonacci and Lucas -polynomials in [7]. interesting properties and applications to almost every field On the other hand, many kinds of generalizations of of science and art (e.g., see [1]). Fibonacci numbers are Fibonaccinumbershavebeenpresentedintheliterature.In defined by the recurrence relation particular, a generalization is the -Fibonacci Numbers. For any positive real number ,the-Fibonacci sequence, 0 =0, 1 =1, +1 = +−1,⩾1. (1) say {,}∈N, is defined recurrently by There exist a lot of properties about Fibonacci numbers. =0, =1, = + ,⩾1. In particular, there is a beautiful combinatorial identity to ,0 ,1 ,+1 , ,−1 (4) Fibonacci numbers [1] In [8], -Fibonacci numbers were found by studying ⌊(−1)/2⌋ −−1 = ∑ ( ). the recursive application of two geometrical transformations (2) =0 used in the four-triangle longest-edge (4TLE) partition.
    [Show full text]
  • On H(X)-Fibonacci Octonion Polynomials, Ahmet Ipek & Kamil
    Alabama Journal of Mathematics ISSN 2373-0404 39 (2015) On h(x)-Fibonacci octonion polynomials Ahmet Ipek˙ Kamil Arı Karamanoglu˘ Mehmetbey University, Karamanoglu˘ Mehmetbey University, Science Faculty of Kamil Özdag,˘ Science Faculty of Kamil Özdag,˘ Department of Mathematics, Karaman, Turkey Department of Mathematics, Karaman, Turkey In this paper, we introduce h(x)-Fibonacci octonion polynomials that generalize both Cata- lan’s Fibonacci octonion polynomials and Byrd’s Fibonacci octonion polynomials and also k- Fibonacci octonion numbers that generalize Fibonacci octonion numbers. Also we derive the Binet formula and and generating function of h(x)-Fibonacci octonion polynomial sequence. Introduction and Lucas numbers (Tasci and Kilic (2004)). Kiliç et al. (2006) gave the Binet formula for the generalized Pell se- To investigate the normed division algebras is greatly a quence. important topic today. It is well known that the octonions The investigation of special number sequences over H and O are the nonassociative, noncommutative, normed division O which are not analogs of ones over R and C has attracted algebra over the real numbers R. Due to the nonassociative some recent attention (see, e.g.,Akyigit,˘ Kösal, and Tosun and noncommutativity, one cannot directly extend various re- (2013), Halici (2012), Halici (2013), Iyer (1969), A. F. Ho- sults on real, complex and quaternion numbers to octonions. radam (1963) and Keçilioglu˘ and Akkus (2015)). While ma- The book by Conway and Smith (n.d.) gives a great deal of jority of papers in the area are devoted to some Fibonacci- useful background on octonions, much of it based on the pa- type special number sequences over R and C, only few of per of Coxeter et al.
    [Show full text]