The representation-count formula for binary quadratic form numbers
Statement
Let a -number be a positive integer represented by the binary quadratic form . Suppose that such a number is written in the general form
where has no prime factor of the form , and are primes of the form . The exponents are nonnegative integers. Representation-count formula. The number of distinct -representations of , including the cases and either variable being zero, is
This gives an explicit divisor-exponent formula for the number of representations by , refining the preceding factorization results for -numbers. The source does not provide evidence resolving the claim, so its status is left open.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.