A definition is recursive if it makes use of a repeated algorithm. An example of a recursive definition of a sequence is 'Start with the number 1 and add two for each iteration.' The sequence defined is { 1, 3, 5, 7, ... }.
# | A | B | C | D |
E | F | G | H | I |
J | K | L | M | N |
O | P | Q | R | S |
T | U | V | W | Y |
Z | X |
All Math Words Encyclopedia is a service of
Life is a Story Problem LLC.
Copyright © 2018 Life is a Story Problem LLC. All rights reserved.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License