Shamelessly copied from the Project Euler page for Problem 266: -------------
The divisors of 12 are: 1,2,3,4,6 and 12.
The largest divisor of 12 that does not exceed the square root of 12 is 3.
We shall call the largest divisor of an integer n that does not exceed the square root of n the pseudo square root (PSR) of n.
It can be seen that PSR(3102)=47.
-------------
Write a MATLAB script that will determine what the pseudo square root of a number is. Please note that if the number is a perfect square, the pseudo square root will equal the actual square root.
I try to avoid brute force solutions, but...
Today's Cody Tip of the Day: Make sure you paste your solution into the text box BEFORE you hit submit.
1853 Solvers
1810 Solvers
Construct a string from letters and counts
112 Solvers
We love vectorized solutions. Problem 1 : remove the row average.
337 Solvers
104 Solvers