Artículo: AMZ-B0CRVL1J8V

Modulo Operation, Linear Combination and GCD (Proofs in Number Theory)

Format:

Paperback

Kindle

Paperback

Detalles del producto
Disponibilidad
En stock
Peso con empaque
0.31 kg
Devolución
Condición
Nuevo
Producto de
Amazon
Viaja desde
USA

Sobre este producto
  • Learn the modulo operation, modular multiplication and the binary exponentiation algorithm with lots of examples. This book explains the concept of greatest common divisor (gcd) and describes, with examples, how to find the gcd using the Euclidean algorithm. It also proves that gcd distributes over lcm and lcm distributes over gcd. The topics treated include the following:Modulo operationBinary exponentiation algorithmLinear combinationEuclidean algorithmDivision relationGCD operationRelatively prime integersBezout's lemmaGCD distributes over LCMLCM distributes over GCD
$24,62
49% OFF
$12,62

IMPORT EASILY

By purchasing this product you can deduct VAT with your RUT number

$24,62
49% OFF
$12,62

3 meses de gracia en diferidos y hasta 6 meses sin intereses con Pacificard

Envío gratis
Llega en 5 a 12 días hábiles
Con envío
Tienes garantia de entrega
Este producto viaja de USA a tus manos en