Talk:Square-free integer

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Stub	This article has been rated as Stub-class on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the project's priority scale.

Maybe this should really be Square-free integer? -- Walt Pohl 01:40, 2 Mar 2004 (UTC)

The separable polynomial page does use the term more generally.

Charles Matthews 08:17, 2 Mar 2004 (UTC)

There's now a square-free polynomial page, too. I've changed the separable polynomial page to link there instead of here.

Baccala@freesoft.org 06:28, 23 January 2006 (UTC)[reply]

We have a lot of equivalent characterizations already,

I know, but here's another:The number of divisors of a squarefree integer is a power of two.Rich 06:55, 1 November 2006 (UTC)[reply]

Loop quantum gravity section

That section does not make much sense. There is something crucial missing from the formulas, but I suspect that it masks a conceptual misapprehension. Is this saying more than "any integer $a$ can be uniquely represented as $a=n^{2}\zeta ,$ where $\zeta$ is square-free"? What is the mathematical statement there, and what is result of some experimental spetroscopy? Unless someone comes up with a really compelling reason, I would propose to remove (or at least move) this section from the article. Arcfrk 07:32, 10 March 2007 (UTC)[reply]