Topics
Find Prime Numbers From 1 To N (Code)
Sieve Of Eratosthenes(Explain)
Sieve Of Eratosthenes(Code)
Sieve Of Eratosthenes(Complexity)
GCD(Euclid Algorithm)
Time Complexity Of Euclid Algo
GCD(Code)
Diophantine Equations
Extended Euclid Algorithm
Extended Euclid Algorithm Code
Multiplicative Modulo Inverse
Multiplicative Modulo Inverse(Code)
Questions related to Number Theory - 1
Numbers greater than 3000

Difficulty: EASY

Find count of greater numbers

Difficulty: EASY

Number of handhsakes

Difficulty: EASY

Number of Numbers

Difficulty: EASY

Next Palindrome

Difficulty: EASY

Avg time to solve: 45 mins

Amazon | Microsoft

Number with maximum probability

Difficulty: EASY

View More Questions

Have any doubts or queries regarding Number Theory - 1 in Competitive Programming Course?

If you have any questions regarding Number Theory - 1 in Competitive Programming Course we encourage you to sign up for a free trial of the course and solve your doubts. Our Teaching assistants typically respond within 20 minutes
Coding Ninjas Logo

CODING NINJAS

About Us

Bug Bounty

Customers

Press Release

PRODUCTS

Courses

Try courses for Free

Hire Talent

COMMUNITY

CodeStudio

Blog

Events

Affiliate

CONTACT US

Coding Ninjas Contact Emailcontact@codingninjas.com

Important Links

Coding Courses for Beginners:

C++ Foundation with Data Structures | JAVA Foundation with Data Structures | Interview Preparation Course | Competitive Programming Course | Python Foundation with Data Structures | Aptitude Preparation Course

Advanced Coding Course:

Advanced Front-End Web Development with React | Machine Learning and Deep Learning Course | Full Stack Web Development Course | Data Science & Machine Learning Complete | Android Development with Kotlin

Career Tracks:

Ninja Competitive Programmer Track | Ninja Android Developer Career Track | Ninja Web Developer Career Track - NodeJS & ReactJs | Ninja Web Developer Career Track - NodeJS | Ninja Data Scientist Career Track | Ninja Machine Learning Engineer Career Track

Free Trial:

C++ Foundation with Data Structures | Java Foundation with Data Structures | Competitive Course | Aptitude Preparation Course | Python Foundation with Data Structures | Android Development with Kotlin Language | Full Stack Web Development with NodeJS | Advanced Front-End Web Development with React | Data Science & Machine Learning Complete | Interview Preparation Course | Machine Learning Course

Relevant Topics:

Intro To Competitive Programming | Basics Of Recursion | Time and Space Complexity Analysis | Language Tools | Searching & Sorting Applications | Advanced Recursion | Backtracking | Bit Manipulation | Adhoc Problems | Modulo Arithmetic | Greedy Problems | Segment Tree | Graphs 1 | Graphs-2 | Advanced Graphs | String Algorithms | Tries | Fenwick Tree | DP & Bitmasking | Number Theory - 1 | Applications Of NT - 1 | Number Theory - 2 | Number Theory - 3 | Game Theory

We accept payments using:

VisaPaypalUPINo-cost-emi
secure
encryptRazorpay