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
قدم به قدم
- 255_{10} \to \text{base } 2
Repeatedly divide by 2; the remainders, read bottom-up, are the digits.
- 255 = 127 \times 2 + 1
remainder 1
- 127 = 63 \times 2 + 1
remainder 1
- 63 = 31 \times 2 + 1
remainder 1
- 31 = 15 \times 2 + 1
remainder 1
- 15 = 7 \times 2 + 1
remainder 1
- 7 = 3 \times 2 + 1
remainder 1
- 3 = 1 \times 2 + 1
remainder 1
- 1 = 0 \times 2 + 1
remainder 1
جواب رو نشون بده
حالا تو يه مساله انتخاب کن، يا خودت رو بنويس يا بکشي هر گام، يه تصوير، جواب مخفي ميشه تا وقتي که تو بپرسي
نمادهای استفاده‌شده در اینجا
هر نماد را برای تعریف کامل، تصویر و معنی هر حرف در آن بزنید.
چطور: Number bases
- Repeatedly divide by 2; the remainders, read bottom-up, are the digits.
- remainder 1
- remainder 1
- remainder 1
- remainder 1
- remainder 1
- remainder 1
- 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