How to convert an exponent to binary number?

AI Thread Summary
To convert an exponent like 23 to binary, it is essential to recognize that the process is about converting a number rather than specifically an exponent. The binary representation of 23 is 10111, derived by summing the powers of 2: 16, 4, 2, and 1. The division algorithm can be utilized, where repeated division by 2 yields remainders that form the binary digits when read in reverse. The discussion clarifies that the term "exponent" is misleading in this context, as the conversion applies to any number. Understanding this distinction is crucial for accurate binary conversion.
MathematicalPhysicist
Science Advisor
Gold Member
Messages
4,662
Reaction score
372
how to convert an exponent to binary number?
 
Last edited by a moderator:
Mathematics news on Phys.org
What you say does not make much sense -- you can convert any number into any base you want.

Please provide an example of what you're trying to do so that we can help you better.

- Warren
 
i read the next statement at this webpage:http://www.mersenne.org/math.htm
"Convert the exponent 23 to binary, you get 10111."
 
That's not an exponent, just a number in binary form. To convert we do the following

16 8 4 2 1
1 0 1 1 1

So, we have one 16, no 8, one 4, one 2, and one 1. We sum them to get 16+4+2+1=23. The division algorithm can be used to convert from decimal to binary.

23-16=7, so we put a 1 in the 16 column.
7-8<0, so we put a 0 in the 8 column.
7-4=3. so we put a 1 in the 4 column.
3-2=1, so we put a 1 in the 2 column.
2-1=1, so we put a 1 in the 1 column.

Thus, 23 in binary form is 10111.
 
The thing that was confusing was that you were asking about
"converting an exponent". You are really just asking about converting a number. The fact that the number happens to be an exponent in the formula is not important.

Another way to do the same thing is:

2 divides into 23 11 times with remainder 1
2 divides into 11 5 times with remainder 1
2 divides into 5 2 times with remainder 1
2 divides into 2 1 time with remainder 0
2 divides into 1 0 times with remainder 1

Now that we have reached "0 times" write the remainders in reverse order : 10111 base 2 is 23 base 10.
 
HallsofIvys methods works for conversion from base 10 to any base, simply divide by the base, the remainder gives the digits in the new base, starting with the least significant.
 
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Back
Top