Betrothed numbers (quasi-amicable numbers) are two positive integers - m,n - satisfying the following relation:
sum of dividers of m is n+1 AND sum of dividers of n is m+1
Examples are: (48, 75), (140, 195), (1050, 1925)
task: write a code that, given an upper limit, finds all betrothed numbers from 1 to limit and displays the couples
write code in any language you prefer :)
additional task (the easy part :D): display the couples' count in the given range!
again, thanks everybody for participating the challenge, very appreciated 😊 please give an upvote if you liked it, so (maybe) other users can see it and enjoy it too 😁 hope to see a lot of new answers with new codes!!!