MATH
Login Or Sign up

List Question

15
52
Views

Quickly determining if a continued fraction expansion ends in 2?

Published on
#elementary-number-theory #continued-fractions #euclidean-algorithm
190
Views

Why does Euclid's HCF algorithm work?

Published on
#euclidean-algorithm
356
Views

Proof of Euclidean division algorithm for the ring of Gaussian integers

Published on
#abstract-algebra #ring-theory #euclidean-algorithm #gaussian-integers
146
Views

About a subset of $\mathbb Q[x]$ of polynomials $f$ such that $f(n)=f(-n)$ for every $n$ in $\mathbb N$

Published on
#abstract-algebra #polynomials #ring-theory #euclidean-algorithm #euclidean-domain
135
Views

Algorithmic Euclidean domains.

Published on
#ring-theory #algorithms #euclidean-algorithm #euclidean-domain
190
Views

How do I prove $\gcd(4x^2 + 1, 2x + 1) = 1$?

Published on
#discrete-mathematics #polynomials #gcd-and-lcm #euclidean-algorithm
244
Views

Prove consecutive Fibonacci numbers are coprime

Published on
#discrete-mathematics #modular-arithmetic #gcd-and-lcm #euclidean-algorithm
757
Views

Showing in a simple way that the GCD of two polynomials is $1$.

Published on
#abstract-algebra #polynomials #euclidean-algorithm
336
Views

How do I know how many iterations an arbitrary extended gcd algorithm would take?

Published on
#discrete-mathematics #gcd-and-lcm #cryptography #euclidean-algorithm
349
Views

Recursive Calls in Euclidean Algorithm

Published on
#discrete-mathematics #modular-arithmetic #recursion #recursive-algorithms #euclidean-algorithm
301
Views

Euclidean algorithm for greatest integers x and y for common divisor (GCD)

Published on
#discrete-mathematics #euclidean-algorithm
60
Views

If $a^2|bc$, does $a|b$ or $a|c$

Published on
#elementary-number-theory #discrete-mathematics #proof-writing #divisibility #euclidean-algorithm
645
Views

Solutions to a'th root of 1 mod p if gcd(a, p-1)=1

Published on
#number-theory #modular-arithmetic #euclidean-algorithm
318
Views

Compute $\gcd(13n+2,5n-1)$ by generalized Euclidean algorithm

Published on
#elementary-number-theory #gcd-and-lcm #euclidean-algorithm
659
Views

Proof and explanation that $\gcd(A, B) = \gcd(B, A \mod B)$

Published on
#modular-arithmetic #gcd-and-lcm #euclidean-algorithm

Trending Questions

Popular # Hahtags

second-order-logic numerical-methods puzzle logic probability number-theory winding-number real-analysis integration calculus complex-analysis sequences-and-series proof-writing set-theory functions homotopy-theory elementary-number-theory ordinary-differential-equations circles derivatives game-theory definite-integrals elementary-set-theory limits multivariable-calculus geometry algebraic-number-theory proof-verification partial-derivative algebra-precalculus

Popular Questions

Copyright © 2021 JogjaFile Inc.