The General Form of the Accurate Formula of A(n,k)
WU Hong-ru, Shuang-Gen Liu
Abstract
WU Hong-ru, Shuang-Gen Liu
Abstract
Let A(n,k) denote the number of non-negative integer solutions of Diophantine equation (∑ki=1)ix_i=n. In this paper, the authors find the general form of the general solutions of the recurrent formula A(n,k)=A(n,k-1)+A(n-k,k), which is A(n,k)=(∑km=1)(∑mr=1)(∑[k/m]-1j=0)t~((k))_(m,r,j)×n~j×s(r,m)×ζ~(nr)_m, where ζ_m=e~(2πi/m), and s(r,m)=1,gcd(r,m)=1, 0,others.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let A(n,k) denote the number of non-negative integer solutions of Diophantine equation (∑ki=1)ix_i=n. In this paper, the authors find the general form of the general solutions of the recurrent formula A(n,k)=A(n,k-1)+A(n-k,k), which is A(n,k)=(∑km=1)(∑mr=1)(∑[k/m]-1j=0)t~((k))_(m,r,j)×n~j×s(r,m)×ζ~(nr)_m, where ζ_m=e~(2πi/m), and s(r,m)=1,gcd(r,m)=1, 0,others.
Key concepts: Integer (computer science), Diophantine equation, Mathematics, Combinatorics, Physics, Computer science, Programming language