Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8411427
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 10, 20262026-06-10T00:25:10+00:00 2026-06-10T00:25:10+00:00

From Significand entry in Wikipedia : When working in binary, the significand is characterized

  • 0

From Significand entry in Wikipedia :

When working in binary, the significand is characterized by its width
in binary digits (bits). Because the most significant bit is always 1
for a normalized number, this bit is not typically stored and is
called the “hidden bit”. Depending on the context, the hidden bit may
or may not be counted towards the width of the significand. For
example, the same IEEE 754 double precision format is commonly
described as having either a 53-bit significand, including the hidden
bit, or a 52-bit significand, not including the hidden bit. The notion
of a hidden bit only applies to binary representations. IEEE 754
defines the precision, p, to be the number of digits in the
significand, including any implicit leading bit (e.g. precision, p, of
double precision format is 53).

Why the most significant bit is always 1 for a normalized number ? Can some one please explain with an example ?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-10T00:25:12+00:00Added an answer on June 10, 2026 at 12:25 am

    This is not entirely true, there is no leading 1 for special values like 0, NaN, Infinity and denormal values.

    But yes, when it is a “sane” number then you can always rewrite it so that the mantissa starts with 1. Simply by incrementing the exponent. The equivalent exists in decimal as well, you can always write a number so that it starts with a single non-zero digit if the value is not zero:

      0.5 = 5.0 E-01
      0.05 = 5.0 E-02
      50 = 5.0 E+01
      500 = 5.0 E+02
      etcetera.
    

    With the distinction that this single digit will be 1 in binary. So it doesn’t have to be stored, in can be inferred. Which buys one extra bit of precision. Attractive enough to complicate the floating point processor logic to restore that 1 in calculations.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I want to extract the n most significant bits from an integer in C++
From MSDN Search the mask data from most significant bit (MSB) to least significant
I have the following code for getting the MSB (Most Significant Bit) from a
I want to find the most significant bit that is set to 1 .
I've read that javascript gets significant performance benefits from modifying off-dom. Earlier today, I
Is there significant cpu/memory overhead associated with using automatic arrays with g++/Intel on 64-bit
In my last question , nos gave a method of removing the most significant
The Google Voice Search comes with a significant delay from the moment you call
The Google Voice Search comes with a significant delay from the moment you call
I am working with a system that uses GUIDs as keys in most database

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.