<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Rajanit Nagajibhai Navapara</title>
    <description>The latest articles on DEV Community by Rajanit Nagajibhai Navapara (@rajanitnavapara).</description>
    <link>https://dev.to/rajanitnavapara</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F527811%2Ff72532ff-5cb3-4eef-96e5-2fc5a7d7f5bc.gif</url>
      <title>DEV Community: Rajanit Nagajibhai Navapara</title>
      <link>https://dev.to/rajanitnavapara</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/rajanitnavapara"/>
    <language>en</language>
    <item>
      <title>2 Step TRICK to Count Digits in Numeral  🚀</title>
      <dc:creator>Rajanit Nagajibhai Navapara</dc:creator>
      <pubDate>Thu, 11 Feb 2021 14:53:56 +0000</pubDate>
      <link>https://dev.to/rajanitnavapara/2-step-trick-to-count-digits-in-numeral-2l8g</link>
      <guid>https://dev.to/rajanitnavapara/2-step-trick-to-count-digits-in-numeral-2l8g</guid>
      <description>&lt;p&gt;Is there you need to count the digits in a given numeral then it will take you some time. And even after you may be confused that "Have I counted it right or not?😕"&lt;br&gt;
So do not worry about that thing now. Here I am sharing a trick to do so.&lt;/p&gt;

&lt;p&gt;Follow the steps:&lt;/p&gt;

&lt;p&gt;1) First convert a number into decimal.&lt;br&gt;
      e.g. If you have given (100110)2 then first convert it into a decimal that is (38)10.&lt;/p&gt;

&lt;p&gt;2) Now use this easiest formula&lt;br&gt;
   count = floor(logm(n)) + 1 ; m = 2 if count digits of binary&lt;br&gt;
                      m = 10 if count digits of decimal and so on.&lt;br&gt;
                      n = number in decimal&lt;/p&gt;

&lt;p&gt;LET US UNDERSTAND MORE WITH AN EXAMPLE.&lt;br&gt;
Given number: (11010)2&lt;br&gt;
The given number is a binary number. n = 2&lt;br&gt;
So First, convert it into decimal m = (26)2&lt;/p&gt;

&lt;p&gt;count = floor(logm(n)) + 1   |&lt;br&gt;&lt;br&gt;
count = floor(log2(26)) + 1  |floor(log10(26)) + 1&lt;br&gt;
count = 4 + 1 = 5            |1 + 1 = 2 &lt;/p&gt;

&lt;p&gt;Digits counted in a binary number of 26 is 5. &lt;/p&gt;

&lt;p&gt;Hope You use it.😃&lt;/p&gt;

</description>
      <category>algorithms</category>
      <category>programming</category>
      <category>tutorial</category>
      <category>computerscience</category>
    </item>
  </channel>
</rss>
