| 摘要: |
| 运用递推序列法,给出组合数丢番图方程(2x)=(4y)的一个初等解法. |
| 关键词: 丢番图方程 递推序列 初等解法 |
| DOI： |
| 投稿时间：2003-07-02修订日期：2003-07-24 |
| 基金项目: |
|
| The Solution of Binomial Diophantine Equation[2x]=[4y] |
|
Li Jinxiang, Cao Dunqian
|
| (Department of Math, Guangxi Univ for Nationalities, Nanning, Guangxi, 530006, China) |
| Abstract: |
| An elementary proof of the Diophantine equation (2x)=(4y) is given by using recursion sequence method. |
| Key words: Diophantine equation recusion sequence method elementary proof |
