An Algorithmic Approach to Kulkarni’s Qnestion
Received:February 23, 1994  Revised:November 01, 1994
Key Words: under approximation   unit fraction   integer sequence.  
Fund Project:
Author NameAffiliation
Yu Hongquan Inst. of Math. Scis.
Dalian Univ.of Tech. 
He Mingfeng Dept. of APPl. Math.
Dalian Univ. of Tech. 
Hits: 1976
Download times: 968
Abstract:
      We give a algorithmic proof to a known result concerning the best underapproximation of unit fraction by sums of unit fractions. This method suggests coun-ter example to a conjecture of similar feature.
Citation:
DOI:10.3770/j.issn:1000-341X.1995.02.002
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.