δ-Combinatorial Counting Method Concerning Solutions of Diophantine Equations and Some Applications
Received:May 26, 1997  
Key Words: arithmetic equation   δ-combinatorial counting method   combinatorial identity.  
Fund Project:
Author NameAffiliation
YIN Dong-sheng Dept. of Math.
Beijing Normal University
Beijing
China 
SHEN Fu-xing Dept. of Math.
Beijing Normal University
Beijing
China 
Hits: 2257
Download times: 854
Abstract:
      L. Hsu and Peter Shiue' δ-combinatorial counting method can be used to produce fomulas for the numbers of solutions of arithmetic equations, some combinatorial identities as well as certain inequalities.
Citation:
DOI:10.3770/j.issn:1000-341X.2000.04.011
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.