>RunTimeFix
BookStudyPracticeInterviewsYouTubeCoursesAbout
Log inGet Started
Practice/Mathematics & Number Theory
5 subtopics · 22 problems

Mathematics & Number Theory

Divisibility, primes, GCD/LCM, modular arithmetic, sieve techniques, and Euler's totient.

01Basic Math & Parity

Arithmetic operations, parity reasoning, and divisibility rules.

3 easy2 medium
ProblemDifficultyLink
4AWatermeloneasySolve
231ATeameasySolve
1873BGood KideasySolve
1900BLaura and OperationsmediumSolve
1294CProduct of Three NumbersmediumSolve

02GCD & LCM

Greatest common divisor and least common multiple applications.

1 easy1 medium2 hard
ProblemDifficultyLink
1850BTen Words of WisdomeasySolve
1881DDivide and EqualizemediumSolve
1900DSmall GCDhardSolve
1033CPermutation GamehardSolve

03Primes & Sieve of Eratosthenes

Primality testing, prime factorization, and sieve applications.

2 easy1 medium2 hard
ProblemDifficultyLink
230BT-primeseasySolve
1851CTiles ComebackeasySolve
576AVasya and Petya's GamemediumSolve
1154GMinimum Possible LCMhardSolve
735DTaxeshardSolve

04Modular Arithmetic & Binary Exponentiation

Computing under modulo, fast exponentiation, modular inverse.

1 easy2 medium2 hard
ProblemDifficultyLink
913AModular ExponentiationeasySolve
1904CArray GamemediumSolve
630IParking LotmediumSolve
1234CPipeshardSolve
1837EPlayoff FixinghardSolve

05Euler's Totient Function

Count integers coprime to n; applications in modular inverse and order.

2 medium1 hard
ProblemDifficultyLink
431Ck-TreemediumSolve
776BSherlock and His GirlfriendmediumSolve
1295DSame GCDshardSolve
All TopicsStudy the Theory
Was this helpful?
>RunTimeFix

Practical programming education. Books, videos, courses, and hands-on learning for competitive programming, DSA, and software engineering.

RunTimeFix

  • About
  • YouTube
  • Book
  • Study Library
  • Courses

Learn

  • Competitive Programming
  • DSA
  • Development
  • Databases

Legal

  • Privacy
  • Terms
  • Refund Policy

RunTimeFix — debug → solve → run

© 2026 RunTimeFix. All rights reserved.