Перевод: с русского на английский

с английского на русский


См. также в других словарях:

  • Digit sum — In mathematics, the digit sum of a given integer is the sum of all its digits, (e.g.: the digit sum of 84001 is calculated as 8+4+0+0+1 = 13). Digit sums are most often computed using the decimal representation of the given number, but… …   Wikipedia

  • Sum-product number — A sum product number is an integer that in a given base is equal to the sum of its digits times the product of its digits. Or, to put it algebraically, given an integer n that is l digits long in base b (with d x representing the x th digit), ifn …   Wikipedia

  • Sum addressed decoder — In CPU design, a Sum Addressed Decoder or Sum Addressed Memory (SAM) Decoder is a method of reducing the latency of the CPU cache access. This is achieved by fusing the address generation sum operation with the decode operation in the cache… …   Wikipedia

  • Sum-Of-The-Years' Digits — An accelerated method for calculating an asset s depreciation. This method takes the asset s expected life and adds together the digits for each year. So if the asset was expected to last for five years, the sum of the years’ digits would… …   Investment dictionary

  • sum of years digit depreciation — method of calculating accelerated depreciation of goods that assumes a more rapid loss of value during the first years of a product s life cycle (Accounting) …   English contemporary dictionary

  • Check digit — A check digit is a form of redundancy check used for error detection, the decimal equivalent of a binary checksum. It consists of a single digit computed from the other digits in the message. With a check digit, one can detect simple errors in… …   Wikipedia

  • Digital sum — There are a number of common mathematical meanings of the term digital sum: Values The digit sum add the digits of the representation of a number in a given base. For example, considering 84001 in base 10 the digit sum would be… …   Wikipedia

  • Subset sum problem — In computer science, the subset sum problem is an important problem in complexity theory and cryptography. The problem is this: given a set of integers, does the sum of some non empty subset equal exactly zero? For example, given the set { −7, −3 …   Wikipedia

  • Perfect digit-to-digit invariant — A perfect digit to digit invariant (PDDI) (also known as a Munchausen number[1]) is a number that is equal to the sum of its digits each raised to a power equal to the digit. 0 and 1 are PDDIs in any base (using the convention that 00 = 0). Apart …   Wikipedia

  • Метод суммы цифр лет (SUM-OF-YEARS-DIGIT (SYD) DEPRECIATION METHOD)  — Метод ускоренной амортизации. В соответствии с данным методом (а) суммируются цифры (1,2,3…n) лет периода амортизации актива и (б) берется в качестве нормы амортизации для каждого года дробь, в числитель которой подставляются цифры года, взятые в …   Словарь терминов по управленческому учету

  • Luhn-Algorithmus — Der Luhn Algorithmus oder die Luhn Formel, auch bekannt als „Modulo 10“ oder „mod 10“ Algorithmus und als Double Add Double Methode, wurde in den 1960er Jahren von Hans Peter Luhn als eine Methode der Überprüfung von Identifikationsnummern… …   Deutsch Wikipedia