Powerful Number

A powerful number is a positive integer ''m'' such that for every prime number ''p'' dividing ''m'', ''p''² also divides ''m''. Equivalently, a powerful number is the product of a square and a cube, that is, a number ''m'' of the form ''m'' = ''a''²''b''³, where ''a'' and ''b'' are positive integers. Powerful numbers are also known as squareful, square-full, or 2-full. Paul Erdős and George Szekeres studied such numbers and Solomon W. Golomb named such numbers ''powerful''.

The following is a list of all powerful numbers between 1 and 1000:
:1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 72, 81, 100, 108, 121, 125, 128, 144, 169, 196, 200, 216, 225, 243, 256, 288, 289, 324, 343, 361, 392, 400, 432, 441, 484, 500, 512, 529, 576, 625, 648, 675, 676, 729, 784, 800, 841, 864, 900, 961, 968, 972, 1000, ... .

Equivalence of the two definitions

If ''m'' = ''a''²''b''³, then every prime in the prime factorization of ''a'' appears in the prime factorization of ''m'' with an exponent of at least two, and every prime in the prime factorization of ''b'' appears in the prime factorization of ''m'' with an exponent of at least three; therefore, ''m'' is powerful.

In the other direction, suppose that ''m'' is powerful, with prime factorization
:$m = \prod p_i^,$
where each ''α''_''i'' ≥ 2. Define ''γ''_''i'' to be three if ''α''_''i'' is odd, and zero otherwise, and define ''β''_''i'' = ''α''_''i'' − ''γ''_''i''. Then, all values ''β''_''i'' are nonnegative even integers, and all values γ_i are either zero or three, so

:$m = \left(\prod p_i^\right)\left(\prod p_i^\right) = \left(\prod p_i^ \right)^2 \left( \prod p_i^\right)^3$

supplies the desired representation of ''m'' as a product of a square and a cube.

Informally, given the prime factorization of ''m'', take ''b'' to be the product of the prime factors of ''m'' that have an odd exponent (if there are none, then take ''b'' to be 1). Because ''m'' is powerful, each prime factor with an odd exponent has an exponent that is at least 3, so ''m''/''b''³ is an integer. In addition, each prime factor of ''m''/''b''³ has an even exponent, so ''m''/''b''³ is a perfect square, so call this ''a''²; then ''m'' = ''a''²''b''³. For example:

:$m = 21600 = 2^5 \times 3^3 \times 5^2 \, ,$
:$b = 2 \times 3 = 6 \, ,$
:$a = \sqrt = \sqrt = 10 \, ,$
:$m = a^2b^3 = 10^2 \times 6^3 \, .$

The representation ''m'' = ''a''²''b''³ calculated in this way has the property that ''b'' is squarefree, and is uniquely defined by this property.

Mathematical properties

The sum of the reciprocals of the powerful numbers converges. The value of this sum may be written in several other ways, including as the infinite product

: $\prod_p\left(1+\frac\right)=\frac = \frac\zeta(3)=1.9435964368\ldots,$

where ''p'' runs over all primes, ''ζ''(''s'') denotes the Riemann zeta function, and ''ζ''(3) is Apéry's constant.
More generally, the sum of the reciprocals of the ''s''th powers of the powerful numbers (a Dirichlet series generating function) is equal to

:$\frac$

whenever it converges.

Let ''k''(''x'') denote the number of powerful numbers in the interval ,''x'' Then ''k''(''x'') is proportional to the square root of ''x''. More precisely,

: $cx^-3x^\le k(x) \le cx^, c = \zeta(3/2)/\zeta(3) = 2.173 \ldots$

(Golomb, 1970).

The two smallest consecutive powerful numbers are 8 and 9. Since Pell's equation $x^2-8y^2=1$ has infinitely many integral solutions, there are infinitely many pairs of consecutive powerful numbers (Golomb, 1970); more generally, one can find consecutive powerful numbers by solving a similar Pell equation $x^2-ny^2=\pm 1$ for any perfect cube . However, one of the two powerful numbers in a pair formed in this way must be a square. According to Guy, Erdős has asked whether there are infinitely many pairs of consecutive powerful numbers such as $(23^3, 2^3 3^2 13^2)$ in which neither number in the pair is a square. showed that there are indeed infinitely many such pairs by showing that $3^3 c^2 + 1 = 7^3 d^2$ has infinitely many solutions.
Walker's solutions to this equation are generated, for any odd integer $k$, by considering the number

:$(2\sqrt+3\sqrt)^=a\sqrt+b\sqrt,$

for integers $a$ divisible by 7 and $b$ divisible by 3,
and constructing from $a$ and $b$ the consecutive powerful numbers $7a^2$ and $3b^2$ with $7a^2 = 1 + 3b^2$.
The smallest consecutive pair in this family is generated for $k = 1$, $a = 2637362$, and $b = 4028637$ as

:$7\cdot 2637362^2 = 2^2\cdot 7^3\cdot 13^2\cdot 43^2\cdot 337^2=48689748233308$

and

:$3\cdot 4028637^2 = 3^3\cdot 139^2\cdot 9661^2 = 48689748233307.$

It is a conjecture of Erdős, Mollin, and Walsh that there are no three consecutive powerful numbers. If a triplet of consecutive powerful numbers exists, then its smallest term must be congruent to 7, 27, or 35 modulo 36.

If the abc conjecture is true, there are only a finite number of sets of three consecutive powerful numbers.

Sums and differences of powerful numbers

Any odd number is a difference of two consecutive squares: (''k'' + 1)² = ''k''² + 2''k'' + 1, so (''k'' + 1)² − ''k''² = 2''k'' + 1. Similarly, any multiple of four is a difference of the squares of two numbers that differ by two: (''k'' + 2)² − ''k''² = 4''k'' + 4. However, a singly even number, that is, a number divisible by two but not by four, cannot be expressed as a difference of squares. This motivates the question of determining which singly even numbers can be expressed as differences of powerful numbers. Golomb exhibited some representations of this type:

:2 = 3³ − 5²
:10 = 13³ − 3⁷
:18 = 19² − 7³ = 3⁵ − 15².

It had been conjectured that 6 cannot be so represented, and Golomb conjectured that there are infinitely many integers which cannot be represented as a difference between two powerful numbers. However, Narkiewicz showed that 6 can be so represented in infinitely many ways such as

:6 = 5⁴7³ − 463²,

and McDaniel showed that every integer has infinitely many such representations (McDaniel, 1982).

Erdős conjectured that every sufficiently large integer is a sum of at most three powerful numbers; this was proved by Roger Heath-Brown (1987).

Generalization

More generally, we can consider the integers all of whose prime factors have exponents at least ''k''. Such an integer is called a ''k''-powerful number, ''k''-ful number, or ''k''-full number.

:(2^''k''+1 − 1)^''k'',  2^''k''(2^''k''+1 − 1)^''k'',   (2^''k''+1 − 1)^''k''+1

are ''k''-powerful numbers in an arithmetic progression. Moreover, if ''a''₁, ''a''₂, ..., ''a''_''s'' are ''k''-powerful in an arithmetic progression with common difference ''d'', then

: ''a''₁(''a''_''s'' + ''d'')^''k'',  
''a''₂(''a''_''s'' + ''d'')^''k'', ..., ''a''_''s''(''a''_''s'' + ''d'')^''k'', (''a''_''s'' + ''d'')^''k''+1

are ''s'' + 1 ''k''-powerful numbers in an arithmetic progression.

We have an identity involving ''k''-powerful numbers:

:''a''^''k''(''a''^''ℓ'' + ... + 1)^''k'' + ''a''^{''k'' + 1}(''a''^''ℓ'' + ... + 1)^''k'' + ... + ''a''^{''k'' + ''ℓ''}(''a''^''ℓ'' + ... + 1)^''k'' = ''a''^''k''(''a''^''ℓ'' + ... +1)^''k''+1.

This gives infinitely many ''l''+1-tuples of ''k''-powerful numbers whose sum is also ''k''-powerful. Nitaj shows there are infinitely many solutions of ''x'' + ''y'' = ''z'' in relatively prime 3-powerful numbers(Nitaj, 1995). Cohn constructs an infinite family of solutions of ''x'' + ''y'' = ''z'' in relatively prime non-cube 3-powerful numbers as follows: the triplet

:''X'' = 9712247684771506604963490444281, ''Y'' = 32295800804958334401937923416351, ''Z'' = 27474621855216870941749052236511

is a solution of the equation 32''X''³ + 49''Y''³ = 81''Z''³. We can construct another solution by setting ' = ''X''(49''Y''³ + 81''Z''³), ' = −''Y''(32''X''³ + 81''Z''³), ' = ''Z''(32''X''³ − 49''Y''³) and omitting the common divisor.

See also

* Achilles number
* Highly powerful number

Notes

References

*
*
*
*
*
*
*
*
*
*

External links

''Power-full number''
at Encyclopedia of Mathematics.
*

The abc conjecture
*

{{Authority control

Integer sequences
Abc conjecture