- Executors
-
Learn
Learn Python Runnable examples, NumPy, pandas, and more Learn AI / Machine LearningNeural networks, ML and LLMs from scratch Learn C & C++ Pointers, memory, STL, and modern C++ Learn C#C# basics, OOP, LINQ, async, and .NET exercises Learn MatplotlibLine, bar, scatter and pie charts with live visualizers Learn RustOwnership, traits, error handling, and threads Learn GoSlices, interfaces, goroutines, and channels Python Algorithms Search, sorting, recursion, and visualizers O(n) C & C++ Algorithms Compare algorithms implemented in C and C++ Coding for Kids Learn to code by playing!
- QuizzesNew
- ChallengesNew
- For TeachersNew
- Updates
- Buy me a coffee
Number theory coding challenges
Practise number theory with 41 coding challenges, from easy to hard. Every challenge runs in your browser with instant tests, an AI review of your code and community solutions to compare.
Easy · 12 Medium · 26 Hard · 3
Skills you'll practise: Sieve of EratosthenesBig number arithmeticPrimality testingModular arithmeticPrime factorizationSquare root boundCycle detectionDigit manipulationDivisor pairsMemoizationPair enumerationTrial division
- Python · C++ · C#
- Automated tests
- AI code review
- Community solutions
- 341
- Challenges
- 245
- Solutions shared
- 9
- Languages
All challenges
Search by name or topic, or filter by difficulty.
Hard
Non-Abundant Sums
Add up the numbers up to a limit that cannot be written as the sum of two abundant numbers.
You'll learn
Divisor sievePair enumeration
No solutions yet
Medium
Sum of Big Numbers
Add up a list of numbers too long for any built-in integer type.
You'll learn
Big number arithmeticString processing
No solutions yet
Medium
Pentagonal Pair
Count pairs of pentagonal numbers whose sum is pentagonal too.
You'll learn
Integer square rootsPair enumeration
No solutions yet
Easy
Sum of Proper Divisors
Add up every divisor of n that is smaller than n.
You'll learn
Divisor pairsSquare root bound
No solutions yet
Medium
Highly Divisible Triangular Number
Find the first triangular number that has at least d divisors.
You'll learn
Prime factorizationDivisor counting
No solutions yet
Browse by topic
- Beginner 154
- CS1 90
- Math 76
- Loops 58
- Intermediate 51
- High School 50
- Ai 47
- Numbers 46
- Machine Learning 42
- Number Theory 41
- Homework 40
- Intro Programming 40
- Strings 36
- Competitive Programming 35
- Arrays 31
- Conditions 25
- Nested Loops 25
- Project Euler Style 25
- Patterns 24
- Functions 21
- Advanced 20
- Simulation 19
- Dynamic Programming 18
- Neural Networks 17
- Grids 16
- Primes 14
- Parsing 13
- CS50 Style 10
- Sorting 9
- AP Computer Science 8
- Classes 8
- Design Patterns 8
- Graphs 8
- Matrices 8
- OOP 8
- Recursion 8
- Combinatorics 6
- Stacks 6
- Big Integers 5
- Bit Manipulation 5
- Finance 5
- Greedy 5
- Sequences 5
- Variables 5
- Algorithms 4
- Data Structures 4
- Dictionaries 4
- Geometry 4
- Image Processing 4
- Trees 4
- Binary Search 3
- Fractions 3
- Games 3
- Reinforcement Learning 3
- Shortest Path 3
- Sliding Window 3
- Voting 3