Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
My favorite theorem
After my favorite sequence - the post about the binary partitions function - ,
Its time for my favorite theorem.

One of my all-time leading candidates for Most Preposterous Theorem Ever:

Definition: A polynomial f(x)∈C[x] is indecomposable if whenever f(x)=g(h(x)) for polynomials g, h, one of g or h is linear.

Theorem. Let f,g, be nonconstant indecomposable polynomials over C. Suppose that f(x)−g(y) factors in C[x,y]. Then either g(x)=f(ax+b) for some a,b∈C, or
degf=degg=7,11,13,15,21, or 31,
and each of these possibilities does occur.

Copied from here

Grahams post

I was aware of it since a very long time , but despite " old " this is Nice !!




Possibly Related Threads…
Thread Author Replies Views Last Post
  My favorite integer sequence tommy1729 68 167,060 03/13/2016, 12:31 AM
Last Post: tommy1729

Users browsing this thread: 1 Guest(s)