Scribd Logo
Upload

Welcome to Scribd!

  • Important Math Topics For Competitive Programming

    Uploaded by

    Niharika Singh
    24 views7 pages
    This document outlines important math topics for competitive programming, including modular arithmetic, bitwise operators, primes and factors, binary exponentiation, the Euclidean algorithm, and Euler's totient function. Some key areas covered are properties of the modulo and bitwise operators, prime factorization, modular exponentiation, calculating the greatest common divisor and modular inverses, and using Euler's theorem to find modular inverses.

    Original Description:

    Competitive Programming Help

    Original Title

    Important Math Topics for Competitive Programming

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines important math topics for competitive programming, including modular arithmetic, bitwise operators, primes and factors, binary exponentiation, the Euclidean algorithm, and Euler's totient function. Some key areas covered are properties of the modulo and bitwise operators, prime factorization, modular exponentiation, calculating the greatest common divisor and modular inverses, and using Euler's theorem to find modular inverses.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    24 views7 pages

    Important Math Topics For Competitive Programming

    Uploaded by

    Niharika Singh
    This document outlines important math topics for competitive programming, including modular arithmetic, bitwise operators, primes and factors, binary exponentiation, the Euclidean algorithm, and Euler's totient function. Some key areas covered are properties of the modulo and bitwise operators, prime factorization, modular exponentiation, calculating the greatest common divisor and modular inverses, and using Euler's theorem to find modular inverses.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    IMPORTANT

    MATH TOPICS
    FOR

    COMPETITIVE
    PROGRAMMING
    1. MODULAR ARITHMETIC

    Properties of the modulo


    operator
    Integer overflow
    What does "modulo by
    1e9+7" in a problem
    indicate?
    2. BITWISE OPERATORS

    Properties of AND, OR,


    XOR, NOT operators
    Bitmasks and Bitsets
    Common ways to use
    bitwise operators to
    optimize code
    3. PRIMES, FACTORS, ETC

    Factorization + Prime
    Factorization
    Number/Sum of Divisors
    Primality testing
    Sieve of Eratosthenes
    Smallest Prime Factor
    4. BINARY EXPONENTIATION

    Calculates power of a
    number
    Modular exponentiation
    Matrix exponentiation
    (only basics)
    5. EUCLIDEAN ALGORITHM

    Calculates GCD of 2
    numbers
    Extended Euclidean
    Algorithm
    General Modular Inverse
    Linear Diophantine
    Equations
    6. EULER'S TOTIENT FUNCTION

    Count number of
    coprime numbers to N
    Euler's Theorem
    Fermat's Theorem
    Modular Inverse wrt a
    Prime

    You might also like