... 正整数集the set of all positive integers 整数集the set of all integers 有理数集the set of all rational numbers ...
基于70个网页-相关网页
·2,447,543篇论文数据，部分数据来源于NoteExpress
In particular, some upper bounds of the vertex arboricity of the integer distance graph G(Z, D) are obtained when D is a set of positive integers and Z the set of all integers.
特别地，当D是某正整数集合，Z是整数集时，得出了整数距离图G（Z ，D）的点荫度的几个上界。
youdao
Let N be the set of all positive integers.
设N是全体正整数的集合。
应用推荐
模块上移
模块下移
不移动