Top Maths and Number Theory Questions

Knowing number theory will enable you to solve various challenging problems and hold on to various additional challenges. Check out and solve many number theory questions to test your programming skills. Read the number theory questions and their detailed solution to improve your skills all in one place.

Sort by

Problem Title

EXP

Difficulty

Avg Time to solve

Attempted

N-th Term Of GP

195

40

Easy

15 mins

7.8k

Sum Of Even Numbers Till N

110

40

Easy

10 mins

16.1k

Form a Triangle

67

40

Easy

15 mins

4.8k

Modular Exponentiation

112

40

Easy

15 mins

18k

Make Groups

10

40

Easy

10 mins

0.2k

Greatest Common Divisor

18

40

Easy

15 mins

5.7k

Ninja And The LCM

13

40

Easy

15 mins

2.4k

Extended Euclidean Algorithm

7

80

Moderate

25 mins

0.1k

Split array and GCD

3

120

Hard

-

0.1k

Different Subsequences GCD

3

120

Hard

25 mins

0.3k

Linear Equation

6

80

Moderate

40 mins

0.1k

Nth Fibonacci Number

77

40

Easy

-

233k

Fibonacci Member

13

40

Easy

-

191.3k

Ninja And Fibonacci Numbers

5

40

Easy

15 mins

0.1k

N-th Fibonacci Number

300

80

Moderate

40 mins

35.9k

Find the N-th term

7

120

Hard

50 mins

0.4k

Fibonacci Sum

7

80

Moderate

15 mins

0.6k

Matrix Exponentiation

1

120

Hard

40 mins

0k

All Prime Numbers less than or equal to N

4

80

Moderate

10 mins

0.8k

Largest Prime Factor

5

40

Easy

15 mins

0.3k

Max GCD Pair

13

80

Moderate

35 mins

0.5k

Prime Factorisation

3

80

Moderate

50 mins

0.3k

Sum of Factors

9

80

Moderate

40 mins

0.3k

MegaPrime Numbers

18

40

Easy

15 mins

0.8k

Co-prime Twins

8

120

Hard

70 mins

0.1k

N-th Term Of GP

Easy

40

195 upvotes

Sum Of Even Numbers Till N

Easy

40

110 upvotes

Form a Triangle

Easy

40

67 upvotes

Modular Exponentiation

Easy

40

112 upvotes

Make Groups

Easy

40

10 upvotes

Greatest Common Divisor

Easy

40

18 upvotes

Ninja And The LCM

Easy

40

13 upvotes

Extended Euclidean Algorithm

Moderate

80

7 upvotes

Split array and GCD

Hard

120

3 upvotes

Different Subsequences GCD

Hard

120

3 upvotes

Linear Equation

Moderate

80

6 upvotes

Nth Fibonacci Number

Easy

40

77 upvotes

Fibonacci Member

Easy

40

13 upvotes

Ninja And Fibonacci Numbers

Easy

40

5 upvotes

N-th Fibonacci Number

Moderate

80

300 upvotes

Find the N-th term

Hard

120

7 upvotes

Fibonacci Sum

Moderate

80

7 upvotes

Matrix Exponentiation

Hard

120

1 upvote

All Prime Numbers less than or equal to N

Moderate

80

4 upvotes

Largest Prime Factor

Easy

40

5 upvotes

Max GCD Pair

Moderate

80

13 upvotes

Prime Factorisation

Moderate

80

3 upvotes

Sum of Factors

Moderate

80

9 upvotes

MegaPrime Numbers

Easy

40

18 upvotes

Co-prime Twins

Hard

120

8 upvotes

Page of 2