We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
You should find all x,y that verify the given equation and give the number of the solution just note that (x,y) and (y,x) are considered one solution.
Start first by finding the writing of X and Y using arithmetics
As per Algo description, n=1260 than we will have 113 distinct solution, what are those value of solution and what are x and y value which cover 113 possiblity. need small example if possible
these are some example for n=8
we should find all x,y that verify x*y/(x+y)=8
And we get (9,8*9)
(2*6,4*6)
(4*6,2*6)
(8*9,9 )
(2*5,8*5)
(4*4,4*4)
(8*5,2*5)
(4*3,8*3)
(8*3,4*3)
(8*2,8*2)
By removing none distinct
We get
(9,8*9)
(2*6,4*6)
(2*5,8*5)
(4*4,4*4)
try to find x,y using arithmetic
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Project Euler #110: Diophantine reciprocals II
You are viewing a single comment's thread. Return to all comments →
You should find all x,y that verify the given equation and give the number of the solution just note that (x,y) and (y,x) are considered one solution. Start first by finding the writing of X and Y using arithmetics
As per Algo description, n=1260 than we will have 113 distinct solution, what are those value of solution and what are x and y value which cover 113 possiblity. need small example if possible
these are some example for n=8 we should find all x,y that verify x*y/(x+y)=8 And we get (9,8*9) (2*6,4*6) (4*6,2*6) (8*9,9 ) (2*5,8*5) (4*4,4*4) (8*5,2*5) (4*3,8*3) (8*3,4*3) (8*2,8*2) By removing none distinct We get (9,8*9) (2*6,4*6) (2*5,8*5) (4*4,4*4) try to find x,y using arithmetic