Pith. sign in

REVIEW

Parasitic Numbers at Arbitrary Base

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1604.03792 v2 pith:WLCU7N6O submitted 2016-03-31 math.GM

classification math.GM
keywords numbersparasiticbasenumberderivedformulageneratelambda
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A natural number is called an {\lambda}-parasitic number if it is multiplied by integer {\lambda} as the rightmost digit moves to the front. The Full set of these numbers is known in the decimal system. Here, a formula to analytically generate parasitic numbers in any base was derived and demonstrated for the number systems in base t = 3, 4, 5, 8, 10 and 16. It allows to generate parasitic numbers with given numbers of periods. The formula was derived using the definition of parasitic numbers , not their cyclical property.

Discussion (0). Continue with ORCID to comment.

Pith tools