Asenna Steam
kirjaudu sisään
|
kieli
简体中文 (yksinkertaistettu kiina)
繁體中文 (perinteinen kiina)
日本語 (japani)
한국어 (korea)
ไทย (thai)
български (bulgaria)
Čeština (tšekki)
Dansk (tanska)
Deutsch (saksa)
English (englanti)
Español – España (espanja – Espanja)
Español – Latinoamérica (espanja – Lat. Am.)
Ελληνικά (kreikka)
Français (ranska)
Italiano (italia)
Bahasa Indonesia (indonesia)
Magyar (unkari)
Nederlands (hollanti)
Norsk (norja)
Polski (puola)
Português (portugali – Portugali)
Português – Brasil (portugali – Brasilia)
Română (romania)
Русский (venäjä)
Svenska (ruotsi)
Türkçe (turkki)
Tiếng Việt (vietnam)
Українська (ukraina)
Ilmoita käännösongelmasta









many thanks for the explanations !
The only question remaining for me is related to the checksum and this part works depending on what I want to input th amout of '1' can't always be brought to 32 just with the help of only 3 bits.
How is the sum calculated and which values are attended for it?
Thanking you by advance for your feedback
111 111 111 111 111 11_0 01_1 111 111 111 110 000 110
You change it to, say, 010:
111 111 111 111 111 11_0 10_1 111 111 111 110 000 110
So you should input:
5 infinity symbols, X, =, 3 infinity symbols, X, circle and X in the center.
And the checksum remains the same, because the amount of 1's did not change. It would change for the third class, though - just increase the checksum by 1 for that case).