{"id":35010,"date":"2016-04-05T10:29:58","date_gmt":"2016-04-05T15:29:58","guid":{"rendered":"http:\/\/alibarramg.wordpress.com\/?p=234"},"modified":"2016-04-05T10:47:05","modified_gmt":"2016-04-05T15:47:05","slug":"quiz-06-4","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/quiz-06-4\/","title":{"rendered":"Quiz 06"},"content":{"rendered":"<p>IS QUIZ TIME!!!<\/p>\n<p><img decoding=\"async\" class=\"alignnone size-full wp-image-244\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/0f33b78c7f00339910126daeb987ae70.jpg\" alt=\"images\"   \/><\/p>\n<p>Hi guys, this is the las quiz of the parcial, it is not that hard, so lets do it!<\/p>\n<p>This time is about finding the\u00a0 greatest common denominator of two possitive integers, here is the information you should know before starting the quiz<\/p>\n<p><a href=\"https:\/\/www.khanacademy.org\/computing\/computer-science\/cryptography\/modarithmetic\/a\/the-euclidean-algorithm\" rel=\"nofollow\">https:\/\/www.khanacademy.org\/computing\/computer-science\/cryptography\/modarithmetic\/a\/the-euclidean-algorithm<\/a><\/p>\n<p>Right there is the euclidean algorithm wich is the one we are using to find that integer.<\/p>\n<p><a href=\"https:\/\/gist.github.com\/alonzoibarra97\/e1e9c92517741294d582fafffea27862\">CODEEEEEEEEEE<\/a><\/p>\n<p>  <a rel=\"nofollow\" href=\"http:\/\/feeds.wordpress.com\/1.0\/gocomments\/alibarramg.wordpress.com\/234\/\"><img decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/259adf3f7061daa058f02be6933fe378.jpg\" \/><\/a> <img loading=\"lazy\" decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/9a62ee9c5849aa0ae238f163c289e750.jpg#038;blog=105353638&#038;%23038;post=234&#038;%23038;subd=alibarramg&#038;%23038;ref=&#038;%23038;feed=1\" width=\"1\" height=\"1\" \/><\/p>\n","protected":false},"excerpt":{"rendered":"<p>IS QUIZ TIME!!! Hi guys, this is the las quiz of the parcial, it is not that hard, so lets do it! This time is about finding the\u00a0 greatest common denominator of two possitive integers, here is the information you should know before starting the quiz https:\/\/www.khanacademy.org\/computing\/computer-science\/cryptography\/modarithmetic\/a\/the-euclidean-algorithm Right there is the euclidean algorithm wich is &hellip; <a href=\"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/quiz-06-4\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Quiz 06<\/span><\/a><\/p>\n","protected":false},"author":37,"featured_media":35013,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[45],"class_list":["post-35010","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-sin-categoria"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35010","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/users\/37"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/comments?post=35010"}],"version-history":[{"count":2,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35010\/revisions"}],"predecessor-version":[{"id":35018,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35010\/revisions\/35018"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media\/35013"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media?parent=35010"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/categories?post=35010"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/tags?post=35010"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}