Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

On the minimal elements for the sequence of all powers in the Lemoine-Kátai algorithm
HTML articles powered by AMS MathViewer

by Jukka Pihko PDF
Math. Comp. 60 (1993), 425-430 Request permission

Abstract:

It is proved, with the help of a computer, that for $m = 20$ the first m minimal elements for the sequence of all powers in an integer-representing algorithm are given by ${y_i} = i,i = 1,2,3,{y_{i + 1}} = (y_i^2 + 6{y_i} + 1)/4,i = 3, \ldots ,m - 1$. This extends an earlier result of the author (for $m = 10$).
References
  • Aviezri S. Fraenkel, Systems of numeration, Amer. Math. Monthly 92 (1985), no. 2, 105–114. MR 777556, DOI 10.2307/2322638
  • I. Kátai, Some algorithms for the representation of natural numbers, Acta Sci. Math. (Szeged) 30 (1969), 99–105. MR 240039
  • I. Kátai, On an algorithm for additive representation of integers by prime numbers, Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 12 (1969), 23–27. MR 262196
  • I. Kátai, On additive representation of integers, Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 13 (1970), 77–81 (1971). MR 319925
  • E. Lemoine, Décomposition d’un nombre entier N en ses puissances $n$ièmes maxima, C.R. Paris XCV (1882), 719-722. —, Sur la décomposition d’un nombre en ses carrés maxima, Assoc. Franç. Tunis 25 (1896), 73-77. —, Note sur deus nouvèles décompositions des nombres entiers, Assoc. Franç. Paris 29 (1900), 72-74.
  • Graham Lord, Minimal elements in an integer representing algorithm, Amer. Math. Monthly 83 (1976), no. 3, 193–195. MR 398961, DOI 10.2307/2977025
  • Melvyn B. Nathanson, An algorithm for partitions, Proc. Amer. Math. Soc. 52 (1975), 121–124. MR 379353, DOI 10.1090/S0002-9939-1975-0379353-4
  • Jukka Pihko, An algorithm for additive representation of positive integers, Ann. Acad. Sci. Fenn. Ser. A I Math. Dissertationes 46 (1983), 54. MR 700564
  • Jukka Pihko, On a question of Tverberg, Théorie des nombres (Quebec, PQ, 1987) de Gruyter, Berlin, 1989, pp. 806–810. MR 1024605
  • Jukka Pihko, Fibonacci numbers and an algorithm of Lemoine and Kátai, Applications of Fibonacci numbers, Vol. 3 (Pisa, 1988) Kluwer Acad. Publ., Dordrecht, 1990, pp. 287–297. MR 1125801, DOI 10.1007/978-94-009-1910-5_{3}2
  • Jukka Pihko, On sequences having same minimal elements in the Lemoine-Kátai algorithm, Fibonacci Quart. 30 (1992), no. 4, 344–348. MR 1188738
  • P. Ribenboim, Consecutive powers, Exposition. Math. 2 (1984), no. 3, 193–221. MR 783135
  • E. S. Selmer, Private communication, May 21, 1991.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 11B83, 11Y55
  • Retrieve articles in all journals with MSC: 11B83, 11Y55
Additional Information
  • © Copyright 1993 American Mathematical Society
  • Journal: Math. Comp. 60 (1993), 425-430
  • MSC: Primary 11B83; Secondary 11Y55
  • DOI: https://doi.org/10.1090/S0025-5718-1993-1155575-9
  • MathSciNet review: 1155575