A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set

K. A. Germina; R. Sebastian

首页> 外文期刊>International mathematical forum >A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set

【24h】

A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set

机译：关于整数算术的猜想，这意味着有一个算法可以为每个Diophantine方程分配一个整数，该整数要大于整数（非负整数，有理数）解的高度（如果这些解形成有限集）

获取原文

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

页面导航

著录项
相似文献
相关主题

著录项

来源
《International mathematical forum》 |2013年第4期|共8页
作者
K. A. Germina; R. Sebastian;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种
中图分类数学;
关键词
入库时间 2022-08-18 10:20:14

相似文献

外文文献
中文文献
专利

1. A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set [J] . K. A. Germina, R. Sebastian International mathematical forum . 2013,第1a4期

机译：关于整数算术的猜想，这意味着有一个算法可以为每个Diophantine方程分配一个整数，该整数要大于整数（非负整数，有理数）解的高度（如果这些解形成有限集）
2. Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set? [J] . Apoloniusz Tyszka Fundamenta Informaticae . 2013,第1期

机译：如果这些解形成有限集，是否存在一种算法，可以为每个Diophantine方程分配一个大于整数解模数的整数？
3. AN ALGORITHM FOR CONSTRUCTING THE BASIS OF THE SOLUTION SET FOR SYSTEMS OF LINEAR DIOPHANTINE EQUATIONS OVER THE RING OF INTEGERS [J] . S. L. Kryvyi Cybemetics and Systems Analysis . 2009,第6期

机译：构造整数环上的Dophantine方程组系统解集的基础的算法
4. The Positive Integer Solutions of a Diophantine Equation [C] . Yi Wu, Zhengping Zhang International Conference on Mechatronics Engineering and Modern Technologies in Industrial Engineering . 2015

机译：衍生十一方程的正整数解
5. On integer solutions to systems of linear equations. [D] . Griffiths, William George, IV. 2004

机译：关于线性方程组的整数解。
6. On the Approximate Solutions in Integers of a Set of Linear Equations [O] . H. F. Blichfeldt 1921

机译：关于一组线性方程的整数的近似解
7. Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite? [O] . Tyszka, Apoloniusz 2014

机译：是否存在一个算法，将Diophantine方程作为输入，返回一个整数，该整数大于整数解决方案，如果解决方案集是有限的？

A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set

著录项

相似文献

相关主题

期刊订阅