Several results on sequences which are similar to the positive integers

Abstract

Sequence of positive integers \xn\n≥1 is called similar to N respectively a given property A if for every n≥1 the numbers xn and n are in the same class of equivalence respectively A(xn n (prop A). If x1=a(>1)1 (prop A) and xn>xn-1 with the condition that xn is the nearest to xn-1 number such that xn n (prop A), then the sequence \xn\ is called minimal recursive with the first term a(\xn(a)\). We study two cases: A=A1 is the value of exponent of the highest power of 2 dividing an integer and A=A2 is the parity of the number of ones in the binary expansion of an integer. In the first case we prove that, for sufficiently large n, xn(a)=xn(3); in the second case we prove that, for a>4 and sufficiently large n, xn(a)=xn(4).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…