close
Jump to content

Meertens number

From Wikipedia, the free encyclopedia

In number theory and mathematical logic, a Meertens number in a given number base b is a natural number that is its own Gödel number. It was named after Lambert Meertens by Richard S. Bird as a present during the celebration of his 25 years at the CWI, Amsterdam.[1]

Definition

[edit]

Let n be a natural number. We define the Meertens function for base b>1 Fb:ℕ→ℕ to be the following:

Fb(n)=∏i=0k−1pk−i−1di.

where k=⌊logbn⌋+1 is the number of digits in the number in base b, pi is the i-th prime number (starting at 0), and

di=nmodbi+1−nmodbibi

is the value of each digit of the number. A natural number n is a Meertens number if it is a fixed point for Fb, which occurs if Fb(n)=n. This corresponds to a Gödel encoding.

For example, the number 3020 in base b=4 is a Meertens number, because

3020=23305270.

A natural number n is a sociable Meertens number if it is a periodic point for Fb, where Fbk(n)=n for a positive integer k, and forms a cycle of period k. A Meertens number is a sociable Meertens number with k=1, and a amicable Meertens number is a sociable Meertens number with k=2.

The number of iterations i needed for Fbi(n) to reach a fixed point is the Meertens function's persistence of n, and undefined if it never reaches a fixed point.

Meertens numbers and cycles of Fb for specific b

[edit]

All numbers are in base b.

b Meertens numbers Cycles Comments
210, 110, 1010n<296[2]
310111 → 20 → 11n<360[2]
430202 → 10 → 2n<448[2]
511, 3032000, 21302000n<541[2]
613012 → 30 → 12n<637[2]
7202n<734[2]
8330n<832[2]
97810000n<930[2]
1081312000n<1029[2]
11∅n<1144[2]
12∅n<1240[2]
13∅n<1339[2]
1413310n<1425[2]
15∅n<1537[2]
16122 → 4 → 10 → 2n<1624[2]

See also

[edit]

References

[edit]
  1. ↑ Richard S. Bird (1998). "Meertens number". Journal of Functional Programming. 8 (1): 83–88. doi:10.1017/S0956796897002931. S2CID 2939112.
  2. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 (sequence A246532 in the OEIS)
[edit]