Deep Dive into GCD

Правка en1, от Rishav_raj_, 2023-10-17 09:06:08

GCD

  • Gcd of two natural number a and b is defined as the largest number which is a divisor of both  a and b.
  • Mathematically it is defined as: GCD(a, b)= max{k>0: (k|a) and (k|b)}.
Теги gcd, maths

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский Rishav_raj_ 2023-10-17 16:08:10 229 Tiny change: '  \n$O(1)$ , are a lo' -> '  \n$O(1)$, are a lo'
en3 Английский Rishav_raj_ 2023-10-17 10:17:16 4 Tiny change: 'GCD\n=====' -> 'GCDGCD\n=====' (published)
en2 Английский Rishav_raj_ 2023-10-17 10:15:19 2781 Tiny change: 'k/a means k divides \' -> 'k/a means $k$ divides \'
en1 Английский Rishav_raj_ 2023-10-17 09:06:08 228 Initial revision (saved to drafts)