[go: up one dir, main page]

0% found this document useful (0 votes)
127 views3 pages

OTC Materi

The document proves two results: 1) If a2 + b2 + c2 + 1 = abcd where a, b, c, d are positive integers, then d must equal 4. It proves this by considering d ≥ 5 and deriving a contradiction. 2) If an + bn ∈ Z+ for positive integers a, b, n where n ≥ 2, and k = (ab)n-1 + 1, then k must be an nth power of an integer. It proves the case n = 2 and argues other values of n lead to contradictions.

Uploaded by

Gregorius
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
127 views3 pages

OTC Materi

The document proves two results: 1) If a2 + b2 + c2 + 1 = abcd where a, b, c, d are positive integers, then d must equal 4. It proves this by considering d ≥ 5 and deriving a contradiction. 2) If an + bn ∈ Z+ for positive integers a, b, n where n ≥ 2, and k = (ab)n-1 + 1, then k must be an nth power of an integer. It proves the case n = 2 and argues other values of n lead to contradictions.

Uploaded by

Gregorius
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

VIETA JUMPING

1. Suppose a , b , c , d are positive integers such that


a 2+b 2+ c 2+1=abcd
Prove that d=4.
Proof.
Suppose that d ≥5, then we have
a 2+ a (−bcd )+ ( b2 +c 2 +1 )=0
Quadratic equations in a.
x 1+ x2=bcd
x 1 x 2=b 2+ c 2+1
b2 + c2 +1
x 2=bcd−a=
a
Suppose ( a , b , c ) has the minimal solution for a fixed value k.
WLOG a ≥ b ≥ c
2 2 2 2 2
bcd ± √ b c d −4 ( b + c +1 )
x 2=
2
Since it has the minimal a+ b+c solution, then
bcd+ √ b2 c2 d 2−4 ( b 2+ c2 +1 )
x 2=
2
Or else it has a smaller set of solution:
Thus,
b+c
a≥
2
( bcd −√ b2 c2 d 2−4 ( b2 + c2 +1 ) ) ( b+ c )

2 2
2 2 2 2 2 2
( bcd−b−c ) ≥ b c d −4 ( b + c +1 )
We will get
5 b2 +5 c 2 +2 bc+ 4 ≥ 2bcd (b+c )
Since d ≥5 ,
2 bcd ( b +c ) ≥ 10 bc ( b +c ) ≥ 6 bc ( b+c ) +4 ( b+c ) ≥5 b 2+5 c 2 +2 bc+ 4 (b+c )
Therefore, b+ c ≤ 1
Which is clearly forming a contradiction.
Thus, d ≤ 4

a 2+b 2+ c 2+1=abcd

Notice a , b , c , dcan’t be all even,


Suppose they can be at least one even.
Then RHS is even. Let us notice a 2+b 2+ c 2+1 ≡ 0(mod 2).
Then, there must only be 1 odd and 2 even.
Therefore,
a 2+b 2+ c 2+1 ≡2(mod 4)
contradicting the fact that 4∨abcd.
Thus, all of them must be odd
Notice that
a 2+b 2+ c 2+1
Is divisible by 4, when a , b , c odd. Therefore,
a 2+b 2+ c 2+1=dabc
Thus, 4∨d, and since d ≤ 4.
Then, we must have d=4.

2. Suppose that a , b , n, where n ≥ 2 are positive integers such that


a n + bn
∈Z
+¿¿
k= n−1
( ab ) +1
Prove that k is an nth power of an integer.
Proof.
Claim 01. If a , b ≥ 2 , then n=2
Proof. Suppose n ≥ 3, notice that we must have
( ab )n−1+1 ≤ an +b n
But, we must have
( ab )n−1+1 ≥ 2a n−1+2 b n−1
which is true since
( a n−1−2 ) ( bn−1−2 ) ≥ ( a 2−2 ) ( b2−2 )=4
Thus, we can’t have
k ∈ Z +¿¿
Suppose a=1, then
b n+1
k = n−1
b +1
Notice that
b n−1+1∨bn +1
b n−1+1∨bn−bn−1=b n−1(b−1)

b n−1+1∨b−1

b=1, we are then finished since k =1, which is an nth power of integer.
For n=2 , we have IMO 1988 ¿ 6 :
a2 +b2 2
+¿→ k ∈Z ¿
k= ∈Z
ab+1
Suppose
a 2−kab+ b2−k =0
a 2+ a (−bk ) + ( b2 −k ) =0
As a quadratic equation on a, we then have
x 1+ x2=bk
x 1 x 2=b 2−k
b2−k
x 2= =bk−a
a
Suppose (a , b) has the minimal solution.
WLOG a ≥ b
Now, note that we will be finished if k > 0 since
b2−k
<a
a
We are then finished.

ab+ bc+ ca
2
2 2
≥ 8 ( a2 b2 +a 2 c 2 +b2 c 2 )
a +b +c +16 abc
a+ b+c=1

x ( x−1 )2 +16 y 2 ≥ 4 y ( x−1 )( x +2 )

Jika x ≤ 1 , obv

Jika x ≥ 1

x
a 2+b 2+ c 2=1−
2

4
x=4 ( ab+ bc+ ac ) ≤
3

4
1≤x ≤
3

8 ( x−1 ) ≤ 9 y
2 2
x ( x−1 ) +16 y ≥ 4 y ( x−1 )( x +2 )

4
Take x ∈ 1 , [ ] 3

f ( y ) =x ( x−1 )2−4 y ( x−1 )( x +2 ) +16 y 2

f ' ( y )=32 y−4( x−1)( x +2)

You might also like