Burton Number Theory

정수론 기출 통계 및 분석

accepted된 기출 문항들에 대해 여러 지표와 다차원 메타 통계를 분석하여 보여줍니다.

accepted 기출31
총 배점99
frontier section14
부분 연습 후보21
accepted 문제31
총 배점99
frontier section14
mixed-tool 문항26
부분 연습 후보21

Section별 문항 수

  • 2.4 2.4 The Euclidean Algorithm
    1문항
  • 2.5 2.5 The Diophantine Equation ax + by = c
    2문항
  • 4.2 4.2 Basic Properties of Congruence
    1문항
  • 4.4 4.4 Linear Congruences and the Chinese Remainder Theorem
    2문항
  • 5.2 5.2 Fermat’s Little Theorem and Pseudoprimes
    1문항
  • 5.3 5.3 Wilson’s Theorem
    1문항
  • 7.2 7.2 Euler’s Phi-Function
    1문항
  • 7.3 7.3 Euler’s Theorem
    3문항
  • 8.1 8.1 The Order of an Integer Modulo n
    3문항
  • 8.2 8.2 Primitive Roots for Primes
    7문항
  • 8.4 8.4 The Theory of Indices
    2문항
  • 9.2 9.2 The Legendre Symbol and Its Properties
    1문항
  • 9.3 9.3 Quadratic Reciprocity
    2문항
  • 9.4 9.4 Quadratic Congruences with Composite Moduli
    4문항

연도별 문항 수

  • 2003
    1문항
  • 2004
    1문항
  • 2005
    1문항
  • 2006
    1문항
  • 2007
    1문항
  • 2008
    1문항
  • 2009
    4문항
  • 2010
    2문항
  • 2011
    2문항
  • 2012
    2문항
  • 2013
    2문항
  • 2014
    1문항
  • 2015
    1문항
  • 2016
    1문항
  • 2017
    1문항
  • 2018
    1문항
  • 2019
    1문항
  • 2020
    1문항
  • 2021
    1문항
  • 2022
    1문항
  • 2023
    1문항
  • 2024
    1문항
  • 2025
    1문항
  • 2026
    1문항

필요 도구 빈도

  • linear_congruence_crt
    11회
  • primitive_roots_mod_prime
    9회
  • euler_phi_function
    8회
  • congruence_arithmetic_basic
    7회
  • multiplicative_order_mod_n
    6회
  • legendre_symbol_properties
    5회
  • quadratic_reciprocity
    5회
  • quadratic_congruence_composite_modulus
    4회
  • euclidean_algorithm_bezout
    3회
  • euler_theorem
    3회
  • gcd_divisibility_basics
    3회
  • index_discrete_log_basic
    3회
  • linear_diophantine_ax_by_c
    3회
  • fermat_little_theorem
    2회
  • wilson_theorem
    2회
  • euler_criterion_quadratic_residue
    1회
  • unique_prime_factorization
    1회

Section별 배점 합계

  • 2.4 2.4 The Euclidean Algorithm
    2점
  • 2.5 2.5 The Diophantine Equation ax + by = c
    6점
  • 4.2 4.2 Basic Properties of Congruence
    4점
  • 4.4 4.4 Linear Congruences and the Chinese Remainder Theorem
    9점
  • 5.2 5.2 Fermat’s Little Theorem and Pseudoprimes
    4점
  • 5.3 5.3 Wilson’s Theorem
    2점
  • 7.2 7.2 Euler’s Phi-Function
    2점
  • 7.3 7.3 Euler’s Theorem
    10점
  • 8.1 8.1 The Order of an Integer Modulo n
    6점
  • 8.2 8.2 Primitive Roots for Primes
    27점
  • 8.4 8.4 The Theory of Indices
    4점
  • 9.2 9.2 The Legendre Symbol and Its Properties
    4점
  • 9.3 9.3 Quadratic Reciprocity
    9점
  • 9.4 9.4 Quadratic Congruences with Composite Moduli
    10점

최근 학습 기록 (로그)