maths.free › Number Theory › Number bases

Number bases

Converting between decimal, binary, octal and hexadecimal.

A base-b number is a sum of powers of b. To convert from decimal, divide by b repeatedly; the remainders, read from the last to the first, are the digits. Binary (base 2) and hexadecimal (base 16) are how computers store every number you see.

उदाहरण · 255 to binary

Number-Theory · Number-Bases

255 to binary

255,\ 2

चरणद्वारा चरण

  1. 255_{10} \to \text{base } 2

    Repeatedly divide by 2; the remainders, read bottom-up, are the digits.

  2. 255 = 127 \times 2 + 1

    remainder 1

  3. 127 = 63 \times 2 + 1

    remainder 1

  4. 63 = 31 \times 2 + 1

    remainder 1

  5. 31 = 15 \times 2 + 1

    remainder 1

  6. 15 = 7 \times 2 + 1

    remainder 1

  7. 7 = 3 \times 2 + 1

    remainder 1

  8. 3 = 1 \times 2 + 1

    remainder 1

  9. 1 = 0 \times 2 + 1

    remainder 1

जवाफ प्रकट गर्नुहोस्
255_{10} = 11111111_{2}

अब तपाईँ समस्या रोज्नुहोस्, वा टाइप गर्नुहोस् वा तपाईँको आफ्नै रेखाचित्र गर्नुहोस् । प्रत्येक चरण, एउटा तस्वीर, तपाईँले सोध्नु अघि उत्तर लुकेको छ ।

तपाईँको आफ्नै काम गर्ने राख्नुहोस्

एक निःशुल्क खाता प्रत्येक पाठ मा नोट थप्छ, तपाईं के समाप्त गरेको छ को एक रेकर्ड, एक ठाउँमा आफ्नो समाधान समस्या, र एक शिक्षक तपाईं यो पृष्ठ बारेमा सोध्न सक्नुहुन्छ. गणित आफैलाई सबैलाई खुला छ, मा साइन इन वा छैन.

साइन अप गर्नुहोस् लगइन

यहाँ प्रयोग गरिएको प्रतीक

पूर्ण परिभाषा, एउटा तस्वीर, र यो प्रत्येक अक्षर अर्थ के लागि कुनै पनि प्रतीक ट्याप गर्नुहोस्।

कसरी: Number bases

  1. Repeatedly divide by 2; the remainders, read bottom-up, are the digits.
  2. remainder 1
  3. remainder 1
  4. remainder 1
  5. remainder 1
  6. remainder 1
  7. remainder 1
  8. remainder 1

प्रश्नहरू मानिसहरूले सोध्छन्

Why are primes so important?

Every integer factors into primes in exactly one way, so primes are the atoms of multiplication. Cryptography relies on that factoring being easy to state and hard to do.

How do I tell whether a big number is prime?

Trial division up to the square root works for small numbers. For large ones, probabilistic tests (Miller-Rabin) give an answer that is wrong with negligible probability, and deterministic tests (AKS) exist but are slower.

यसमा थप Number Theory

Prime factorisationPrime numbersGCD and LCMModular arithmeticDivisorsSequencesDiophantine equationsFermat's little theorem and Euler's theoremRSA: cryptography from number theory