<?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">cheb</journal-id><journal-title-group><journal-title xml:lang="ru">Чебышевский сборник</journal-title><trans-title-group xml:lang="en"><trans-title>Chebyshevskii Sbornik</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-8383</issn><publisher><publisher-name>Tula State Lev Tolstoy  Pedagogical University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.22405/2226-8383-2025-26-4-174-182</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-2077</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><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Article</subject></subj-group></article-categories><title-group><article-title>О сравнениях Гаусса и Якобшталя</article-title><trans-title-group xml:lang="en"><trans-title>On Gauss and Jacobsthal congruences</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>Pimenov</surname><given-names>Konstantin Igorevich</given-names></name></name-alternatives><bio xml:lang="ru"><p>кандидат физико-математических наук</p></bio><bio xml:lang="en"><p>candidate of physical and mathematical sciences</p></bio><email xlink:type="simple">k.pimenov@spbu.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>Faizov</surname><given-names>Ildar Nikolaevich</given-names></name></name-alternatives><email xlink:type="simple">ildar_faizov@mail.ru</email><xref ref-type="aff" rid="aff-2"/></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>Zhukov</surname><given-names>Igor Borisovich</given-names></name></name-alternatives><bio xml:lang="ru"><p>доктор физико-математических наук</p></bio><bio xml:lang="en"><p>doctor of physical and mathematical sciences</p></bio><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Санкт-Петербургский государственный университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Saint Petersburg State University</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>OOO «Яндекс-Технологии»</institution><country>Россия</country></aff><aff xml:lang="en"><institution>LLC “Yandex Technologies”</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>29</day><month>12</month><year>2025</year></pub-date><volume>26</volume><issue>4</issue><fpage>174</fpage><lpage>182</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Пименов К.И., Фаизов И.Н., Жуков И.Б., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Пименов К.И., Фаизов И.Н., Жуков И.Б.</copyright-holder><copyright-holder xml:lang="en">Pimenov K.I., Faizov I.N., Zhukov I.B.</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://www.chebsbornik.ru/jour/article/view/2077">https://www.chebsbornik.ru/jour/article/view/2077</self-uri><abstract><p>Данная статья посвящена распространеннию классического сравнения Вольстенхольма для центрального биномиального коэффициента (︀2𝑝 𝑝 )︀ на случай составного числа. Перено-сом малой теоремы Ферма на составной случай является сравнение Гаусса, которое имеет простую комбинаторно-динамическую интерпретацию. Для распространения сравнения Вольстенхольма на составной случай необходимо использовать сравнение Якобшталя.Приводится комбинаторное доказательство его ослабленной версии, основанное на исследовании длин орбит некоторого действия силовской 𝑝-подгруппы симметрической группы.</p></abstract><trans-abstract xml:lang="en"><p>This paper is devoted to extending the classical Wolstenholme congruence for the central binomial coefficient (︀2𝑝 𝑝 )︀ to the case of a composite number. An extension of Fermat’s little theorem to the composite case is the Gauss congruence, which has a simple combinatorialdynamic interpretation. To extend Wolstenholme’s congruence to the composite case, it isnecessary to use the Jacobsthal congruence. A combinatorial proof of its weakened version is given based on investigation of the orbit lenghts for a suitable action of Sylow 𝑝-subgroupsof the symmetric group.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>малая теорема Ферма</kwd><kwd>элементарная теория чисел</kwd><kwd>силовская подгруппа</kwd><kwd>арифметическая динамика</kwd><kwd>сравнения Гаусса</kwd><kwd>последовательность Дольда</kwd><kwd>теорема Вольстенхольма</kwd></kwd-group><kwd-group xml:lang="en"><kwd>Fermat little theorem</kwd><kwd>elementary number theory</kwd><kwd>arithmetical dynamics</kwd><kwd>Sylow subgroup</kwd><kwd>Gauss congruence</kwd><kwd>Dold Sequence</kwd><kwd>Wolstenholme’s theorem</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">Almkvist G. Integrity of ghosts // Preprint. — 1983. — URL: https://arxiv.org/abs/math/0612443 (дата обращения: 01.01.2024).</mixed-citation><mixed-citation xml:lang="en">Almkvist, G. 1983, “Integrity of ghosts”, Preprint, Available at: https://arxiv.org/abs/math/0612443.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Арнольд В. И. Матричная теорема Эйлера–Ферма // Известия Российской академии наук. Серия математическая. — 2004. — Т. 68, № 6. — С. 3–24.</mixed-citation><mixed-citation xml:lang="en">Arnold, V.I. 2004, “The Matrix Euler-Fermat theorem”, Izvestiya: Mathematics, 68(6), pp. 1119–1128.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Винберг Э. Б. Малая теорема Ферма и ее обобщения // Математическое просвещение. Серия 3. — 2008. — Вып. 12. — С. 7–17.</mixed-citation><mixed-citation xml:lang="en">Vinberg, E.B. 2008, “Fermat’s little theorem and generalizations”, Matematicheskoe Prosveshchenie, 12, pp. 43–54.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Зарелуа А. В. О сравнениях для следов степеней некоторых матриц // Труды Математического института имени В. А. Стеклова. — 2008. — Т. 263. — С. 85–105.</mixed-citation><mixed-citation xml:lang="en">Zarelua, A.V. 2008, “On congruences for the traces of powers of some matrices”, Proceedings of the Steklov Institute of Mathematics, 263, pp. 78–98.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Трахтман Ю. А. О делимости некоторых разностей, составленных из биномиальных коэффициентов // Доклады Академии наук Армянской ССР. — 1974. — Т. 59. — С. 10–16.</mixed-citation><mixed-citation xml:lang="en">Trachtman, Yu.A. 1974, “On the divisibility of certain differences, formed from binomial coefficients”, Doklady Akademii Nauk Armyanskoi SSR, 59, pp. 10–16.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Byszewski J., Graff G., Ward T. Dold sequences, periodic points, and dynamics // Bulletin of the London Mathematical Society. — 2021. — Vol. 53. — P. 1263–1298.</mixed-citation><mixed-citation xml:lang="en">Byszewski, J., Graff, G., and Ward, T. 2021, “Dold sequences, periodic points, and dynamics”, Bulletin of the London Mathematical Society, 53, pp. 1263–1298.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Brun V., Stubban J. O., Fjeldstad J. E., Tambs-Lyche R., Aubert K. E., Ljunggren W., Jacobsthal E. On the divisibility of the difference between two binomial coefficients // Den 11te Skandinaviske Matematikerkongress, Trondheim 1949. — 1952. — P. 42–54.</mixed-citation><mixed-citation xml:lang="en">Brun, V., Stubban, J.O., Fjeldstad, J.E., Tambs-Lyche, R., Aubert, K.E., Ljunggren, W., and Jacobsthal, E. 1952, “On the divisibility of the difference between two binomial coefficients”, in Den 11te Skandinaviske Matematikerkongress, Trondheim 1949, pp. 42–54.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Deligne P. Extended Euler congruence // Functional Analysis and Other Mathematics. — 2009. — Vol. 2. — P. 249–250.</mixed-citation><mixed-citation xml:lang="en">Deligne, P. 2009, “Extended Euler congruence”, Functional Analysis and Other Mathematics, 2, pp. 249–250.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Jacobsthal E. Tallteoretiske egenskaper ved binominalkoeffisientene // Norske Videnskabers Selskabs Skrifter (Trondheim). — 1945. — No. 4. — P. 1–28.</mixed-citation><mixed-citation xml:lang="en">Jacobsthal, E. 1945, “Tallteoretiske egenskaper ved binominalkoeffisientene”, Norske Videnskabers Selskabs Skrifter (Trondheim), 4, pp. 1–28.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">J¨anichen W. ¨Uber die Verallgemeinerung einer Gaussschen Formel aus der Theorie der h¨oheren Kongruenzen // Sitzungsberichte der Berliner Mathematischen Gesellschaft. — 1921. — Vol. 20. — P. 23–29.</mixed-citation><mixed-citation xml:lang="en">J¨anichen, W. 1921, “ ¨Uber die Verallgemeinerung einer Gaussschen Formel aus der Theorie der h¨oheren Kongruenzen”, Sitzungsberichte der Berliner Mathematischen Gesellschaft, 20, pp. 23–29.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Ljunggren W. Eine Eigenschaft der mittleren Binomialkoeffizienten // Norsk Matematisk Tidsskrift. — 1942. — Vol. 24. — P. 18–22.</mixed-citation><mixed-citation xml:lang="en">Ljunggren, W. 1942, “Eine Eigenschaft der mittleren Binomialkoeffizienten”, Norsk Matematisk Tidsskrift, 24, pp. 18–22.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Minton G. T. Linear recurrence sequences satisfying congruence conditions // Proceedings of the American Mathematical Society. — 2014. — Vol. 142, No. 7. — P. 2337–2352.</mixed-citation><mixed-citation xml:lang="en">Minton, G.T. 2014, “Linear recurrence sequences satisfying congruence conditions”, Proceedings of the American Mathematical Society, 142(7), pp. 2337–2352.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Schur I. Arithmetische Eigenschaften der Potenzsummen einer algebraischen Gleichung // Compositio Mathematica. — 1937. — Vol. 272. — P. 432–444.</mixed-citation><mixed-citation xml:lang="en">Schur, I. 1937, “Arithmetische Eigenschaften der Potenzsummen einer algebraischen Gleichung”, Compositio Mathematica, 272, pp. 432–444.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Sch¨onemann T. Grundz¨uge einer allgemeinen Theorie der h¨ohern Congruenzen, deren Modul eine reelle Primzahl ist // Journal f¨ur die reine und angewandte Mathematik. — 1846. — Vol. 31. — P. 269–325.</mixed-citation><mixed-citation xml:lang="en">Sch¨onemann, T. 1846, “Grundz¨uge einer allgemeinen Theorie der h¨ohern Congruenzen, deren Modul eine reelle Primzahl ist”, Journal f¨ur die reine und angewandte Mathematik, 31, pp. 269–325.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Smith J. H. Combinatorial Congruences from p-subgroups of the Symmetric Group // Graphs and Combinatorics. — 1993. — Vol. 9. — P. 293–304.</mixed-citation><mixed-citation xml:lang="en">Smith, J.H. 1993, “Combinatorial Congruences from p-subgroups of the Symmetric Group”, Graphs and Combinatorics, 9, pp. 293–304.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Smyth C. J. A coloring proof of a generalization of Fermat’s little theorem // The American Mathematical Monthly. — 1986. — Vol. 93. — P. 469–471.</mixed-citation><mixed-citation xml:lang="en">Smyth, C.J. 1986, “A coloring proof of a generalization of Fermat’s little theorem”, The American Mathematical Monthly, 93, pp. 469–471.</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>
