<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">bsuir-75</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>РЕКУРСИВНЫЙ АЛГОРИТМ ПОСТРОЕНИЯ ФУНКЦИИ ДИРИХЛЕ</article-title><trans-title-group xml:lang="en"><trans-title>The recursive algorithm to construct Dirichlet function</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Лысюк</surname><given-names>А. Н.</given-names></name><name name-style="western" xml:lang="en"><surname>Lysiuk</surname><given-names>A. N.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Дереченник</surname><given-names>С. С.</given-names></name><name name-style="western" xml:lang="en"><surname>Derechennik</surname><given-names>S. S.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Брестский государственный технический университет</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2012</year></pub-date><pub-date pub-type="epub"><day>03</day><month>06</month><year>2019</year></pub-date><volume>0</volume><issue>5</issue><fpage>116</fpage><lpage>121</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Лысюк А.Н., Дереченник С.С., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Лысюк А.Н., Дереченник С.С.</copyright-holder><copyright-holder xml:lang="en">Lysiuk A.N., Derechennik S.S.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://doklady.bsuir.by/jour/article/view/75">https://doklady.bsuir.by/jour/article/view/75</self-uri><abstract><p>Рассмотрена задача определения общего количества рациональных дробей, значения которых одинаковы и равны x. Продемонстрирована важность данной задачи для процедуры обработки статистических данных, представляющих собой соотношение двух дискретных величин с переменным знаменателем. Установлено, что искомое количество дробей равно значению функции Дирихле в точке x, для построения которой предложено оригинальное порождающее правило, имеющее простую геометрическую интерпретацию. Предложен вариант реализации данного алгоритма, показана его вычислительная эффективность, отмечена его важность в задачах, требующих генерации взаимно простых чисел.</p></abstract><trans-abstract xml:lang="en"><p>The problem of determining the total number of rational fractions with values are equal to x is considered. The importance of this problem is demonstrated for the procedures processing statistical data, representing the ratio of two discrete variables with a variable denominator. It is found out, that that required number of fractions is equal to the Dirichlet function value at the x point, and the original rule is proposed to construct it, which has a simple geometric interpretation. A proposed implementation of this algorithm shows its computational efficiency, and its importance is noted for problems requiring generation of relatively prime numbers.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>функция Дирихле</kwd><kwd>фрактал</kwd><kwd>рекурсивный алгоритм</kwd><kwd>взаимно простые числа</kwd><kwd>статистическая обработка данных</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Александров П.С. Введение в теорию множеств и общую топологию. М., 1977.</mixed-citation><mixed-citation xml:lang="en">Александров П.С. Введение в теорию множеств и общую топологию. М., 1977.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Bruckner A., Bruckner J., Thomson B. Elementary Real Analysis. NJ, 2008.</mixed-citation><mixed-citation xml:lang="en">Bruckner A., Bruckner J., Thomson B. Elementary Real Analysis. NJ, 2008.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Кнут Д.Э. Искусство программирования. Получисленные методы. М., 2007.</mixed-citation><mixed-citation xml:lang="en">Кнут Д.Э. Искусство программирования. Получисленные методы. М., 2007.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Виноградов И.М. Основы теории чисел. М., 1965.</mixed-citation><mixed-citation xml:lang="en">Виноградов И.М. Основы теории чисел. М., 1965.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Apostol T.M. Modular Functions and Dirichlet Series in Number Theory. NY, 1997.</mixed-citation><mixed-citation xml:lang="en">Apostol T.M. Modular Functions and Dirichlet Series in Number Theory. NY, 1997.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Hill L.S. // The American Mathematical Monthly. 1929. Vol. 36. P. 306-312.</mixed-citation><mixed-citation xml:lang="en">Hill L.S. // The American Mathematical Monthly. 1929. Vol. 36. P. 306-312.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Kahn D. The Codebreakers: The Story of Secret Writing. NY, 1996.</mixed-citation><mixed-citation xml:lang="en">Kahn D. The Codebreakers: The Story of Secret Writing. NY, 1996.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Gentle J. Random Number Generation and Monte Carlo Methods. NY, 2003.</mixed-citation><mixed-citation xml:lang="en">Gentle J. Random Number Generation and Monte Carlo Methods. NY, 2003.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
