give an algorithm to find if a given integer is of the form m^n where m >1 and n >1
One Approach I can think of is to find prime factors and verify if they are of the form m^n -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
