@Kishore in below link no one deals with how to calculate or escape calculating factorial (n)
On Tue, Jun 26, 2012 at 12:28 PM, Kishore <[email protected]> wrote: > Go thru this > http://stackoverflow.com/questions/8650827/sample-testcase-for-interviewstreet-equationsyou > should be able to solve the question > > > On Tue, Jun 26, 2012 at 1:58 AM, prakash y <[email protected]> wrote: > >> @Vishal, >> If the output should be the total no.of pairs, then i think there are >> infinite no.of such pairs. but not sure. >> Can someone provide me the link to the actual problem and some analysis >> of solution? >> >> Thanks, >> ~Prakash. >> >> On Mon, Jun 25, 2012 at 9:45 PM, Kumar Vishal <[email protected]> wrote: >> >>> Sorry My Mistake *Number of pairs should be OUTPUT...* >>> >>> >>> On Mon, Jun 25, 2012 at 8:49 PM, prakash y <[email protected]>wrote: >>> >>>> 2! - x=y=4 >>>> 3! - x=y=12 >>>> 4! - x=y=48 >>>> 5! - x=y=240 >>>> 6! - x=y=1440 >>>> I don't have proof to prove x = y always. >>>> But if x=y, then the answer should be x=y=2*n! >>>> >>>> On Mon, Jun 25, 2012 at 5:04 PM, Roshan <[email protected]> wrote: >>>> >>>>> Few Months back I found the problem >>>>> on Code Sprint >>>>> 1/x + 1/y = 1/N! (N factorial). For large value of N >>>>> we have to find the par of (X,Y) which satisfy the equation >>>>> my sol was slow , >>>>> can any pleas help me . >>>>> >>>>> Thanks >>>>> Kumar Vishal >>>>> >>>>> -- >>>>> You received this message because you are subscribed to the Google >>>>> Groups "Algorithm Geeks" group. >>>>> To view this discussion on the web visit >>>>> https://groups.google.com/d/msg/algogeeks/-/PeqVSr7OlFsJ. >>>>> To post to this group, send email to [email protected]. >>>>> To unsubscribe from this group, send email to >>>>> [email protected]. >>>>> For more options, visit this group at >>>>> http://groups.google.com/group/algogeeks?hl=en. >>>>> >>>> >>>> -- >>>> You received this message because you are subscribed to the Google >>>> Groups "Algorithm Geeks" group. >>>> To post to this group, send email to [email protected]. >>>> To unsubscribe from this group, send email to >>>> [email protected]. >>>> For more options, visit this group at >>>> http://groups.google.com/group/algogeeks?hl=en. >>>> >>> >>> >>> >>> -- >>> Regards >>> Kumar Vishal >>> _________________________________________ >>> *http://wethecommonpeople.wordpress.com/ * >>> *h**ttp://kumartechnicalarticles.wordpress.com/<http://kumartechnicalarticles.wordpress.com/> >>> * >>> _________________________________________ >>> >>> >>> -- >>> You received this message because you are subscribed to the Google >>> Groups "Algorithm Geeks" group. >>> To post to this group, send email to [email protected]. >>> To unsubscribe from this group, send email to >>> [email protected]. >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Regards Kumar Vishal _________________________________________ *http://wethecommonpeople.wordpress.com/ * *h**ttp://kumartechnicalarticles.wordpress.com/<http://kumartechnicalarticles.wordpress.com/> * _________________________________________ -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
