Jump to content
Wikipedia The Free Encyclopedia

Pernicious number

From Wikipedia, the free encyclopedia
Number with prime Hamming weight

In number theory, a pernicious number is a positive integer such that the Hamming weight of its binary representation is prime, that is, there is a prime number of 1s when it is written as a binary number.[1]

Examples

[edit ]

The first pernicious number is 3, since 3 = 112 and 1 + 1 = 2, which is a prime. The next pernicious number is 5, since 5 = 1012, followed by 6 (1102), 7 (1112) and 9 (10012).[2] The sequence of pernicious numbers begins

3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 17, 18, 19, 20, 21, 22, 24, ... (sequence A052294 in the OEIS).

Properties

[edit ]

No power of two is a pernicious number. This is trivially true, because powers of two in binary form are represented as a one followed by zeros. So each power of two has a Hamming weight of one, and one is not considered to be a prime.[2] On the other hand, every number of the form 2 n + 1 {\displaystyle 2^{n}+1} {\displaystyle 2^{n}+1} with n > 1 {\displaystyle n>1} {\displaystyle n>1}, including every Fermat number, is a pernicious number. This is because the sum of the digits in binary form is 2, which is a prime number.[2]

A Mersenne number 2 n 1 {\displaystyle 2^{n}-1} {\displaystyle 2^{n}-1} has a binary representation consisting of n {\displaystyle n} {\displaystyle n} ones, and is pernicious when n {\displaystyle n} {\displaystyle n} is prime. Every Mersenne prime is a Mersenne number for prime n {\displaystyle n} {\displaystyle n}, and is therefore pernicious. By the Euclid–Euler theorem, the even perfect numbers take the form 2 n 1 ( 2 n 1 ) {\displaystyle 2^{n-1}(2^{n}-1)} {\displaystyle 2^{n-1}(2^{n}-1)} for a Mersenne prime 2 n 1 {\displaystyle 2^{n}-1} {\displaystyle 2^{n}-1}; the binary representation of such a number consists of a prime number n {\displaystyle n} {\displaystyle n} of ones, followed by n 1 {\displaystyle n-1} {\displaystyle n-1} zeros. Therefore, every even perfect number is pernicious.[3] [4]

[edit ]

References

[edit ]
  1. ^ Deza, Elena (2021), Mersenne Numbers And Fermat Numbers, World Scientific, p. 263, ISBN 978-9811230332
  2. ^ a b c Sloane, N. J. A. (ed.), "Sequence A052294", The On-Line Encyclopedia of Integer Sequences , OEIS Foundation
  3. ^ Colton, Simon; Dennis, Louise (2002), "The NumbersWithNames Program", Seventh International Symposium on Artificial Intelligence and Mathematics
  4. ^ Cai, Tianxin (2022), Perfect Numbers And Fibonacci Sequences, World Scientific, p. 50, ISBN 978-9811244094
Classes of natural numbers
×ばつ_2b_±_1743">Of the form a × 2b ± 1
Other polynomial numbers
Recursively defined numbers
Possessing a specific set of other numbers
Expressible via specific sums
2-dimensional
centered
non-centered
3-dimensional
centered
non-centered
pyramidal
4-dimensional
non-centered
Combinatorial numbers
Divisor functions
Prime omega functions
Euler's totient function
Aliquot sequences
Primorial
Numeral system-dependent numbers
Arithmetic functions
and dynamics
Digit sum
Digit product
Coding-related
Other
P-adic numbers-related
Digit-composition related
Digit-permutation related
Divisor-related
Other
Generated via a sieve
Sorting related
Graphemics related

AltStyle によって変換されたページ (->オリジナル) /