<?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-2023-24-5-167-179</article-id><article-id custom-type="elpub" pub-id-type="custom">cheb-1627</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>About Cotangent</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>Soloviev</surname><given-names>Sergey Yurievich</given-names></name></name-alternatives><bio xml:lang="ru"><p>доктор физико-математических наук, профессор</p></bio><bio xml:lang="en"><p>doctor of physical and mathematical sciences, professor</p></bio><email xlink:type="simple">soloviev@glossary.ru</email><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>Lomonosov Moscow State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>01</day><month>02</month><year>2024</year></pub-date><volume>24</volume><issue>5</issue><fpage>167</fpage><lpage>179</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Соловьев С.Ю., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Соловьев С.Ю.</copyright-holder><copyright-holder xml:lang="en">Soloviev S.Y.</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/1627">https://www.chebsbornik.ru/jour/article/view/1627</self-uri><abstract><p>В работе описывается прием рассуждений, позволяющий получать относительно простые оценки значений котангенса для углов из полуинтервала (0, 𝜋/2 ]. Прием базируется на способности котангенса уточнять некоторые свои оценки, ранее полученные из сторонних соображений. В качестве иллюстрации приема приводятся выводы оценок котангенса для двух подклассов дробно-рациональных функций.</p></abstract><trans-abstract xml:lang="en"><p>In this paper we describe a reasoning method which allows to get relatively simple estimates of cotangent values for angles in the half-interval (0, 𝜋/2 ]. The method is based on the ability of the cotangent to refine some of its estimates that were derived from other considerations. As an illustration of the method we give cotangent estimates for two subclasses of rational functions.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>котангенс</kwd><kwd>оценки</kwd><kwd>миноранты</kwd><kwd>мажоранты.</kwd></kwd-group><kwd-group xml:lang="en"><kwd>cotangent</kwd><kwd>estimations</kwd><kwd>minorants</kwd><kwd>majorants.</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Работа выполнена в МГУ имени М. В. Ломоносова (факультет ВМК)</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Гельфанд И. М., Львовский С. М., Тоом А. Л. Тригонометрия. – М.: МЦНМО, 2008. –199 с.</mixed-citation><mixed-citation xml:lang="en">Gelfand, I. M., Lvovsky, S. M. &amp; Toom, A. L. 2008, Trigonometry, MCCME, Moscow, 199 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Gelfand I. M., Saul M. Trigonometry. – Boston, MA: Birkh¨auser Boston, 2001. – 229 c.</mixed-citation><mixed-citation xml:lang="en">Gelfand, I. M., Saul M. 2001, Trigonometry, Birkh¨auser, Boston, MA, 229 p.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Гурский И. П. Функции и построение графиков. – М.: Просвещение, 1968. – 215 c.</mixed-citation><mixed-citation xml:lang="en">Gursky, I.P. 1968, Functions and graphs build, Prosveschenie, Moscow, 215 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Каазик Ю.А. Математический словарь. – М.: Физматлит, 2007. – 336 c.</mixed-citation><mixed-citation xml:lang="en">Kaazik, Y. A. 2007, Mathematical dictionary, Fizmatlit, Moscow, 336 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Математическая энциклопедия, том 3 / Глав.ред. И. М.Виноградов. – М.: Советская энциклопедия, 1982. – 592c.</mixed-citation><mixed-citation xml:lang="en">Vinogradov, I. M. (ed.) 1982, Encyclopedia of mathematics, Sov.Entsiklopediya, Moscow, 592 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Шарый С. П. Курс вычислительных методов. – Новосибирск: НГУ, 2022. – 668 c.</mixed-citation><mixed-citation xml:lang="en">Shary, S.P. 2022, Course of computational methods, Novosibirsk State University, Novosibirsk, 668 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Брадис В. М. Теория и практика вычислений. – М.: Учпедгиз, 1935. – 280 c.</mixed-citation><mixed-citation xml:lang="en">Bradis, V. M. 1935, Theory and practice of computing, UchPegGiz, Moscow, 280 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Маркушевич А.И. Возвратные последовательности. – М.: Наука, 1975. – 48 c.</mixed-citation><mixed-citation xml:lang="en">Markushevich, A. I. 1975, Recursion sequences, Mir Publishers, Moscow, 48 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Головешкин В. А., Ульянов М. В. Теория рекурсии для программистов. – М.: Физматлит, 2006. – 296 c.</mixed-citation><mixed-citation xml:lang="en">Goloveshkin, V. A., Ulyanov, M. V. 2006, Recursion theory for programmers, Fizmatlit, Moscow, 296 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Соминский И. С. Метод математической индукции. – М.: Физматлит, 1967. – 64 c.</mixed-citation><mixed-citation xml:lang="en">Sominsky, I. S. 1975 The Method of Mathematical Induction, Mir Publishers, Moscow, 63 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Gunderson D. S. Handbook of mathematical induction: Theory and applications. – Boca Ratton, FL: CRC Press, 2011. – 893 c.</mixed-citation><mixed-citation xml:lang="en">Gunderson, D. S. 2011 Handbook of mathematical induction: Theory and applications, CRC Press, Boca Ratton, FL, 893 p.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Ильин В. А., Позняк Э. Г. Основы математического анализа (часть I). – М.: Физматлит, 2005. – 648 c.</mixed-citation><mixed-citation xml:lang="en">Ilyin, V. A., Poznyak, E. G. 2005, Basics of Mathematical Analysis (part 1), Fizmatlit, Moscow, 648 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Тихонов А. Н., Васильева А. Б., Свешников А. Г. Дифференциальные уравнения. – М.: Физматлит, 2005. – 256 c.</mixed-citation><mixed-citation xml:lang="en">Tikhonov, A. N., Vasil’eva, A. B., Sveshnikov, A. G. 1985, Differential Equations, Springer-Verlag, Berlin, 256 p.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Треногин В.А. Функциональный анализ. – М.: Физматлит, 2002. – 488 c.</mixed-citation><mixed-citation xml:lang="en">Trenogin, V. A. 2002, The Functional Analysis, Fizmatlit, Moscow, 488 p. (in Russian)</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Кудрявцев Л. Д. Курс математического анализа, том 2. – М.: Юрайт, 2022. – 720 c.</mixed-citation><mixed-citation xml:lang="en">Kudriavtsev, L. D. 2022, Course of Mathematical Analysis, vol. 2, Iurait Publ., Moscow, 720 p. (in Russian)</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>
