Code Golf Stack Exchange is a question and answer site for programming puzzle enthusiasts and code golfers. It only takes a minute to sign up.
Sign up to join this community
Given integers a and b in the format a√b (a on the square root of b), make a program that will reduce b and increase a until the radical statement is fully simplified.
Example
input
a = 1
b = 16
output
4 root 1
In this instance, 1√16 = 4√1
Bonus - 25 chars for the ability to simplify radicals other than square root using another variable, c.
f=lambda a,b:max((a*i,b/i/i)for i in range(1,b)if b%(i*i)==0)
g=lambda a,b,c:max((a*i,b/i**c)for i in range(1,b)if b%i**c==0)
f is 61, chars. g is 63 but gets a 25 char bonus.
** operator and getting rid of unnecessary parens: f=lambda a,b,c:max((a*i,b/i**c)for i in range(1,b)if b%i**c==0)
\$\endgroup\$