a. Find three pairs of positive integers (m,n) for which p is a prime number.
b. Show that if p is a prime number, then p≡1(mod8).
Solution
a. For (m,n)=(6,10), (12,15) and (30,78), p is equal to 8102+62=17,9152+122=41 and 72782+302=97. respectively.
b. Let k=n2−m2. Then (k,m,n) is a Pythagorean triple. Therefore, there exist positive integers d,x and y such that (x,y)=1, n=d(x2+y2) and m=d(x2−y2) or m=2dxy.
If m=d(x2−y2), then p=xyd(x4+y4). Since (x,y)=1, we have (xy,x4+y4)=1 and hence xy divides d. As x4+y4≥17 and p is a prime, we get d=xy and p=x4+y4. Since one of x and y is even and the other one is odd, p=x4+y4≡1(mod8).
If m=2dxy, then p=d(x2−y2)+x2−y28dx2y2. Since x2−y28dx2y2 is an integer and (xy,x2−y2)=1, we have x2−y2 divides 8d. On the other hand, as p is a prime number, d and x2−y28d are relatively prime. Thus, x2−y2 is a multiple of d. Therefore, x2−y2=d,2d,4d or 8d. If x2−y2=d, then as p=d2+8x2y2 is a prime, d is odd and p≡1(mod8). If x2−y2=2d, then p=2(d2+2x2y2) is not a prime number. If x2−y2=4d, then p=2(2d2+x2y2) is not a prime number.
If x2−y2=8d, then p=8d2+x2y2 is a prime number implies that both x and y are odd numbers and consequently p≡1(mod8).
Looking for a route rather than an archive? The track puts 2,000
problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement and solution reproduced as published; topic and difficulty added by this site.