Formalizing Moessner's theorem and generalizations in Nuprl

Moessner's theorem describes a procedure for generating a sequence of n integer sequences that lead unexpectedly to the sequence of nth powers 1n, 2n, 3n, … . Several generalizations of Moessner's theorem exist. Recently, Kozen and Silva gave an algebraic proof of a general theorem that su...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 124; p. 100713
Main Authors Bickford, Mark, Kozen, Dexter, Silva, Alexandra
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.01.2022
Subjects
Online AccessGet full text

Cover

Loading…