Skip to main content
padlock icon - secure page this page is secure

Some Remarks on the Number of Solutions to the Equation f(X1) + … + f(Xn) = 0

Buy Article:

$59.00 + tax (Refund Policy)

Let S, T be finite sets, and let f be a function from S to T. Fix an element t in T, and let cn denote the number of n‐tuples (X 1,…,Xn ) satisfying f(X 1) + … + f(Xn ) = t here + denotes any binary operation on T. The sequence c 1, c 2,… satisfies a linear recurrence relation of degree at most |T|.
No References
No Citations
No Supplementary Data
No Article Media
No Metrics

Document Type: Research Article

Affiliations: University of South Carolina

Publication date: December 1, 1984

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more