Let n be a non-negative integer, which ends written in decimal notation on exactly k zeros, but which is bigger than 10k.
For a n is only k\equal{}k(n)\geq2 known. In how many different ways (as a function of k\equal{}k(n)\geq2) can n be written as difference of two squares of non-negative integers at least? functionnumber theory unsolvednumber theory