Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

A positive integer $n$ is called square-full or powerfull if $p^2|n$ for every factor $p$ of $n$ for every prime factor $p$.

I need to show that if $n$ is square-full show so it can be written in the form $n=a^2b^3$ for $a,b$ positive integer.

I looked in wikipedia but the proof was too complicated... is there any easy way to prove this?

share|cite|improve this question
up vote 5 down vote accepted

Let $p^r$ be the exact power of $p$ dividing $n$. By hypothesis $r\geq2$.

If $r$ is even put $p^r$ under the '$A$' label. If $r$ is odd then $r\geq3$ so you can put $p^3$ under the '$B$' label and $p^{r-3}$ under the '$A$' label.

Do the above for all $p$ dividing $n$. When you are finished you have that $B$ is a product of cubes, thus itself a cube $B=b^3$, and $A$ is a product of primes with even exponents, thus a square $A=a^2$.

Obviously, $n=AB=a^2b^3$.

share|cite|improve this answer

Take all the primes $p_{\text{odd}}$ which divide $n$ an odd number of times (at least three each). Then let $$b= \prod p_{\text{odd}}$$ and $$a = \sqrt{\frac{n}{b^3}}.$$

All you need to show is that $a$ is a positive integer, as $b$ is by definition (noting that the empty product is $1$). Do this by looking first at primes which divide $n$ an odd number of times (at least three each so when you subtract $3$ you are left with a non-negative even exponent), and then at primes which divide $n$ an even number of times.

share|cite|improve this answer

Suppose $m \geq 2$ is an integer. Then $m = 2\alpha + 3\beta$, where $\alpha$ and $\beta$ are nonnegative integers. The claim follows from this fact, because for any prime $p$ dividing a square-full number $n$, the power of $p$ in the prime factorization of $n$ is $\geq 2$.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.