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...
Saved in:
Published in | Journal of logical and algebraic methods in programming Vol. 124; p. 100713 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.01.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!