# digitaddition generator

Given an integer $m$ consisting of $k$ digits ${d}_{x}$ in base $b$, it follows that

$$m+\sum _{i=0}^{k-1}{d}_{i+1}{b}^{i}=n$$ |

, another integer. Then $m$ is said to be the digitaddition generator of $n$.

In a randomly chosen range of $2b$ consecutive integers, most will have a digitaddition generator and one or two might have none (such integers are called self numbers). If the range falls near a multiple^{} of ${b}^{2}$, it might contain a few numbers with two digitaddition generators. If the range includes $$ and $2|b$, the $n|\u03382$ will lack digitaddition generators.

Title | digitaddition generator |
---|---|

Canonical name | DigitadditionGenerator |

Date of creation | 2013-03-22 15:56:12 |

Last modified on | 2013-03-22 15:56:12 |

Owner | PrimeFan (13766) |

Last modified by | PrimeFan (13766) |

Numerical id | 5 |

Author | PrimeFan (13766) |

Entry type | Definition |

Classification | msc 11A63 |

Synonym | digit addition generator |

Synonym | digit-addition generator |