infinite recursive

In this paper,we use Fermat method of infinite descent which shows that the Diophantine equations x 3±y 6=z 2 has no positive integer solutions when (x,y)=1 and y>1.

利用Fermat无穷递降法 ,证明了丢番图方程x3 ±y6=z2 ,(x ,y) =1仅有整数解 2 3 +16=32 。

We use elementary theory of number and Fermat method of infinite descent,some necessary conditions if the Diophantine equations x 4+mx 2y 2+ny 4=z 2 has positive integer solutions that fit (x,y) =1m.

利用Fermat无穷递降法 ,证明了方程x4 +mx2 y2 +ny4 =z2 在 (m ,n) =(± 18,5 4 ) ,(36 ,- 10 8) ,(± 36 ,10 8) ,(± 18,- 10 8) ,(- 18,10 8) ,(± 36 ,75 6 )时均无正整数解 ,并且获得了方程在 (m ,n) =(± 6 ,-2 4 ) ,(± 12 ,132 ) ,(- 36 ,- 10 8) ,(18,10 8)时无穷多组正整数解的通解公式 。

We make use elementary theory of number and Fermat method of infinite descent,somenecessary conditions if the diophantine equations x 4+mx 2y 2+ny 4=z 2 has positive Integer solutions that fir (x,y) =1

Fermat无穷递降法 ,证明了方程x4 +mx2 +ny4 =z2 =z2 在 (m ,n) =± (6,-3 3 ) ,(6,3 3 ) ,(-3 ,-6) ,(± 1 2 ,1 68) ,(-6,-1 2 ) ,(1 2 ,84)均无正整数解 ,并且获得了方程在 (-3 ,6) ,(6,-1 5 ) ,(± 3 ,-3 )时的无穷多组正整数解的通解公式 ,从而完善了Aubry等人的结

With the help of the elementary theory of number and Fermat method of infinite descent,some necessary conditions have been proved provided that the Diophantine equations x 4+mx 2y 2+ny 4=z 2 has positive Integer solutions that fit (x,y) =1 m.

利用数论方法及Fermat无穷递降法 ,证明了丢番图方程x4 +mx2 y2 +ny4 =z2 在 (m ,n) =(± 6,-3 ) ,(6,3 ) ,(± 3 ,3 ) ,(-12 ,2 4) ,(± 12 ,-2 4) ,(± 6,15 ) ,(-6,-15 ) ,(3 ,6)仅有平凡整数解 ,并且获得了方程在 (-6,3 ) ,(12 ,2 4) ,(3 ,-6) ,(-6,3 3 )时的无穷多组正整数解的通解公式 ,从而完善了Aubry等人的结

Infinite recursion detected during execution of calculated member %1.

在执行计算成员 %1 的过程中检测到无限递归。

Infinite recursion detected during execution of calculated cell formula %1 at pass %2.

在传递 %2 上计算单元公式 %1 的执行过程中检测到无限递归。

Cannot use an input macro to resolve anything about the input file as this causes infinite recursion.

不能使用输入宏解析有关输入文件的任何信息，因为这将导致无限递归。

Thus, the file system must not generate additional page faults because this may lead to an "infinite" recursion.

因此，文件系统一定必要产生附加的页面错误，因为这将导致无限递归调用。

Use Recursive Analysis and Database in ASP.NET2.0 to Achieve Infinite Tree

ASP.NET2.0中结合数据库通过递归算法实现无限层次的树状导航栏

Trace Representation and Period of Linear Recurring Sequences over Finite Fields

有限域上线性递归序列的迹表示与周期

The Property of the Width of a Codeword and Its Resursive Algorithms on the Finite Ring Z_4

有限环Z_k上码字的广度性质及两种递归算法

Cannot call constructor recursively (directly or indirectly)

无法以直接或间接方式递归调用构造函数

Computing Acyclic Direct Network Reliability Based on First Depth Search

一个计算无圈有向网络可靠性的递归公式

Hyperspectral image lossless compression based on optimal recursive bidirectional prediction

最佳递归双向预测的高光谱图像无损压缩

A Code-matched Interleaver Design Based On The Low-bound of RSC Parity Weight

一种基于递归系统卷积码校验重量下限的匹配交织器设计方法

Recursive TimeOuts is the total number of recursive query sending timeouts.

递归超时是指递归查询发送超时总数。

The Application of Recursion and the Design of the Gray Code Generation;

递归调用和Gray码生成的双递归设计

A Effective Way to Describle Recurrent Algorithm－Recurrent Tree;

描述递归算法的有效工具──递归树

Diagonal Recurrent Neural Network Sensorless Control of Permanent Magnet Synchronous Motor;

基于对角递归神经网络永磁同步电机无传感器控制研究

Global Periodic Attractor of Infinite Internal Static Neural Networks with S-type Distributed Time Delays

无穷区间上S分布时滞静态递归神经网络模型的全局周期吸引子

Confirmation of Universal Generalizations and Inductive Probability Logic;

“无限全称命题概率为0”问题与归纳概率逻辑

The peoples can only recursive to cognition that the things of non-recursive structure or non-recursive nature.

对于非递归结构或非递归性质的事物,人只能做递归性的认知。