PYTHON

Largest power dividing n. Implement the function largestPowerDividing(n), which given a positive integer n, finds and returns the largest power of an integer greater than 1 which divides n.

That is given n, largestPowerDividing(n) returns the largest i such that xⁱ divides n, for some integer x > 1. For instance:

largestPowerDividing(50) = 2 since 50 = 2x5², and

largestPowerDividing(362063535) = 6 since 362063535 = 3x5x17⁶.

Assume n is a positive integer

Test program	Output
print("b)")	b
print(largestPowerDividing(1))	0
print(largestPowerDividing(2))	1
print(largestPowerDividing(3))	1
print(largestPowerDividing(4))	2
print(largestPowerDividing(5))	1
print(largestPowerDividing(9))	2
print(largestPowerDividing(25))	2
print(largestPowerDividing(50))	2
print(largestPowerDividing(162)) #162 = 2*(3**4)	4
print(largestPowerDividing(362063531))	1
print(largestPowerDividing(362063535))	6