{"id":15915,"date":"2014-08-07T15:57:54","date_gmt":"2014-08-07T15:57:54","guid":{"rendered":"http:\/\/www.beautifulwork.org\/?p=15915"},"modified":"2014-08-07T15:57:54","modified_gmt":"2014-08-07T15:57:54","slug":"hacking-with-the-program-to-find-the-greatest-common-factor","status":"publish","type":"post","link":"https:\/\/www.trueangle.org\/index.php\/2014\/08\/07\/hacking-with-the-program-to-find-the-greatest-common-factor\/","title":{"rendered":"Hacking with the program to find the greatest common factor"},"content":{"rendered":"<pre>\n$.\/app \nSign detection [1] \nPower of two [2] \nCounting No. of bits set [3] \nSet or clear bits without branching[4] \nFind maximum value[5] \nFinding least common multiple[6] \nFinding the greatest commom divisor[7] \n7\nEnter the two values for finding GCD: 12 6\nGCD is: 6\n$.\/app \nSign detection [1] \nPower of two [2] \nCounting No. of bits set [3] \nSet or clear bits without branching[4] \nFind maximum value[5] \nFinding least common multiple[6] \nFinding the greatest commom divisor[7] \n7\nEnter the two values for finding GCD: 5 12\nGCD is: 1\n$.\/app \nSign detection [1] \nPower of two [2] \nCounting No. of bits set [3] \nSet or clear bits without branching[4] \nFind maximum value[5] \nFinding least common multiple[6] \nFinding the greatest commom divisor[7] \n7\nEnter the two values for finding GCD: 20 25\nGCD is: 5\n$.\/app \nSign detection [1] \nPower of two [2] \nCounting No. of bits set [3] \nSet or clear bits without branching[4] \nFind maximum value[5] \nFinding least common multiple[6] \nFinding the greatest commom divisor[7] \n7\nEnter the two values for finding GCD: 12 8\nGCD is: 4\n$.\/app \nSign detection [1] \nPower of two [2] \nCounting No. of bits set [3] \nSet or clear bits without branching[4] \nFind maximum value[5] \nFinding least common multiple[6] \nFinding the greatest commom divisor[7] \n7\nEnter the two values for finding GCD: 32 235\nGCD is: 1\n$\n\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>$.\/app Sign detection [1] Power of two [2] Counting No. of bits set [3] Set or clear bits without branching[4] Find maximum value[5] Finding least common multiple[6] Finding the greatest commom divisor[7] 7 Enter the two values for finding GCD: 12 6 GCD is: 6 $.\/app Sign detection [1] Power of two [2] Counting No. &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/www.trueangle.org\/index.php\/2014\/08\/07\/hacking-with-the-program-to-find-the-greatest-common-factor\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Hacking with the program to find the greatest common factor&#8221;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[141,78,91],"tags":[809],"_links":{"self":[{"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/posts\/15915"}],"collection":[{"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/comments?post=15915"}],"version-history":[{"count":0,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/posts\/15915\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/media?parent=15915"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/categories?post=15915"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/tags?post=15915"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}