Homepage

divisor vulnerabilities

Calculates divisors/factors of natural numbers and gcd/lcm using euclid's algorithm.

< Back for full overview of divisor vulnerabilities

Package versions

13 VERSIONS IN TOTAL
versionpublisheddirect vulnerabilities
1.0.1127 Aug, 2024
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.0.1029 Dec, 2023
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.0.528 Dec, 2023
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.0.428 Dec, 2023
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.0.315 Sep, 2023
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.0.21 May, 2023
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.0.19 Dec, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
1.0.027 Nov, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.9.022 Nov, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.5.022 Nov, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.0.422 Nov, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.0.322 Nov, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L
0.0.221 Nov, 2020
  • 0
    C
  • 0
    H
  • 0
    M
  • 0
    L

Automatically find and fix vulnerabilities affecting your projects. Snyk scans for vulnerabilities and provides fixes for free.

Get started free