I've come up with a method to tell if a number of arbitrary size is a perfect square and was curious..
1) Is there a practical benefit for knowing IF an integer is a perfect square?
2) What is the expected time frame for an integer, N, based on current known methods?
I would love to test this with a list of mixed perfect and non perfect squares for speed and accuracy. This method is instant for any N, so far with a size of 47000+ digits and has nothing to do with digital roots. I think I can extend this to other figurate series such as triangle numbers, and to the Fibonacci numbers.