Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

From the Wolfram MathWorld page on squarefree numbers,

"There is no known polynomial time algorithm for recognizing squarefree integers or for computing the squarefree part of an integer."

Wolfram MathWorld says that

"This problem is an important unsolved problem in number theory because computing the ring of integers of an algebraic number field is reducible to computing the squarefree part of an integer."

Would there be any other applications for an algorithm that recognizes squarefree integers?

share|improve this question

Your Answer

 
discard

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

Browse other questions tagged or ask your own question.