1) k-power number
k次方数
1.
Let n be a positive integer,a(n) be the largest kpower number less than n equal to n,and b(n) be the smallest k-power number greater than n or equal to n.
设n是正整数,a(n)表示不超过n的最大k次方数,b(n)表示不小于n的最小k次方数。
2) the k-power free part of an integer
无k次方幂函数
3) kth degree magic square
k次幻方
5) sum of the kth power
k次方和
6) the kth power of graph
k次方图
1.
There are four chapters in this dissertation, which focuses on three subjects:the wide diameter of the kth power of paths and trees, and obtaining the boundof the wide diameter of the kth power of graphs; the wide diameter the kth powerof cycles and getting the bound of the kth power of hamiltonian graphs; the widediameter of the Harary graphs.
本文共四章，主要研究了三方面的内容：路和树的k次方图的宽直径，并得到图的k次方图的宽直径的界；圈的k次方图的宽直径及给出了含圈图的k次方图的宽直径的界；Harary图的宽直径。
补充资料：方数
1.方术。指医术。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条