Friendly pair
Detailed guide and Python implementation for the 'Friendly pair' problem.
1. Concept Overview
The 'Friendly pair' problem is a key challenge in the Basics section.
This implementation focuses on easy-level logic in Python.
We prioritize technical accuracy and code readability in our provided solutions.
2. Real-World Applications
3. Visual Intuition
Visualizing the logic flow for Friendly pair.
4. Prerequisites
5. Step-by-Step Thinking
1. Understand the problem
Read the problem statement for Friendly pair carefully.
2. Formulate brute force
Draft a simple iterative solution.
3. Identify inefficiency
Look for redundant calculations.
4. Optimize search path
Use hashing or sorting to speed up the process.
5. Final Implementation
Clean up the code for production standards.
Problem Statement
Write a function is_friendly_pair(a, b) that takes two positive integers a and b and returns True if they form a friendly pair, or False otherwise. Two numbers form a friendly pair if they have the same abundancy index. The abundancy index of a number n is defined as sigma(n) / n, where sigma(n) is the sum of all divisors of n (including n itself). Two numbers are friendly if sigma(a) / a == sigma(b) / b. To avoid floating-point issues, compare by cross-multiplying: sigma(a) * b == sigma(b) * a.
- •1 <= a, b <= 10^5
Examples
a = 6, b = 28
True
sigma(6) = 1+2+3+6 = 12. sigma(28) = 1+2+4+7+14+28 = 56. Cross check: 12 * 28 = 336, 56 * 6 = 336. They are equal, so they are a friendly pair.
a = 30, b = 140
True
sigma(30) = 72, sigma(140) = 336. Cross check: 72 * 140 = 10080, 336 * 30 = 10080. Equal, so friendly pair.
a = 5, b = 10
False
sigma(5) = 6, sigma(10) = 18. Cross check: 6 * 10 = 60, 18 * 5 = 90. Not equal, so not a friendly pair.
Need a Hint?
Edge Cases to Watch
- Empty input structures
- Single element inputs
- Large numerical bounds
Ready to Solve?
Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.
Interview Insights & Variations
Complexity Analysis Breakdown
Why Time: Directly evaluates all possibilities.
Why Space: Uses standard local memory.
Why Time: Optimized paths reduce total operations.
Why Space: May trade memory for speed.
Optimized Solution Python Code
Optimized Solution Python Code
def are_friendly_pair_opt(n1: int, n2: int) -> bool:
def sum_divisors(n):
total = 1 + n
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
total += i
if i * i != n:
total += n // i
return total
return sum_divisors(n1) * n2 == sum_divisors(n2) * n1Brute Force Code (Spoiler Guarded)
Brute Force Code (Spoiler Guarded)
def are_friendly_pair_brute(n1: int, n2: int) -> bool:
def sum_divisors(n):
total = 0
for i in range(1, n + 1):
if n % i == 0:
total += i
return total
return sum_divisors(n1) / n1 == sum_divisors(n2) / n2Algorithm Pattern Checklist
When dealing with Basics data patterns.
Core Prerequisites
Revision Key Notes
Common Mistakes & Pitfalls
Related Questions
Recommended Python Resources
Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.
Python Loops
Learn how to use Python loops to iterate over data. Master for loops, while loops, break, continue, and loop best practices with interactive examples.
How to Sort a List in Python
Learn how to sort a list in Python using the sort() method and the sorted() function. Discover custom key sorting and reverse order examples.
Python String Methods
A complete reference guide for Python string manipulation. Master formatting, searching, splitting, replacing, and checking string properties.
Python vs JavaScript: Which Programming Language is Best?
A comprehensive comparison between Python and JavaScript. Explore syntax differences, performance, use cases (backend vs frontend), and coding examples.