Authors: Walter A. Kehowski
If the digits of number n (in base b) can be split p|q so that n=rq rp$, where rp and rq are the numbers formed by reversing the digits of p and q, respectively, then n is called a phoenix number in base b. If q has k digits in base b, then n is called a k-Phoenix number in base b. For example, 1.1.n.n|b is 1-Phoenix in base b=n^2-1. The existence of infinitely many k-phoenix numbers in any base b is claimed, but not proven.
Comments: 135 Pages. (Note by viXra Admin: Please cite listed scientific reference and submit article written with AI assistance to ai.viXra.org)
Download: PDF
[v1] 2026-03-11 20:50:18
Unique-IP document downloads: 143 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.