Germain Primes and the Homogenous Integer Function Q(x,y)

  • Thread starter Thread starter vantheman
  • Start date Start date
  • Tags Tags
    Primes
vantheman
Messages
44
Reaction score
0
Reference: www.mathpages.com/home367.htm[/URL]
On page 2 of reference the formula is given
(x+y)^p - x^p - y^p = pxy(x=y)Q(x,y) where Q(x,y) is a homogenous integer function of degree p-3.
If we insert a number of different value of p into the equation, it appears that
Q(x,y) = (x^2 = xy + y^2)^((p-3)/2)

Is there an easy way to prove this without getting lost in infinite series calculations, or is there a proof already in print?
 
Last edited by a moderator:
Physics news on Phys.org
You seem in a much better position to investigate this than anybody else, particularly since your reference can not be found.

(x+y)^p - x^p - y^p = pxy(x=y)Q(x,y) where Q(x,y) is a homogenous integer function of degree p-3.

Are you sure you mean to write x=y? If so what is the point of Q(x,y)? Assuming you don't mean x=y, the Q(x,y) appears to be of degree p-2. Because we subtracted those of degree p, and pulled out a pxy from Q(x,y,) that leaves degree p-2.
 
Last edited:
Sorry for the errors. The correct web address is
www.mathpages.com/home/kmath367.htm[/URL]

The equal sign in the formula should have been "+" not "=". I neglected to hit the shift key.
I think p-3 is correct. When you substact x^p and y^p from the expansion, the results have a factor of pxy, so the x^p in now at the p-2 level. However, the remaining equation is divisible by (x+y), and this brings it to the p-3 level.

I'm an amateur looking for professional help. Is there an easy way to prove that

Q(x,y) = (x^2 + xy + y^2)^((n-3)/2) ?
 
Last edited by a moderator:
I think you are assuming too much from other people here. It does help to state the definition of Q(x,y)

Q(x,y) = \frac{(x+y)^P-(x^P+y^P)}{(xy)(x+y)p}

I thought it enough of a problem, letting p-1 = u, to show that p divides all terms: (x+y)^u -\frac{x^u+y^u}{x+y}
This can be found by induction on k: \frac{(p-1)!}{k!(p-1-k)!} \equiv (-1)^k Mod p

So you maybe looking at an induction problem on n.
 
Last edited:
Thank you. It's very much appreciated.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
Back
Top