I read about Wikipedia:"In general, for coding with the complement radix r, with the base (base) of a number system, an integer part of m digits and a fractional part of n digits, then r complements the number 0 ≤ N <r ^ (m-1 ) -r ^ (-n) is determined by the formula:
N ** = (r ^ m - N) mod (r ^ m) "
I do not understand what the number of digits, i.e. depends on the radius r?For example: if I want to find 100 additions to 97, then m = 2 or m = 1?For m = 2, I get the answer as 9903For m = 1, I get the answer as 03So should I take m = 2 or m = 1?
, , , , , .
, , . , 5 base-2 (.. ), base-2 - 251. , -5 0b11111011.
-5
0b11111011
, 97 -100. , n- base-100.
, 100 . , -3 97- . , -3 99- , 97- .
-3
, , , - base-100.:-) , - .
16 7 9. F9. FF9. ,
Source: https://habr.com/ru/post/1767904/More articles:System type exception: Char - c #Возможно, действительно глупый вопрос Web Farm Framework - asp.netNURBS on DirectX 11? - gpuproblem with updating rspec using rails 3 - ruby-on-railsHow to access low level API for data storage in Google App Engine for python - pythonMaster data: temporary values of a dirty object - objective-cВопрос безопасности: чрезмерные запросы Drupal из одной учетной записи пользователя - securityBlur layer under - javaDoes XML :: Simple support ordering when using arrays? - xmlПроблемы управления потоками! - delphiAll Articles