Search⌘ K
AI Features

Solution: Nth Magical Number

Explore the problem of finding the nth magical number divisible by either of two integers. Learn how to apply inclusion-exclusion principles and binary search to solve it efficiently. Understand the use of least common multiple and modular arithmetic to handle large results. This lesson helps you grasp a common coding interview pattern in math and geometry.

Statement

Given three integers n, a, and b, return the nth magical number.

A magical number is defined as a positive integer that is divisible by either a or b.

As the result may be very large, return it modulo 109+710^9+7.

Constraints:

  • 11 \leq n 109\leq 10^9

  • 22 \leq a, b 4×104\leq 4 \times 10^4 ...