{"id":5422,"date":"2022-01-28T23:00:00","date_gmt":"2022-01-28T17:30:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=5422"},"modified":"2022-01-28T18:29:17","modified_gmt":"2022-01-28T12:59:17","slug":"c-program-to-find-neon-number","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/c-program-to-find-neon-number\/","title":{"rendered":"C Program to Find Neon Number"},"content":{"rendered":"\n<p>In this post, we will learn<strong> how to find neon numbers using the C<\/strong> Programming language. But before that, let\u2019s learn about neon numbers.<\/p>\n\n\n\n<p>A number is said to be a <strong>neon number<\/strong> if the sum of the digits of the square of the number is equal to the same number. For example, <strong>9<\/strong> is a neon number because <strong>9 * 9 = 81 <\/strong>and the sum of <strong>81<\/strong> is <strong>8 + 1 = 9<\/strong> which is equal to the original number.<\/p>\n\n\n\n<p>We will use following approaches to find neon number:<\/p>\n\n\n\n<ol><li>Using For Loop<\/li><li>Using While Loop<\/li><\/ol>\n\n\n\n<p>So, without further ado, let\u2019s begin this tutorial.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662cd08baed70\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662cd08baed70\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/c-program-to-find-neon-number\/#C_Program_to_Find_Neon_Number_Using_For_Loop\" title=\"C Program to Find Neon Number Using For Loop\">C Program to Find Neon Number Using For Loop<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/c-program-to-find-neon-number\/#How_Does_This_Program_Work\" title=\"How Does This Program Work ?\">How Does This Program Work ?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/c-program-to-find-neon-number\/#C_Program_to_Find_Neon_Number_Using_While_Loop\" title=\"C Program to Find Neon Number Using While Loop\">C Program to Find Neon Number Using While Loop<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/c-program-to-find-neon-number\/#Conclusion\" title=\"Conclusion\">Conclusion<\/a><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\" id=\"c-program-to-find-neon-number-using-for-loop\"><span class=\"ez-toc-section\" id=\"C_Program_to_Find_Neon_Number_Using_For_Loop\"><\/span><strong>C Program to Find Neon Number Using For Loop<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/\/ C Program to Find Neon Number Using For Loop\n#include &lt;stdio.h>\n#include &lt;math.h>\n\nint main(){\n    int num, sqr, rem, sum;\n    \n    \/\/ Asking for input\n    printf(\"Enter a number: \");\n    scanf(\"%d\", &amp;num);\n    \n    \/\/ Finding the square root\n    sqr = pow(num, 2);\n    \n    \/\/ Finding the sum\n    for (sum = 0; sqr > 0; sqr \/= 10){\n        rem = sqr % 10;\n        sum = sum + rem;\n    }\n    \n    \/\/ Checking whether sum is equals to original number\n    if (sum == num){\n        printf(\"%d is a neon number.\", num);\n    }\n    else{\n        printf(\"%d is not a neon number.\", num);\n    }\n    return 0;\n}\n<\/pre>\n\n\n\n<p><strong>Output\u00a0<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter a number: 9\r\n9 is a neon number.\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"how-does-this-program-work\"><span class=\"ez-toc-section\" id=\"How_Does_This_Program_Work\"><\/span><strong>How Does This Program Work ?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    int num, sqr, rem, sum;\n<\/pre>\n\n\n\n<p>In this program, we have declared four integer data type variables named<strong> num<\/strong>, <strong>sqr<\/strong>, <strong>rem<\/strong> and <strong>sum<\/strong>.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    \/\/ Asking for input\n    printf(\"Enter a number: \");\n    scanf(\"%d\", &amp;num);\n<\/pre>\n\n\n\n<p>Now, the user is asked to enter a number.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    \/\/ Finding the square root\n    sqr = pow(num, 2);\n<\/pre>\n\n\n\n<p>We find the square of the entered number using the<strong> pow()<\/strong> function.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    \/\/ Finding the sum\n    for (sum = 0; sqr > 0; sqr \/= 10){\n        rem = sqr % 10;\n        sum = sum + rem;\n    }\n<\/pre>\n\n\n\n<p>Now, we calculate the sum of the digits of the square number using for loop. Suppose, the entered number is <strong>9<\/strong>, then it\u2019s square will be<strong> 81<\/strong>. Therefore,\u00a0<\/p>\n\n\n\n<p><strong>1st For Loop Iteration: for (sum = 0;\u00a0 81 > 0; 81 \/= 10)<\/strong><br>rem = sqr % 10 = 81 % 10 = 1<br>sum = sum + rem = 0 + 1 = 1<\/p>\n\n\n\n<p><strong>2nd For Loop Iteration: for (sum = 1; 8 > 0; 8 \/= 10)<\/strong><br>rem = sqr % 10 = 8 % 10 = 8<br>sum = sum + rem = 1 + 8 = 9<\/p>\n\n\n\n<p>We get <strong>sum = 9<\/strong>.<\/p>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">    \/\/ Checking whether sum is equals to original number\n    if (sum == num){\n        printf(\"%d is a neon number.\", num);\n    }\n    else{\n        printf(\"%d is not a neon number.\", num);\n    }\n<\/pre>\n\n\n\n<p>After that, we check whether the sum is equal to the original number. If the condition is<strong> True<\/strong>, then the entered number is a neon number otherwise it\u2019s not a neon number.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"c-program-to-find-neon-number-using-while-loop\"><span class=\"ez-toc-section\" id=\"C_Program_to_Find_Neon_Number_Using_While_Loop\"><\/span><strong>C Program to Find Neon Number Using While Loop<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"c\" data-enlighter-theme=\"\" data-enlighter-highlight=\"\" data-enlighter-linenumbers=\"\" data-enlighter-lineoffset=\"\" data-enlighter-title=\"\" data-enlighter-group=\"\">\/\/ C program to Find Neon Number\n#include &lt;stdio.h>\nint main(){\n    int num, rem, sqr, sum = 0;\n    \n    \/\/ Asking for input\n    printf(\"Enter a number: \");\n    scanf(\"%d\", &amp;num);\n    \n    \/\/ Calculating square\n    sqr = num * num;\n    \n    while (sqr != 0){\n        rem = sqr % 10;\n        sum = sum + rem;\n        sqr = sqr \/ 10;\n    }\n    \n    \/\/ Checking for Neon Number\n    if (sum == num){\n        printf(\"%d is a neon number.\", num);\n    }\n    else{\n        printf(\"%d is not a neon number.\", num);\n    }\n    return 0;\n}\n<\/pre>\n\n\n\n<p><strong>Output 1<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter a number: 9\r\n9 is a neon number.\r<\/code><\/pre>\n\n\n\n<p><strong>Output 2<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Enter a number: 7\r\n7 is not a neon number.\r<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"conclusion\"><span class=\"ez-toc-section\" id=\"Conclusion\"><\/span><strong>Conclusion<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>I hope after going through this post, you understand<strong> how to find neon numbers using C <\/strong>Programming language.<\/p>\n\n\n\n<p>If you have any doubt regarding the program, then contact us in the comment section. We will be delighted to assist you.<\/p>\n\n\n\n<p><strong>Also Read:<\/strong><\/p>\n\n\n\n<ul><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-reverse-a-string\/\">C Program To Reverse a String<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-check-armstrong-number\/\">C Program To Check Armstrong Number<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-check-krishnamurthy-number\/\">C Program to Find Krishnamurthy Number<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-calculate-generic-root-of-a-number\/\">C Program to Calculate Generic Root of a Number<\/a><\/strong><\/li><li><strong><a href=\"https:\/\/www.codingbroz.com\/c-program-to-reverse-a-sentence-using-recursion\/\">C Program To Reverse a Sentence Using Recursion<\/a><\/strong><\/li><\/ul>\n","protected":false},"excerpt":{"rendered":"<p>In this post, we will learn how to find neon numbers using the C Programming language. But before that, let\u2019s learn about neon numbers.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[167,294],"tags":[222,553,206],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5422"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=5422"}],"version-history":[{"count":3,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5422\/revisions"}],"predecessor-version":[{"id":5426,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/5422\/revisions\/5426"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=5422"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=5422"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=5422"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}