Algorithm number theory (15 résultats)

Hardcover. Etat : Fine. ix, 267 pp. ; illustrated with figures, photos and diagrams ; black cloth ; no dustjacket ; ex-lib, stamps, label, date due, pocket ; LCCN: 67-17216 ; Contents: The theory of character recognition -- The problem of character recognition form the point of view of mathematical statistics -- Spontaneous character differentiation -- On the correlation method of recognition -- On the effect of the number of indexes upon recognition reliability when determining the A priori probability of occurrence of classes with an error -- Experiments and calculations with the use of machines -- General purpose device for processing optical information by means of computers -- Algorithm for the recognition of typed symbols on the basis of ideal reference standards -- Calculation of the mutual correlation matrix of ideal reference standards -- Statistical research on the reliability of a character reader with optical correlation -- Designing of character readers -- On the accuracy of the calculation of correlation factors by the optical method -- On the selection of averaged reference standard patterns -- Character readers and their components -- Some works by foreign authors in the field of recognizing standard print -- Correlation-type character reader with shift register (ChARS) -- Character reader based on the principles of optical correlation -- Recognition of handwritten characters by means of a servo scan -- Sequential action correlation type character reader -- Designing extremum position indicators for correlation character readers -- Calculating and designing code voltage converters with diode keys -- Triode tube indicators of instant of voltage increase. ; "The nineteen articles in this collection focus on [pattern recognition] problems and computer simulation of various algorithms and recognition systems. All aspects of character recognition circuits and readers described here were developed at the Institute of Cybernetics, Academy of Sciences of the Ukrainian SSR.These problems first arose when it became evident to Soviet researchers that it would be useful to handle original documents without any encoding.all the work is strictly based on mathematically substantial procedures and methods used in the development of actual equipment at the Institute." ; covers the mathematics of OCR software and beginnings of the OCR scanner ; FINE. Book.…

paperback. Etat : New. Paperback. Pub Date: 2016-06-01 Pages: 503 Language: Chinese Publisher: Harbin industrial university press in the high school math code: algorithm. plane geometry. elementary number theory. combinatorial mathematics. and other is the high school math p series volume 9 - algorithm. plane geometry. elementary number theory. combinatorial mathematics. and other.Include the title of the base. …

paperback. Etat : New. Language:Chinese.Paperback. Pub Date: 2018-12-01 Pages: 282 Publisher: Higher Education Press Algorithm Number Theory is a new subject that must develop with the advancement of computers. It involves the actual calculation of the most basic problems of number theory. from the test of primeness to The calculation of groups and unit groups in the number circle involves various aspects of the field of number theory. This book includes the best in all areas.…

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In number theory, Sylvester's sequence is a sequence of integers in which each member of the sequence is the product of the previous members, plus one. The first few terms of the sequence are: 2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 (sequence A000058 in OEIS). Sylvester's sequence is named after James Joseph Sylvester, who first investigated it in 1880. Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions with the same sum. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its members. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms.…

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In computational number theory, Williams' p + 1 algorithm is an integer factorization algorithm, one of the family of algebraic-group factorisation algorithms. It was invented by H. C. Williams in 1982. So, for different values of M we calculate gcd(N,VM 2), and when the result is not equal to 1 or to N, we have found a non-trivial factor of N. The values of M used are successive factorials, and VM is the M-th value of the sequence characterized by VM 1.…

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing-recognizable if: There is an algorithm that, when given an input number, eventually halts if and only if the input is an element of S. Or, equivalently, there is an algorithm that enumerates the members of S. That means that its output is simply a list of the members of S: s1, s2, s3, . . If necessary, this algorithm may run forever. The first condition suggests why the term semidecidable is sometimes used; the second suggests why computably enumerable is used. The abbreviations r.e. and c.e. are often used, even in print, instead of the full phrase. …

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A set which is not computable is called noncomputable or undecidable. A more general class of sets consists of the recursively enumerable sets. For these sets, it is only required that there is an algorithm that correctly decides when a number is in the set; the algorithm may give no answer (but not the wrong answer) for numbers not in the set.…

Taschenbuch. Etat : Neu. Sylvester's Sequence | Number Theory, Sequence, Integer, Double Exponential Function, Multiplicative Inverse, Unit Fraction, Egyptian Fraction, Online Algorithm, Empty Product | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130356729 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…

Taschenbuch. Etat : Neu. Williams' p + 1 Algorithm | Computational Number Theory, Integer Factorization | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131187780 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. …

Taschenbuch. Etat : Neu. Recursively Enumerable Set | Recursively Enumerable Set, Computability Theory, Natural Number, Algorithm, Enumeration, Computational Complexity Theory | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130389369 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…

Taschenbuch. Etat : Neu. Recursive Set | Computability Theory, Set (Mathematics), Natural Number, Algorithm, Recursively Enumerable Set | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131307003 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. …

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In number theoryinteger factorization or prime factorization is the breaking down of acomposite number into smaller non-trivial divisors, which whenmultiplied together equal the original integer. When the numbers arevery large, no efficient integer factorization algorithm is publiclyknown; an effort concluded in 2009 by several researchers factored a232-digit number (RSA-768) utilizing hundreds of machines over a span of2 years. The presumed difficulty of this problem is at the heart ofcertain algorithms in cryptography such as RSA.…

Taschenbuch. Etat : Neu. Pocklington's Algorithm | Quadratic Residue, Prime Number, Modular Arithmetic, Number Theory, Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9783639961010 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. Pocklington'salgorithm is a technique for solving a congruence of the form x^2 equiva pmod p, , where x and a are integers and a is a quadratic residue. Thealgorithm is one of the first efficient methods to solve such acongruence. It was described by H.C. Pocklington in 1917. (Note: allequiv are taken to mean (mod p), unless indicated otherwise.) In numbertheory, an integer q is called a quadratic residue modulo n if it iscongruent to a perfect square (mod n); i.e., if there exists an integerx such that: {x^2}equiv {q} pmod{n}. Otherwise, q is called a quadraticnonresidue (mod n). Originally an abstract mathematical concept from thebranch of number theory known as modular arithmetic, quadratic residuesare now used in applications ranging from acoustical engineering tocryptography and the factoring of large numbers.…

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computabilitytheory, a set is decidable, computable, or recursive if there is analgorithm that terminates after a finite amount of time and correctlydecides whether or not a given object belongs to the set. Decidabilityof a set is of particular interest when the set is viewed as a decisionproblem; a decidable set is also a decidable problem, computableproblem, and recursive problem. The remainder of this article uses theterm decidable, although recursive and computable are equivalent in thiscontext. A language is a set of finite strings over a particularalphabet. A language is decidable (also computable, recursive) if it isa decidable set. A set, language, or decision problem that is notdecidable is undecidable, non-recursive, non-computable, oruncomputable. There are many known undecidable sets; one of theearliest, and most famous, examples is the halting problem.…