{"id":15923,"date":"2014-08-19T19:09:49","date_gmt":"2014-08-19T19:09:49","guid":{"rendered":"http:\/\/www.beautifulwork.org\/?p=15923"},"modified":"2014-08-19T19:09:49","modified_gmt":"2014-08-19T19:09:49","slug":"hacking-with-an-algorithm-to-find-prime-factor-of-a-number","status":"publish","type":"post","link":"https:\/\/www.trueangle.org\/index.php\/2014\/08\/19\/hacking-with-an-algorithm-to-find-prime-factor-of-a-number\/","title":{"rendered":"Hacking with an algorithm to find prime factor of a number"},"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] \nFinding if a number is an Armstrong number or not[8] \nFinding if a given number is prime number[9]  \nFinding the number of twin prime numbers[10] \nFinding if a number is palindrome or not[11] \nFinding prime factor of a number[12] \n12\nEnter a number: 36\n\n 2 is a prime factor \n\n 3 is a prime factor \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] \nFinding if a number is an Armstrong number or not[8] \nFinding if a given number is prime number[9]  \nFinding the number of twin prime numbers[10] \nFinding if a number is palindrome or not[11] \nFinding prime factor of a number[12] \n12\nEnter a number: 76\n\n 2 is a prime factor \n\n 19 is a prime factor \n$bc\nbc 1.06.95\nCopyright 1991-1994, 1997, 1998, 2000, 2004, 2006 Free Software Foundation, Inc.\nThis is free software with ABSOLUTELY NO WARRANTY.\nFor details type `warranty'. \n76\/19\n4\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] Finding if a number is an Armstrong number or not[8] Finding if a given number is prime number[9] Finding the number of twin &hellip; <\/p>\n<p class=\"link-more\"><a href=\"https:\/\/www.trueangle.org\/index.php\/2014\/08\/19\/hacking-with-an-algorithm-to-find-prime-factor-of-a-number\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;Hacking with an algorithm to find prime factor of a number&#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":[386,1290],"_links":{"self":[{"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/posts\/15923"}],"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=15923"}],"version-history":[{"count":0,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/posts\/15923\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/media?parent=15923"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/categories?post=15923"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.trueangle.org\/index.php\/wp-json\/wp\/v2\/tags?post=15923"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}