Refining of the comparison rule for continuants
Diskretnaya Matematika, Tome 12 (2000) no. 3, pp. 72-75.

Voir la notice de l'article provenant de la source Math-Net.Ru

We prove a theorem, which allow us to compare in some cases the values of continuants of denominators of finite continued fractions without their calculation.
@article{DM_2000_12_3_a4,
     author = {I. D. Kan},
     title = {Refining of the comparison rule for continuants},
     journal = {Diskretnaya Matematika},
     pages = {72--75},
     publisher = {mathdoc},
     volume = {12},
     number = {3},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2000_12_3_a4/}
}
TY  - JOUR
AU  - I. D. Kan
TI  - Refining of the comparison rule for continuants
JO  - Diskretnaya Matematika
PY  - 2000
SP  - 72
EP  - 75
VL  - 12
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2000_12_3_a4/
LA  - ru
ID  - DM_2000_12_3_a4
ER  - 
%0 Journal Article
%A I. D. Kan
%T Refining of the comparison rule for continuants
%J Diskretnaya Matematika
%D 2000
%P 72-75
%V 12
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2000_12_3_a4/
%G ru
%F DM_2000_12_3_a4
I. D. Kan. Refining of the comparison rule for continuants. Diskretnaya Matematika, Tome 12 (2000) no. 3, pp. 72-75. http://geodesic.mathdoc.fr/item/DM_2000_12_3_a4/

[1] Khinchin A. Ya., Tsepnye drobi, Fizmatgiz, Moskva, 1961 | MR

[2] Eulero L., “Specimen algorithmi singularis”, Opera Omnia, 15 (1762), 31–49

[3] Grekhem R., Knut D., Patashnik O., Konkretnaya matematika. Osnovanie informatiki, Mir, Moskva, 1998

[4] Motzkin T. S., Straus E. G., “Some combinatorial extremum problems”, Proc. Amer. Math. Soc., 7, 1956, 1014–1021 | MR