The WSQ12 asked me to do a program that calculatesthe gcm, which is the greatest common divisor, the largest number that both number had as divisor.<\/p>\n

It asked to use the algorithm of a greek guy named Euclidean, so I entered wikipedia, the best site for quick info, and the first thing I se is a bunch of symbols and letters, soooooooooo I quit<\/p>\n

<\/a><\/p>\n

Then I was like, f it, amagona do my own algorithm with tacos and tequila, so I took a piece pof paper and solved one problem, 63 and 49. Here is the pic:<\/p>\n

<\/p>\n

Sooo is like the x 63 module y 49, the reesidual is i 14, Then, x takes the value of y, and y the value of i, and then I repeat the process until the residual is cero<\/p>\n

so the code will be:<\/p>\n

i = x mod y<\/span><\/strong><\/p>\n

x = y<\/span><\/strong><\/p>\n

y = i<\/span><\/strong><\/p>\n

and repeat, and here it is:<\/p>\n

<\/a><\/p>\n

Well… at last, I see is kind of similar as the one of Euclidean, soooo, it was allright \ud83d\ude42<\/span><\/p>\n

As always<\/p>\n

Github link<\/a><\/span><\/p>\n

<\/p>\n

<\/a> <\/p>\n","protected":false},"excerpt":{"rendered":"

The WSQ12 asked me to do a program that calculatesthe gcm, which is the greatest common divisor, the largest number that both number had as divisor. It asked to use the algorithm of a greek guy named Euclidean, so I entered wikipedia, the best site … Continúa leyendo WSQ12: GCD, Easy when done<\/span><\/a><\/p>\n","protected":false},"author":191,"featured_media":24118,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[4,3],"tags":[45,356,39],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/posts\/24122"}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/users\/191"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/comments?post=24122"}],"version-history":[{"count":1,"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/posts\/24122\/revisions"}],"predecessor-version":[{"id":24123,"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/posts\/24122\/revisions\/24123"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/media\/24118"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/media?parent=24122"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/categories?post=24122"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2015\/wp-json\/wp\/v2\/tags?post=24122"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}