EasyNo. 1952
Three Divisors — LeetCode 1952 Python Solution
- Pattern
- Math and Number Theory
- Topics
- Math, Enumeration, Number Theory
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Given an integer n, return true if n has exactly three positive divisors. Otherwise, return false.
Example
- Input
- n = 2
- Output
- false
Python solution
class Solution:
def isThree(self, n: int) -> bool:
return sum(n % i == 0 for i in range(2, n)) == 1Complexity
- Time
- O(n) or O(1)
- Space · auxiliary
- O(1)
Pattern: Math and Number Theory
Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 1952. Three Divisors is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math and Number Theory.
The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.
Related problems
| No. | Problem | Difficulty |
|---|---|---|
| 0204 | Count Primes | Medium |
| 2427 | Number of Common Factors | Easy |
| 2761 | Prime Pairs With Target Sum | Medium |
| 0258 | Add Digits | Easy |
| 0479 | Largest Palindrome Product | Hard |
| 0829 | Consecutive Numbers Sum | Hard |
Frequently asked questions
- How hard is LeetCode 1952. Three Divisors?
LeetCode 1952. Three Divisors is rated Easy on LeetCode.
- What topics does LeetCode 1952. Three Divisors cover?
LeetCode 1952. Three Divisors is tagged Math, Enumeration and Number Theory on LeetCode.