On the Continued Fractions of J. Mikusiński

Abstract

Authors

Tiberiu Popoviciu
Institutul de Calcul

Keywords

?

Paper coordinates

T. Popoviciu, Sur les fractions continues de J. Mikusinski, Rev. Roumaine Math. Pures Appl., 13, 1968, pp. 79-83 (in French)

PDF

About this paper

Journal

Revue Roumaine de Mathématiques Pures et Appliquées

Publisher Name

published by the Publishing House of the Romanian Academy

DOI

 

Print ISSN

 

Online ISSN

 

[/vc_column]

Paper (preprint) in HTML form

1968 a -Popoviciu- Rev. Roum. Math. Pures Appl. - On the continued fractions of J. Mikusinski html,body { width: 100%; height: 100%; } *, *::before,*::after { box-sizing: border-box; } body { margin: 0; color: #1E2029; font-size: 14px; line-height: normal; } hr { box-sizing: content-box; height: 0; overflow: visible; } h1, h2, h3, h4, h5, h6 { margin-top: 0; margin-bottom: 0.5em; color: rgba(0, 0, 0, 0.85); font-weight: 500; } p { margin-top: 0; margin-bottom: 1em; } ol, ul, dl { margin-top: 0; margin-bottom: 1em; } ol ol, ul ul, ol ul, ul ol { margin-bottom: 0; } dt { font-weight: 500; } dd { margin-bottom: 0.5em; margin-left: 0; } blockquote { margin: 0 0 1em; } dfn { font-style: italic; } b, strong { font-weight: bolder; } small { font-size: 80%; } sub, sup { position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } sub { bottom: -0.25em; } sup { top: -0.5em; } a { color: #0B93ff; text-decoration: none; background-color: transparent; outline: none; cursor: pointer; transition: color 0.3s; } a:hover { color: #33aaff; } a:active { color: #0070d9; } a:active, a:hover { text-decoration: none; outline: 0; } a[disabled] { color: rgba(0, 0, 0, 0.25); cursor: not-allowed; pointer-events: none; } pre, code, kbd, samp { font-size: 1em; } pre { margin-top: 0; margin-bottom: 1em; overflow: auto; } figure { margin: 0 0 1em; } img { vertical-align: middle; border-style: none; } svg:not(:root) { overflow: hidden; } table { border-collapse: collapse; } caption { padding-top: 0.75em; padding-bottom: 0.3em; color: rgba(0, 0, 0, 0.45); text-align: left; caption-side: bottom; } th { text-align: inherit; } mjx-container[jax="SVG"] { direction: ltr; } mjx-container[jax="SVG"] > svg { overflow: visible; min-height: 1px; min-width: 1px; } mjx-container[jax="SVG"] > svg a { fill: blue; stroke: blue; } mjx-assistive-mml { position: absolute !important; top: 0px; left: 0px; clip: rect(1px, 1px, 1px, 1px); padding: 1px 0px 0px 0px !important; border: 0px !important; display: block !important; width: auto !important; overflow: hidden !important; -webkit-touch-callout: none; -webkit-user-select: none; -khtml-user-select: none; -moz-user-select: none; -ms-user-select: none; user-select: none; } mjx-assistive-mml[display="block"] { width: 100% !important; } mjx-container[jax="SVG"][display="true"] { display: block; text-align: center; margin: 1em 0; } mjx-container[jax="SVG"][display="true"][width="full"] { display: flex; } mjx-container[jax="SVG"][justify="left"] { text-align: left; } mjx-container[jax="SVG"][justify="right"] { text-align: right; } g[data-mml-node="merror"] > g { fill: red; stroke: red; } g[data-mml-node="merror"] > rect[data-background] { fill: yellow; stroke: none; } g[data-mml-node="mtable"] > line[data-line], svg[data-table] > g > line[data-line] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > rect[data-frame], svg[data-table] > g > rect[data-frame] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > .mjx-dashed, svg[data-table] > g > .mjx-dashed { stroke-dasharray: 140; } g[data-mml-node="mtable"] > .mjx-dotted, svg[data-table] > g > .mjx-dotted { stroke-linecap: round; stroke-dasharray: 0,140; } g[data-mml-node="mtable"] > g > svg { overflow: visible; } [jax="SVG"] mjx-tool { display: inline-block; position: relative; width: 0; height: 0; } [jax="SVG"] mjx-tool > mjx-tip { position: absolute; top: 0; left: 0; } mjx-tool > mjx-tip { display: inline-block; padding: .2em; border: 1px solid #888; font-size: 70%; background-color: #F8F8F8; color: black; box-shadow: 2px 2px 5px #AAAAAA; } g[data-mml-node="maction"][data-toggle] { cursor: pointer; } mjx-status { display: block; position: fixed; left: 1em; bottom: 1em; min-width: 25%; padding: .2em .4em; border: 1px solid #888; font-size: 90%; background-color: #F8F8F8; color: black; } foreignObject[data-mjx-xml] { font-family: initial; line-height: normal; overflow: visible; } mjx-container[jax="SVG"] path[data-c], mjx-container[jax="SVG"] use[data-c] { stroke-width: 3; } #setText > div { justify-content: inherit; margin-top: 0; margin-bottom: 1em; } #setText div:last-child { margin-bottom: 0 !important; } #setText > br, #preview-content br { line-height: 1.2; } #preview-content > div { margin-top: 0; margin-bottom: 1em; } .proof > div, .theorem > div { margin-top: 1rem; } #preview-content table { margin-bottom: 1em; } #setText table { margin-bottom: 1em; } #preview-content .sub-table table, #setText .sub-table table { margin-bottom: 0; } mjx-container { text-indent: 0; overflow-y: hidden; overflow-x: auto; padding-top: 1px; padding-bottom: 1px; } .math-inline mjx-container { display: inline-block !important; page-break-inside: avoid; max-width: 100%; padding: 0; line-height: 0; } .math-inline[data-overflow="visible"] mjx-container { overflow: visible; } .math-inline mjx-container mjx-assistive-mml { max-width: 100%; } .math-block { align-items: center; page-break-after: auto; page-break-inside: avoid; margin: 0; display: block; /* mjx-container has block */ } .math-inline { display: inline-flex; /* mjx-container has inline-block. To prevent displacement during use overflow-x: auto;*/ max-width: 100%; } .math-block[data-width="full"] { overflow-x: auto; display: flex; /* mjx-container has flex */ } svg .math-inline { display: initial; max-width: initial; } svg .math-inline mjx-container { max-width: initial; } svg mjx-container { overflow: visible; padding: 0; } svg math-block[data-width="full"] { overflow: visible; } .math-block,.math-inline { --mmd-highlight-color: rgba(0, 147, 255, 0.25); --mmd-highlight-text-color: #1e2029; } .math-block[data-highlight-color] mjx-container[jax="SVG"] > svg { background-color: var(--mmd-highlight-color); } .math-block[data-highlight-text-color] mjx-container[jax="SVG"] > svg { color: var(--mmd-highlight-text-color); } .math-inline[data-highlight-color] mjx-container[jax="SVG"] { background-color: var(--mmd-highlight-color); } .math-inline[data-highlight-text-color] mjx-container[jax="SVG"] { color: var(--mmd-highlight-text-color); } .math-block p { flex-shrink: 1; } .math-block mjx-container { margin: 0 !important; } .math-error { background-color: yellow; color: red; } #preview-content img, #setText img { max-width: 100%; } #preview-content blockquote, #setText blockquote { page-break-inside: avoid; color: #666; margin: 0 0 1em 0; padding-left: 3em; border-left: .5em solid #eee; } #preview-content pre, #setText pre { border: none; padding: 0; overflow: auto; font-size: 85%; line-height: 1.45; border-radius: 6px; box-sizing: border-box; background: #f8f8fa; } #preview-content pre code, #setText pre code{ padding: 1rem; display: block; overflow-x: auto; line-height: 24px; } .empty { text-align: center; font-size: 18px; padding: 50px 0 !important; } #setText table, #preview-content table { display: table; overflow: auto; max-width: 100%; border-collapse: collapse; page-break-inside: avoid; } #setText table th, #preview-content table th { text-align: center; font-weight: bold; } #setText table td, #preview-content table td, #setText table th, #preview-content table th { border: 1px solid #dfe2e5; padding: 6px 13px; } #setText table tr, #preview-content table tr { background-color: #fff; border-top: 1px solid #c6cbd1; } #setText table tr:nth-child(2n), #preview-content table tr:nth-child(2n) { background-color: #f6f8fa; } #preview-content .main-title, #setText .main-title { text-align: center; line-height: 1.2; margin: 0 auto 1em auto; } #preview-content .author, #setText .author { text-align: center; margin: 0 auto; display: flex; justify-content: center; flex-wrap: wrap; } #preview-content .author p, #setText .author p { min-width: 30%; max-width: 50%; padding: 0 7px; } #preview-content .author > p > span, #setText .author > p > span { display: block; text-align: center; } #preview-content .section-title, #setText .section-title { margin-top: 1.5em; } #preview-content .abstract, #setText .abstract { text-align: justify; margin-bottom: 1em; } #preview-content .abstract p, #setText .abstract p { margin-bottom: 0; } @media print { #preview { font-size: 10pt!important; } svg { shape-rendering: crispEdges; } .math-block svg, math-inline svg { margin-top: 1px; } #preview-content img, #setText img { display: block; } #preview-content .figure_img img, #setText .figure_img img { display: inline; } .preview-right { word-break: break-word; } #preview-content h1, #setText h1 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h1::after, #setText h1::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h2, #setText h2 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h2::after, #setText h2::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h3, #setText h3 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h3::after, #setText h3::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h4, #setText h4 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h4::after, #setText h4::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h5, #setText h5 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h5::after, #setText h5::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h6, #setText h6 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h6::after, #setText h6::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } } #preview-content sup, #setText sup { top: -.5em; position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } #preview-content .text-url, #setText .text-url { color: #0B93ff; cursor: text; pointer-events: none; } #preview-content .text-url a:hover, #setText .text-url a:hover { color: #0B93ff; } mark { background-color: #feffe6; } span[data-underline-type] mark { background: inherit; background-color: #feffe6; padding-top: 0; padding-bottom: 0; } *[data-has-dotfill] { position: relative; overflow: hidden; } *[data-has-dotfill] .dotfill::after { position: absolute; padding-left: .25ch; content: " . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . "; text-align: right; } .smiles { text-align: center; } div.svg-container, #setText > div.svg-container { display: flex; justify-content: center; } #preview-content code, #setText code { font-family: Inconsolata; font-size: inherit; display: initial; background: #f8f8fa; } #preview-content .mmd-highlight code, #setText .mmd-highlight code, #preview-content pre.mmd-highlight code, #setText pre.mmd-highlight code { background-color: transparent; } #preview-content pre code, #setText pre code { font-family: 'DM Mono', Inconsolata, monospace; color: #333; font-size: 15px; } .hljs-comment, .hljs-quote { color: #998; font-style: italic; } .hljs-command { color: #005cc5; } .hljs-keyword, .hljs-selector-tag, .hljs-subst { color: #d73a49; font-weight: bold; } .hljs-number, .hljs-literal, .hljs-variable, .hljs-template-variable, .hljs-tag .hljs-attr { color: #005cc5; } .hljs-string, .hljs-doctag { color: #24292e; } .hljs-title, .hljs-section, .hljs-selector-id { color: #6f42c1; font-weight: bold; } .hljs-subst { font-weight: normal; } .hljs-type, .hljs-class .hljs-title { color: #458; font-weight: bold; } .hljs-tag, .hljs-name, .hljs-attribute { color: #000080; font-weight: normal; } .hljs-regexp, .hljs-link { color: #009926; } .hljs-symbol, .hljs-bullet { color: #990073; } .hljs-built_in, .hljs-builtin-name { color: #24292e; } .hljs-meta { color: #999; font-weight: bold; } .hljs-meta-keyword { color: #d73a49; } .hljs-meta-string { color: #032f62; } .hljs-deletion { background: #fdd; } .hljs-addition { background: #dfd; } .hljs-emphasis { font-style: italic; } .hljs-strong { font-weight: bold; } .table_tabular table th, .table_tabular table th { border: none !important; padding: 6px 13px; } .tabular tr, .tabular tr { border-top: none !important; border-bottom: none !important; } .tabular td, .tabular td { border-style: none !important; background-color: #fff; border-color: #000 !important; word-break: keep-all; padding: 0.1em 0.5em !important; } .tabular { display: inline-table !important; height: fit-content; } .tabular td > p { margin-bottom: 0; margin-top: 0; } .tabular td._empty { height: 1.3em; } .tabular td .f { opacity: 0; } html[data-theme="dark"] .tabular tr, html[data-theme="dark"] .tabular td { background-color: #202226; border-color: #fff !important; } .table_tabular { overflow-x: auto; padding: 0 2px 0.5em 2px; } .figure_img { margin-bottom: 0.5em; overflow-x: auto; } ol.enumerate, ul.itemize { padding-inline-start: 40px; } /* It's commented because counter not supporting to change value ol.enumerate.lower-alpha { counter-reset: item ; list-style-type: none !important; } .enumerate.lower-alpha > li { position: relative; } .enumerate.lower-alpha > li:before { content: "("counter(item, lower-alpha)")"; counter-increment: item; position: absolute; left: -47px; width: 47px; display: flex; justify-content: flex-end; padding-right: 7px; flex-wrap: nowrap; word-break: keep-all; } */ .itemize > li { position: relative; } .itemize > li > span.li_level, .li_enumerate.not_number > span.li_level { position: absolute; right: 100%; white-space: nowrap; width: max-content;; display: flex; justify-content: flex-end; padding-right: 10px; box-sizing: border-box; } .li_enumerate.not_number { position: relative; display: inline-block; list-style-type: none; } #preview { font-family: 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; font-size: 17px; visibility: visible; word-break: break-word; padding: 2.5em; max-width: 800px; margin: auto; box-sizing: content-box; } #preview h1, #preview h2, #preview h3, #preview h4, #preview h5, #preview strong { font-family: 'CMU Serif Bold', 'Georgia', Helvetica, Arial, sans-serif; } #preview i, #preview em { font-family: 'CMU Serif Italic', 'Georgia', Helvetica, Arial, sans-serif; } .mmd-menu { max-width: 320px; position: absolute; background-color: white; color: black; width: auto; padding: 5px 0px; border: 1px solid #E5E6EB; margin: 0; cursor: default; font: menu; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 5px; -webkit-border-radius: 5px; -moz-border-radius: 5px; -khtml-border-radius: 5px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080; } .mmd-menu:focus { outline: none; } .mmd-menu.mmd-menu-sm { max-width: 100vw; padding-bottom: 34px; border-radius: 0; -webkit-border-radius: 0; -moz-border-radius: 0; -khtml-border-radius: 0; } .mmd-menu-item-icon { color: #1e2029; margin-left: auto; align-items: center; display: flex; flex-shrink: 0; display: none; } .mmd-menu-item { padding-bottom: 8px; padding-top: 8px; padding-left: 1.25rem; padding-right: 1.25rem; display: flex; background: transparent; height: 52px; max-height: 52px; } .mmd-menu-item:focus { outline: none; } .mmd-menu-item.active { background-color: #e1e0e5; } .mmd-menu-item.active .mmd-menu-item-icon { display: flex; } .mmd-menu-item-container { overflow: hidden; } .mmd-menu-item-title { color: #1e2029; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 14px; line-height: 20px; } .mmd-menu-item-value { color: #7d829c; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 12px; line-height: 16px; } html[data-theme="dark"] .mmd-menu-item-title { color: #ebefe7; } html[data-theme="dark"] .mmd-menu-item.active .mmd-menu-item-title { color: #1e2029; } html[data-theme="dark"] .mmd-menu { background-color: #33363a; } .mmd-context-menu-overlay{ background: rgba(0, 0, 0, 0.56); } .ClipboardButton { padding: 0; margin: 0.5rem; display: inline-block; cursor: pointer; color: rgb(36, 41, 47); background: rgb(246, 248, 250); border-radius: 6px; border: 1px solid rgba(31, 35, 40, 0.15); box-shadow: rgba(31, 35, 40, 0.04) 0 1px 0 0, rgba(255, 255, 255, 0.25) 0 1px 0 0 inset; position: relative; } .ClipboardButton:hover { background-color: rgb(243, 244, 246); border-color: rgba(31, 35, 40, 0.15); transition-duration: .1s; } .mmd-clipboard-icon { fill: currentColor; vertical-align: text-bottom; } .mmd-clipboard-copy-icon { color: rgb(101, 109, 118); } .mmd-clipboard-check-icon { color: rgb(26, 127, 55); } .mmd-tooltipped-no-delay:hover::before, .mmd-tooltipped-no-delay:hover::after { animation-delay: 0s; } .mmd-tooltipped:hover::before, .mmd-tooltipped:hover::after { display: inline-block; text-decoration: none; animation-name: tooltip-appear; animation-duration: .1s; animation-fill-mode: forwards; animation-timing-function: ease-in; animation-delay: .4s; } .mmd-tooltipped-w::before { top: 50%; bottom: 50%; left: -7px; margin-top: -6px; border-left-color: rgb(36, 41, 47); } .mmd-tooltipped::before { position: absolute; z-index: 1000001; display: none; width: 0; height: 0; color: rgb(36, 41, 47); pointer-events: none; content: ""; border: 6px solid transparent; opacity: 0; } .mmd-tooltipped-w::after { right: 100%; bottom: 50%; margin-right: 6px; transform: translateY(50%); } .mmd-tooltipped::after { position: absolute; z-index: 1000000; display: none; padding: 0.5em 0.75em; font: normal normal 11px/1.5 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; -webkit-font-smoothing: subpixel-antialiased; color: rgb(255, 255, 255); text-align: center; text-decoration: none; text-shadow: none; text-transform: none; letter-spacing: normal; word-wrap: break-word; white-space: pre; pointer-events: none; content: attr(aria-label); background: rgb(36, 41, 47); border-radius: 6px; opacity: 0; }
Original text
Rate this translation
Your feedback will be used to help improve Google Translate

ON THE CONTINUOUS FRACTIONS OF J. MIKUSINSKI

BY

TIBERIU POPOVICIU
(Cluj)

We give a new proof of the sufficiency of condition (3) of theorem 1 of J. Mikusinski [2]. We also give some other properties of arithmetic continued fractions of the form [ has , b ˙ , 2 has ] [ has , b ˙ , 2 has ] [a,b^(˙),2a][a, \dot{b}, 2 a][has,b˙,2has].
  1. Either c c ccca natural number > 1 > 1 > 1>1>1, different from a square, ( r n ) n = 0 ∞ r n n = 0 ∞ (r_(n))_(n=0)^(oo)\left(r_{n}\right)_{n=0}^{\infty}(rn)n=0∞the continuation of the reductions of the development of c c sqrtc\sqrt{c}cin arithmetic continued fraction and ( x n ) n = 0 ∞ x n n = 0 ∞ (x_(n))_(n=0)^(oo)\left(x_{n}\right)_{n=0}^{\infty}(xn)n=0∞the sequence of approximations of c c sqrtc\sqrt{c}cgiven by the recurrence relation
(1) x n + 1 = 1 2 ( x n + c x n ) , n = 0 , 1 , … , x 0 = [ V c ¯ ] (1) x n + 1 = 1 2 x n + c x n , n = 0 , 1 , … , x 0 = [ V c ¯ ] {:(1)x_(n+1)=(1)/(2)(x_(n)+(c)/(x_(n)))","n=0","1","dots","x_(0)=[V bar(c)]:}\begin{equation*} x_{n+1}=\frac{1}{2}\left(x_{n}+\frac{c}{x_{n}}\right), n=0.1, \ldots, x_{0}=[V \bar{c}] \tag{1} \end{equation*}(1)xn+1=12(xn+cxn),n=0,1,…,x0=[Vc¯]
J. Mikusinski proved [2] the following theorem
Theorem 1. So that we have
(2)
x n = r 2 n − 1 , n = 0 , 1 , … x n = r 2 n − 1 , n = 0 , 1 , … x_(n)=r_(2^(n)-1),n=0,1,dotsx_{n}=r_{2^{n}-1}, n=0,1, \ldotsxn=r2n−1,n=0,1,…
it is necessary and sufficient that the number c be of the form
(3) c = a 2 + 2 a b (3) c = a 2 + 2 a b {:(3)c=a^(2)+(2a)/(b):}\begin{equation*} c=a^{2}+\frac{2 a}{b} \tag{3} \end{equation*}(3)c=has2+2hasb
where a and b b bbbare natural numbers.
J. Mikusinski demonstrated very simply the necessity of the condition and also demonstrated the sufficiency of the condition by noting that then the continued fraction of c c sqrtc\sqrt{c}cis of the form [ a , b ˙ , 2 ˙ a ] [ a , b ˙ , 2 ˙ a ] [a,b^(˙),2^(˙)a][a, \dot{b}, \dot{2} a][has,b˙,2˙has]. In the following we will first give a slightly different demonstration of the sufficiency of condition (3).
Natural numbers c c cccof the form (3) are characterized by the property that if a = [ c ] a = [ c ] a=[sqrtc]a=[\sqrt{c}]has=[c], the number 2 a 2 a 2a2 a2hasis divisible by c − a 2 c − a 2 c-a^(2)c-a^{2}c−has2.
REV. ROUM. MATH. PURES ET APPL., VOLUME XIII, NO. 1, p. 79-83, BUCHAREST, 1968
2. Let us denote by r n = P n Q n , n = 0 , 1 , … r n = P n Q n , n = 0 , 1 , … r_(n)=(P_(n))/(Q_(n)),n=0,1,dotsr_{n}=\frac{P_{n}}{Q_{n}}, n=0,1, \ldotsrn=PnQn,n=0,1,…, the reductions of the periodic arithmetic continued fraction [ a , b ˙ , 2 ˙ a ] [ a , b ˙ , 2 ˙ a ] [a,b^(˙),2^(˙)a][a, \dot{b}, \dot{2} a][has,b˙,2˙has]. The sequels ( P n ) , ( Q n ) P n , Q n (P_(n)),(Q_(n))\left(P_{n}\right),\left(Q_{n}\right)(Pn),(Qn)are solutions ( u n ) n = 0 ∞ u n n = 0 ∞ (u_(n))_(n=0)^(oo)\left(u_{n}\right)_{n=0}^{\infty}(un)n=0∞of the system of recurrent equations
(4) { u 2 n = 2 a u 2 n − 1 + u 2 n − 2 u 2 n + 1 = b u 2 n + u 2 n − 1 n = 1 , 2 , … (4) u 2 n = 2 a u 2 n − 1 + u 2 n − 2 u 2 n + 1 = b u 2 n + u 2 n − 1 n = 1 , 2 , … {:(4){[u_(2n)=2au_(2n-1)+u_(2n-2)],[u_(2n+1)=bu_(2n)+u_(2n-1)]quad n=1,2,dots:}:}\left\{\begin{array}{l} u_{2 n}=2 a u_{2 n-1}+u_{2 n-2} \tag{4}\\ u_{2 n+1}=b u_{2 n}+u_{2 n-1} \end{array} \quad n=1,2, \ldots\right.(4){u2n=2hasu2n−1+u2n−2u2n+1=bu2n+u2n−1n=1,2,…
with the initial values ​​respectively P 0 = a , P 1 = a b + 1 ; Q 0 = 1 P 0 = a , P 1 = a b + 1 ; Q 0 = 1 P_(0)=a,P_(1)=ab+1;Q_(0)=1P_{0}=a, P_{1}=a b+1 ; Q_{0}=1P0=has,P1=hasb+1;Q0=1, Q 1 = b Q 1 = b Q_(1)=bQ_{1}=bQ1=b.
But if ( u n ) n = 0 ∞ u n n = 0 ∞ (u_(n))_(n=0)^(oo)\left(u_{n}\right)_{n=0}^{\infty}(un)n=0∞is a solution of the system (4), the partial sequences ( u 2 n ) n = 0 ∞ , ( u 2 n + 1 ) n = 0 ∞ u 2 n n = 0 ∞ , u 2 n + 1 n = 0 ∞ (u_(2n))_(n=0)^(oo),(u_(2n+1))_(n=0)^(oo)\left(u_{2 n}\right)_{n=0}^{\infty},\left(u_{2 n+1}\right)_{n=0}^{\infty}(u2n)n=0∞,(u2n+1)n=0∞are solutions ( v n v n v_(n)v_{n}vn) of the recurrence equation
(5) v n = ( 2 a b + 2 ) v n − 1 − v n − 2 , n = 2 , 3 , … (5) v n = ( 2 a b + 2 ) v n − 1 − v n − 2 , n = 2 , 3 , … {:(5)v_(n)=(2ab+2)v_(n-1)-v_(n-2)","n=2","3","dots:}\begin{equation*} v_{n}=(2 a b+2) v_{n-1}-v_{n-2}, n=2,3, \ldots \tag{5} \end{equation*}(5)vn=(2hasb+2)vn−1−vn−2,n=2,3,…
According to the well-known theory of equations of this form we have v n = A x n + B y n , n = 0 , 1 , … v n = A x n + B y n , n = 0 , 1 , … v_(n)=Ax^(n)+By^(n),n=0,1,dotsv_{n}=A x^{n}+B y^{n}, n=0,1, \ldotsvn=HASxn+Byn,n=0,1,…, Or x , y x , y x,yx, yx,yare the roots of the characteristic equation z 2 − ( 2 a b + 2 ) z + 1 = 0 z 2 − ( 2 a b + 2 ) z + 1 = 0 z^(2)-(2ab+2)z+1=0z^{2}-(2 a b+2) z+1=0z2−(2hasb+2)z+1=0And A , B A , B A,BA, BHAS,Bare independent of n n nnn.
If we take into account (3) we have
x = a b + 1 + b c = b 2 a ξ 2 , y = a b + 1 − b c = b 2 a η 2 x = a b + 1 + b c = b 2 a ξ 2 , y = a b + 1 − b c = b 2 a η 2 x=ab+1+bsqrtc=(b)/(2a)xi^(2),y=ab+1-bsqrtc=(b)/(2a)eta^(2)x=a b+1+b \sqrt{c}=\frac{b}{2 a} \xi^{2}, y=a b+1-b \sqrt{c}=\frac{b}{2 a} \eta^{2}x=hasb+1+bc=b2hasξ2,y=hasb+1−bc=b2hasη2
Or ξ = a + c , η = a − c ξ = a + c , η = a − c xi=a+sqrtc,eta=a-sqrtc\xi=a+\sqrt{c}, \eta=a-\sqrt{c}ξ=has+c,η=has−c. So we have
(6) v n = ( b 2 a ) n ( A ξ 2 n + B η 2 n ) , n = 0 , 1 , … (6) v n = b 2 a n A ξ 2 n + B η 2 n , n = 0 , 1 , … {:(6)v_(n)=((b)/(2a))^(n)(Axi^(2n)+Beta^(2n))","n=0","1","dots:}\begin{equation*} v_{n}=\left(\frac{b}{2 a}\right)^{n}\left(A \xi^{2 n}+B \eta^{2 n}\right), n=0,1, \ldots \tag{6} \end{equation*}(6)vn=(b2has)n(HASξ2n+Bη2n),n=0,1,…
To get the suites ( P n ) , ( Q n ) P n , Q n (P_(n)),(Q_(n))\left(P_{n}\right),\left(Q_{n}\right)(Pn),(Qn)we determine the partial sequences ( P 2 n ) n = 0 ∞ , ( P 2 n + 1 ) n = 0 ∞ , ( Q 2 n ) n = 0 ∞ , ( Q 2 n + 1 ) n = 0 ∞ P 2 n n = 0 ∞ , P 2 n + 1 n = 0 ∞ , Q 2 n n = 0 ∞ , Q 2 n + 1 n = 0 ∞ (P_(2n))_(n=0)^(oo),(P_(2n+1))_(n=0)^(oo),(Q_(2n))_(n=0)^(oo),(Q_(2n+1))_(n=0)^(oo)\left(P_{2 n}\right)_{n=0}^{\infty},\left(P_{2 n+1}\right)_{n=0}^{\infty},\left(Q_{2 n}\right)_{n=0}^{\infty},\left(Q_{2 n+1}\right)_{n=0}^{\infty}(P2n)n=0∞,(P2n+1)n=0∞,(Q2n)n=0∞,(Q2n+1)n=0∞, using formulas (6), taking into account the initial values ​​respectively P 0 = a , P 2 = 2 a 2 b + 3 a P 0 = a , P 2 = 2 a 2 b + 3 a P_(0)=a,P_(2)=2a^(2)b+3aP_{0}=a, P_{2}=2 a^{2} b+3 aP0=has,P2=2has2b+3has; P 1 = a b + 1 , P 3 = 2 a 2 b 2 + 4 a b + 1 ; Q 0 = 1 , Q 2 = 2 a b + 1 ; Q 1 = b P 1 = a b + 1 , P 3 = 2 a 2 b 2 + 4 a b + 1 ; Q 0 = 1 , Q 2 = 2 a b + 1 ; Q 1 = b P_(1)=ab+1,P_(3)=2a^(2)b^(2)+4ab+1;Q_(0)=1,Q_(2)=2ab+1;Q_(1)=bP_{1}=a b+1, P_{3}=2 a^{2} b^{2}+4 a b+1 ; Q_{0}=1, Q_{2}=2 a b+1 ; Q_{1}=bP1=hasb+1,P3=2has2b2+4hasb+1;Q0=1,Q2=2hasb+1;Q1=b, Q 3 = 2 a b 2 + 2 b Q 3 = 2 a b 2 + 2 b Q_(3)=2ab^(2)+2bQ_{3}=2 a b^{2}+2 bQ3=2hasb2+2b. In each of these cases these initial values ​​determine the coefficients A , B A , B A,BA, BHAS,Bcorrespondents.
By doing the calculations, we find thus
(7) { P n = 1 2 ( b 2 a ) [ n + 1 2 ] ( ξ n + 1 + η n + 1 ) Q n = 1 2 c ( b 2 a ) [ n + 1 2 ] ( ξ n + 1 − η n + 1 ) n = 0 , 1 , … (7) P n = 1 2 b 2 a n + 1 2 ξ n + 1 + η n + 1 Q n = 1 2 c b 2 a n + 1 2 ξ n + 1 − η n + 1 n = 0 , 1 , … {:(7){[P_(n)=(1)/(2)((b)/(2a))^([(n+1)/(2)])(xi^(n+1)+eta^(n+1))],[Q_(n)=(1)/(2sqrtc)((b)/(2a))^([(n+1)/(2)])(xi^(n+1)-eta^(n+1))]quad n=0,1,dots:}:}\left\{\begin{array}{l} P_{n}=\frac{1}{2}\left(\frac{b}{2 a}\right)^{\left[\frac{n+1}{2}\right]}\left(\xi^{n+1}+\eta^{n+1}\right) \tag{7}\\ Q_{n}=\frac{1}{2 \sqrt{c}}\left(\frac{b}{2 a}\right)^{\left[\frac{n+1}{2}\right]}\left(\xi^{n+1}-\eta^{n+1}\right) \end{array} \quad n=0,1, \ldots\right.(7){Pn=12(b2has)[n+12](ξn+1+ηn+1)Qn=12c(b2has)[n+12](ξn+1−ηn+1)n=0,1,…
It is clear that these formulas are valid in general if a , b , c a , b , c a,b,ca, b, chas,b,care non-zero numbers such that c b = a 2 b + 2 a c b = a 2 b + 2 a cb=a^(2)b+2ac b=a^{2} b+2 acb=has2b+2has.
The reduction of a system of the form (4) to an equation of the type (5) was made by Th. Angheluță [1].
3. Returning to our problem, consider the recurrence relation (1). We have
x n − c x n + c = ( x n − 1 − c x n − 1 + c ) 2 , n = 1 , 2 , … , x 0 = a x n − c x n + c = x n − 1 − c x n − 1 + c 2 , n = 1 , 2 , … , x 0 = a (x_(n)-sqrtc)/(x_(n)+sqrtc)=((x_(n-1)-sqrtc)/(x_(n-1)+sqrtc))^(2),n=1,2,dots,x_(0)=a\frac{x_{n}-\sqrt{c}}{x_{n}+\sqrt{c}}=\left(\frac{x_{n-1}-\sqrt{c}}{x_{n-1}+\sqrt{c}}\right)^{2}, n=1,2, \ldots, x_{0}=axn−cxn+c=(xn−1−cxn−1+c)2,n=1,2,…,x0=has
from which it follows that
(8) x n − c x n + c = ( η ξ ) 2 n , n = 0 , 1 , … (8) x n − c x n + c = η ξ 2 n , n = 0 , 1 , … {:(8)(x_(n)-sqrtc)/(x_(n)+sqrtc)=((eta )/(xi))^(2^(n))","n=0","1","dots:}\begin{equation*} \frac{x_{n}-\sqrt{c}}{x_{n}+\sqrt{c}}=\left(\frac{\eta}{\xi}\right)^{2^{n}}, n=0,1, \ldots \tag{8} \end{equation*}(8)xn−cxn+c=(ηξ)2n,n=0,1,…
where well
(9) x n = c ξ 2 n + η 2 n ξ 2 n − η 2 n , n = 0 , 1 , … (9) x n = c ξ 2 n + η 2 n ξ 2 n − η 2 n , n = 0 , 1 , … {:(9)x_(n)=sqrtc(xi^(2^(n))+eta^(2^(n)))/(xi^(2^(n))-eta^(2^(n)))","n=0","1","dots:}\begin{equation*} x_{n}=\sqrt{c} \frac{\xi^{2^{n}}+\eta^{2^{n}}}{\xi^{2^{n}}-\eta^{2^{n}}}, n=0,1, \ldots \tag{9} \end{equation*}(9)xn=cξ2n+η2nξ2n−η2n,n=0,1,…
But, from (7) it follows that
r n = c ξ n + 1 + η n + 1 ξ n + 1 − η n + 1 , n = 0 , 1 , … r n = c ξ n + 1 + η n + 1 ξ n + 1 − η n + 1 , n = 0 , 1 , … r_(n)=sqrtc(xi^(n+1)+eta^(n+1))/(xi^(n+1)-eta^(n+1)),n=0,1,dotsr_{n}=\sqrt{c} \frac{\xi^{n+1}+\eta^{n+1}}{\xi^{n+1}-\eta^{n+1}}, n=0,1, \ldotsrn=cξn+1+ηn+1ξn+1−ηn+1,n=0,1,…
from which equality (2) follows immediately.
4. Noting that | η | < ξ | η | < ξ |eta| < xi|\eta|<\xi|η|<ξ, formula (8) shows us that the sequence ( x n x n x_(n)x_{n}xn) converges to c c sqrtc\sqrt{c}c. But we can approximate c c sqrtc\sqrt{c}cby other iterative sequences. Such a sequence ( y n ) n = 0 ∞ y n n = 0 ∞ (y_(n))_(n=0)^(oo)\left(y_{n}\right)_{n=0}^{\infty}(yn)n=0∞is determined by the recurrence relation
(10) y n + 1 = α y n + c y n + α , n = 0 , 1 , … (10) y n + 1 = α y n + c y n + α , n = 0 , 1 , … {:(10)y_(n+1)=(alphay_(n)+c)/(y_(n)+alpha)","n=0","1","dots:}\begin{equation*} y_{n+1}=\frac{\alpha y_{n}+c}{y_{n}+\alpha}, n=0,1, \ldots \tag{10} \end{equation*}(10)yn+1=αyn+cyn+α,n=0,1,…
where we assume that y 0 > 0 y 0 > 0 y_(0) > 0y_{0}>0y0>0and that α α alpha\alphaαis a positive rational number. By limiting ourselves only to rational approximations of c c sqrtc\sqrt{c}c, the case of α α alpha\alphaαpositive and irrational is of no interest.
All terms of the sequence ( y n y n y_(n)y_{n}yn) are positive and we have
y n + 1 − c y n + 1 + c = α − c α + c ⋅ y n − c y n + c , n = 0 , 1 , … y n + 1 − c y n + 1 + c = α − c α + c ⋅ y n − c y n + c , n = 0 , 1 , … (y_(n+1)-sqrtc)/(y_(n+1)+sqrtc)=(alpha-sqrtc)/(alpha+sqrtc)*(y_(n)-sqrtc)/(y_(n)+sqrtc),n=0,1,dots\frac{y_{n+1}-\sqrt{c}}{y_{n+1}+\sqrt{c}}=\frac{\alpha-\sqrt{c}}{\alpha+\sqrt{c}} \cdot \frac{y_{n}-\sqrt{c}}{y_{n}+\sqrt{c}}, n=0,1, \ldotsyn+1−cyn+1+c=α−cα+c⋅yn−cyn+c,n=0,1,…
from where
(11) y n − c y n + c = ( α − c α + c ) n ⋅ y 0 − c y 0 + c , n = 0 , 1 , … (11) y n − c y n + c = α − c α + c n ⋅ y 0 − c y 0 + c , n = 0 , 1 , … {:(11)(y_(n)-sqrtc)/(y_(n)+sqrtc)=((alpha-sqrtc)/(alpha+sqrtc))^(n)*(y_(0)-sqrtc)/(y_(0)+sqrtc)","n=0","1","dots:}\begin{equation*} \frac{y_{n}-\sqrt{c}}{y_{n}+\sqrt{c}}=\left(\frac{\alpha-\sqrt{c}}{\alpha+\sqrt{c}}\right)^{n} \cdot \frac{y_{0}-\sqrt{c}}{y_{0}+\sqrt{c}}, n=0,1, \ldots \tag{11} \end{equation*}(11)yn−cyn+c=(α−cα+c)n⋅y0−cy0+c,n=0,1,…
and, since | α − c α + c | < 1 α − c α + c < 1 |(alpha-sqrtc)/(alpha+sqrtc)| < 1\left|\frac{\alpha-\sqrt{c}}{\alpha+\sqrt{c}}\right|<1|α−cα+c|<1, it follows that the sequence ( y n y n y_(n)y_{n}yn) converges to c c sqrtc\sqrt{c}c.
The convergence of the sequence ( x n x n x_(n)x_{n}xn) towards c c sqrtc\sqrt{c}cis of order 2 while that of the sequence ( y n ) y n (y_(n))\left(y_{n}\right)(yn)only of order 1.
Let's suppose that α = y 0 = [ o ¯ ] = a α = y 0 = [ o ¯ ] = a alpha=y_(0)=[sqrt() bar(o)]=a\alpha=y_{0}=[\sqrt{ } \bar{o}]=aα=y0=[o¯]=has, then from (11) it follows that
y n = c ξ n + 1 + η n + 1 ξ n + 1 − η n + 1 , n = 0 , 1 , … y n = c ξ n + 1 + η n + 1 ξ n + 1 − η n + 1 , n = 0 , 1 , … y_(n)=sqrtc(xi^(n+1)+eta^(n+1))/(xi^(n+1)-eta^(n+1)),n=0,1,dotsy_{n}=\sqrt{c} \frac{\xi^{n+1}+\eta^{n+1}}{\xi^{n+1}-\eta^{n+1}}, n=0,1, \ldotsyn=cξn+1+ηn+1ξn+1−ηn+1,n=0,1,…
continuing to pose ξ = a + c , η = a − c ξ = a + c , η = a − c xi=a+sqrtc,eta=a-sqrtc\xi=a+\sqrt{c}, \eta=a-\sqrt{c}ξ=has+c,η=has−c.
This formula shows us that if the number c c cccis of the form (3) and if α = y 0 = a α = y 0 = a alpha=y_(0)=a\alpha=y_{0}=aα=y0=has, we have
(12)
y n = r n , n = 0 , 1 , … y n = r n , n = 0 , 1 , … y_(n)=r_(n),n=0,1,dotsy_{n}=r_{n}, n=0,1, \ldotsyn=rn,n=0,1,…
so that the recurrence relation (10), with the initial condition y 0 = [ c ] y 0 = [ c ] y_(0)=[sqrtc]y_{0}=[\sqrt{c}]y0=[c], gives us precisely the sequence of reductions of the arithmetic continued fraction of c c sqrtc\sqrt{c}c.
5. Let us now propose to determine the natural number c c ccc(non-square) and the rational number (positive) α α alpha\alphaαso that the recurrence relation (10) gives precisely the sequence of reductions ( r n ) n = 0 ∞ r n n = 0 ∞ (r_(n))_(n=0)^(oo)\left(r_{n}\right)_{n=0}^{\infty}(rn)n=0∞of the arithmetic continued fraction of V c ¯ V c ¯ V bar(c)V \bar{c}Vc¯.
For this we designate by a = [ c ] a = [ c ] a=[sqrtc]a=[\sqrt{c}]has=[c]and let's ask c = a 2 + k c = a 2 + k c=a^(2)+kc=a^{2}+kc=has2+k. If [ a , b , d , e , … ] [ a , b , d , e , … ] [a,b,d,e,dots][a, b, d, e, \ldots][has,b,d,e,…]is the arithmetic continued fraction of c c sqrtc\sqrt{c}cAnd r 0 , r 1 , r 2 , r 3 , … r 0 , r 1 , r 2 , r 3 , … r_(0),r_(1),r_(2),r_(3),dotsr_{0}, r_{1}, r_{2}, r_{3}, \ldotsr0,r1,r2,r3,…, are its successive reductions, of
r 1 = a b + 1 b = a + 1 b = α a + a 2 + k a + α r 1 = a b + 1 b = a + 1 b = α a + a 2 + k a + α r_(1)=(ab+1)/(b)=a+(1)/(b)=(alpha a+a^(2)+k)/(a+alpha)r_{1}=\frac{a b+1}{b}=a+\frac{1}{b}=\frac{\alpha a+a^{2}+k}{a+\alpha}r1=hasb+1b=has+1b=αhas+has2+khas+α
it results
(13)
b = a + α k b = a + α k b=(a+alpha)/(k)b=\frac{a+\alpha}{k}b=has+αk
Of
r 2 = a b d + a + d b d + 1 = a + 1 b + 1 d = α ( a b + 1 ) + b ( a 2 + k ) a b + 1 + α b r 2 = a b d + a + d b d + 1 = a + 1 b + 1 d = α ( a b + 1 ) + b a 2 + k a b + 1 + α b r_(2)=(abd+a+d)/(bd+1)=a+(1)/(b+(1)/(d))=(alpha(ab+1)+b(a^(2)+k))/(ab+1+alpha b)r_{2}=\frac{a b d+a+d}{b d+1}=a+\frac{1}{b+\frac{1}{d}}=\frac{\alpha(a b+1)+b\left(a^{2}+k\right)}{a b+1+\alpha b}r2=hasbd+has+dbd+1=has+1b+1d=α(hasb+1)+b(has2+k)hasb+1+αb
it results
(14)
d = α − a + k b 2 a b + 1 − k b 2 d = α − a + k b 2 a b + 1 − k b 2 d=(alpha-a+kb)/(2ab+1-kb^(2))d=\frac{\alpha-a+k b}{2 a b+1-k b^{2}}d=α−has+kb2hasb+1−kb2
At the end of
v 3 = a + 1 b + 1 d + 1 e = a ( a b d + a + d ) + ( b d + 1 ) ( a 2 + k ) a b d + a + d + α ( b d + 1 ) v 3 = a + 1 b + 1 d + 1 e = a ( a b d + a + d ) + ( b d + 1 ) a 2 + k a b d + a + d + α ( b d + 1 ) v_(3)=a+(1)/(b+(1)/(d+(1)/(e)))=(a(abd+a+d)+(bd+1)(a^(2)+k))/(abd+a+d+alpha(bd+1))v_{3}=a+\frac{1}{b+\frac{1}{d+\frac{1}{e}}}=\frac{a(a b d+a+d)+(b d+1)\left(a^{2}+k\right)}{a b d+a+d+\alpha(b d+1)}v3=has+1b+1d+1e=has(hasbd+has+d)+(bd+1)(has2+k)hasbd+has+d+α(bd+1)
taking into account (13) and (14), we deduce
(15) e = 2 α k (15) e = 2 α k {:(15)e=(2alpha)/(k):}\begin{equation*} e=\frac{2 \alpha}{k} \tag{15} \end{equation*}(15)e=2αk
But the numbers b , e b , e b,eb, eb,eare integers (positive), it therefore follows that 2 b − e = 2 a k 2 b − e = 2 a k 2b-e=(2a)/(k)2 b-e=\frac{2 a}{k}2b−e=2haskis also whole. It follows that 2 a 2 a 2a2 a2hasis divisible by k k kkk, so that the number c c cccis of the form (3). In this case e = b e = b e=be=be=b, SO α = a α = a alpha=a\alpha=aα=has.
So we have the property expressed by
Theorem 2. For the y n , n = 0 , 1 , … y n , n = 0 , 1 , … y_(n),n=0,1,dotsy_{n}, n=0,1, \ldotsyn,n=0,1,…, given by the recurrence relation (10), where c is a natural number (not square) and a is a positive rational number, are the successive reductions of the arithmetic continued fraction of c c sqrtc\sqrt{c}c, it is necessary and sufficient that it be of the form (3) and that α = [ c ] = a α = [ c ] = a alpha=[sqrtc]=a\alpha=[\sqrt{c}]=aα=[c]=has.
6. Note that if c c cccis any positive number and if we have (1), with x 0 > 0 x 0 > 0 x_(0) > 0x_{0}>0x0>0, it results
x n − c x n + c = ( x 0 − c x 0 + c ) 2 n , n = 0 , 1 , … x n − c x n + c = x 0 − c x 0 + c 2 n , n = 0 , 1 , … (x_(n)-sqrtc)/(x_(n)+sqrtc)=((x_(0)-sqrtc)/(x_(0)+sqrtc))^(2^(n)),n=0,1,dots\frac{x_{n}-\sqrt{c}}{x_{n}+\sqrt{c}}=\left(\frac{x_{0}-\sqrt{c}}{x_{0}+\sqrt{c}}\right)^{2^{n}}, n=0,1, \ldotsxn−cxn+c=(x0−cx0+c)2n,n=0,1,…
Taking into account also formula (11), we see that we can state the
Theorem 3. If e and a are positive numbers and if the sequences ( x n ) n = 0 ∞ x n n = 0 ∞ (x_(n))_(n=0)^(oo)\left(x_{n}\right)_{n=0}^{\infty}(xn)n=0∞, ( y n ) n = 0 ∞ y n n = 0 ∞ (y_(n))_(n=0)^(oo)\left(y_{n}\right)_{n=0}^{\infty}(yn)n=0∞are given by the recurrence relations (1), (10), with the initial values x 0 = y 0 = α x 0 = y 0 = α x_(0)=y_(0)=alphax_{0}=y_{0}=\alphax0=y0=α:
1 ∘ 1 ∘ 1^(@)1^{\circ}1∘They converge towards c c sqrtc\sqrt{c}c.
2 ∘ 2 ∘ 2^(@)2^{\circ}2∘We have x n = y 2 n − 1 , n = 0 , 1 , … x n = y 2 n − 1 , n = 0 , 1 , … x_(n)=y_(2^(n)-1),n=0,1,dotsx_{n}=y_{2^{n}-1}, n=0,1, \ldotsxn=y2n−1,n=0,1,…
Received on May 3, 1967
Institute of Calculation
Academy of the Socialist Republic of Romania, Cluj Branch

BIBLIOGRAPHY

  1. Angheluță, Th. Integration of a class of linear equations with finite differences. Bulletin of the Soc. of Sciences of Cluj, Vol. III (1926), 94-104.
  2. Mikusinski, J. On Newton's method of approximation. Annales Polon. Math., I (1954), 184-194.

google scholar link

1968

Related Posts