# AN ANALYSIS OF n-EIVEN NUMBERS

@inproceedings{Grundman1999ANAO, title={AN ANALYSIS OF n-EIVEN NUMBERS}, author={H. Grundman}, year={1999} }

For a positive integer a and w>2, define sn(a) to be the sum of the digits in the base n expansion of a. If sn is applied recursively, it clearly stabilizes at some value. Let S„(a) = s£(a) for all sufficiently large k. A Niven number [3] is a positive integer a that is divisible by $m(a). We define a riven number (short for recursive Niven number) to be a positive integer a that is divisible by Sl0(q). As in [2], these concepts are generalized to w-Miven numbers and w-riven numbers, using the… Expand

#### References

SHOWING 1-9 OF 9 REFERENCES

Construction of 2*n Consecutive Niven Numbers

- The Fibonacci Quarterly
- 1997

Construction of 2*n Consecutive Niven Numbers." The Fibonacci Quarterly

- AMS Classification Number:
- 1997

Construction of Small Consecutive Niven Numbers

- The Fibonacci Quarterly
- 1996

Construction of Small Consecutive Niven Numbers." The Fibonacci Quarterly 34.3(1996):240-43

- 1996

Sequences of Consecutive w-Niven Numbers.

- The Fibonacci Quarterly
- 1994

On Consecutive Niven Numbers." The Fibonacci Quarterly 31.2(1993):146-51

- 1993

AMS Classification Number

- AMS Classification Number