Math 2.0

Number theory Definition

Square-free integer

Builds on Prime numberDivisibility

Definition

A nonzero integer nn is square-free when no square of a prime number divides nn. That is, there is no prime pp such that p2∣np^2 \mid n.

Remarks

Equivalently, nn is square-free when the only perfect squares that divide nn are 11. A positive integer is square-free if and only if each exponent in its prime factorization is 11. The first square-free positive integers are 1,2,3,5,6,7,10,11,13,14,151, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15. The integer 12=22⋅312 = 2^2 \cdot 3 is not square-free. The integer 00 is not square-free, because each square divides 00.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Divisibility definition
  2. Prime number definition
  3. Square-free integer definition

Where this leads

7 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Square-free_integer, lead section
About this page
Tag004JW7A2N5
URIm2://004JW7A2N5
Aliasessquarefree
Kinddefinition
WritingW1 stated
MSC11A51
DefinesSquare-free integer
UsesPrime number, Divisibility

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by