2027 Strong Foundation Mathematics: Algebraic Manipulation
This article organizes 15 typical example questions around algebraic deformation, covering identities, factorization, symmetry processing and common variable substitutions. It focuses on showing how to simplify the complex through structural observation. It is suitable for the review of the strong foundation plan and the basic stage of mathematics competitions.
8 min readStrong Foundation Program · Mathematics Olympiad · AlgebraDownload Markdown
Example 1.1
Assume that x satisfies the condition x3−x31=85, then the value of x2+x21 is?
Cubic sum difference identity:
a3−b3=(a−b)(a2+ab+b2)=(a−b)3+3ab(a−b)
a3+b3=(a+b)(a2−ab+b2)=(a+b)3−3ab(a+b)
Obviously, this problem can be solved using the identity: x3−x31=85(x−x1)3+3(x−x1)=85[(x−x1)−5][(x−x1)2+5(x−x1)+8]=0
For the second bracket, Δ=5−32<0
So it can only be: x−x1=5
So x2+x21=(x−x1)2+2=7
Example 1.2
Known to be in the range of real numbers: x+y=u+v,x2+y2=u2+v2, verify: xn+yn=un+vn
It can be found that the condition is equivalent to an elastic collision between two objects with the same mass and an exchange of velocities (in fact, they can each maintain their original velocities).
Target: {x,y}={u,v}
x+y=u+vx2+y2+2xy=u2+v2+2uv{x+y=u+v,xy=uv
Therefore, {x,y},{u,v} is the two roots of the same quadratic equation, and the objective is proved.
Example 1.3
(Peking University) Given x=y, and x2=2y+5,y2=2x+5, then x3−2x2y2+y3=?
Unfortunately, no reasonable equality conditions can be constructed.
In the same way, s=169,196,225,256,289 is not possible, but s=324(a=−5,b=2,c=4) is possible.
Example 1.9
(2015 Peking University Liberal Arts Program) Assume x=2bcb2+c2−a2,y=2cac2+a2−b2,z=2aba2+b2−c2, and x+y+z=1, then what is the value of x2015+y2015+z2015?
Reminiscent of the cosine theorem, the condition is equivalent to A+B+C=π,cosA+cosB+cosC=1.
Familiar with cosA+cosB+cosC=1+4sin2Asin2Bsin2C
Therefore, if there is an angle whose half-angle sine value is 0, the cosine value of this angle must be 1.
Let’s assume x=1,y=−z, then x2015+y2015+z2015=1
Or consider factoring:
a(b2+c2−a2)+b(c2+a2−b2)+c(a2+b2−c2)−2abc=0
This is a three-dimensional cubic symmetry. When a=b+c, the left-hand formula is equal to 0, so it can be factored into:
(a+b−c)(b+c−a)(c+a−b)=0
Let’s assume a+b=c, then z=−1,x=y=1, and get the same conclusion in the same way.
ab+a+1a=zx+yx+1yx=x1+y1+z1y1 Just add up in the same way. ### Common substitutions Common types of variable substitution: 1. Continuous substitution: a,b,c=1, a=yx, b=zy, c=xz 2. Split the cake and replace it: a+b+c=1 Verify a+b+c+a+c≤31⎩⎨⎧a=x+y+zxb=x+y+zyc=x+y+zz Proof: x+y+z≤31⇒x+y+z≤31⇒x+y≤31⇒x+y+z≤(31)2 3. Ravi substitution: a,b,c is the edge of △ABC, a=x+y, b=y+z, c=z+x 4. Differential substitution: a+b+c=0 certificate a3+b3+c3=3abca=x−y,b=y−z,c=z−xa3+b3+c3−3abc=(a+b+c)(a2+b2+c2−ab−ac−bc) ## Example 1.11 (2018 Peking University Independent Admissions) Given a=b,a2(b+c)=b2(a+c)=1, find the value of c2(a+b)−abc.
ab(a−b)+c(a2−b2)=0ab+c(a+b)=0c2(a+b)=−abc
Utilizing a2(b+c)=1:
a(ab+ac)=1=−abcc2(a+b)−abc=−2abc=2
Example 1.12
(2014 Peking University Comprehensive Camp) Suppose the real number a,b,c satisfies a+b+c=0,a3+b3+c3=0, among which n∈N+, find the value of a2n+1+b2n+1+c2n+1
abc=0, let’s assume c=0,a+b=0, then the equation is obviously equal to 0.
Example 1.13
(Self-recruited by Peking University in 2016) It is known that for the real number a, there is a real number b,c that satisfies a3−b3−c3=3abc,a2=2(b+c), then the number of such real numbers a is ()
A. 1 B. 3 C. Infinite D. None of the first three options are correct
Since ※There is a−b−c=0 or a=−b=−c, the two situations are classified and discussed below:
Case 1: a=b+c
a2=2a, then a can be 0 or 2
Case 2: b=c=-a
a2=−4a≥0, then a=−4
To sum up, choose B
Example 1.14
(Independent enrollment) Given a+b+c=0, please ask for a(b1+c1)+b(c1+a1)+c(a1+b1)
The original form is equivalent to: abca2(b+c)+b2(c+a)+c2(a+b)=−abca3+b3+c3=−3
Example 1.15
Let a,b,c be a nonzero constant, and a2+b2+c2=1, a(b1+c1)+b(c1+a1)+c(a1+b1)=−3
Then the possible values of a+b+c are
A. 3
B. 2
C. 1
D. None of the first three answers are correct
The conditional image is the inverse problem of Example 1.14.
abca2(b+c)+b2(c+a)+c2(a+b)=−3
That is a2(b+c)+b2(c+a)+c2(a+b)+3abc=0
Similar to Example 1.9, it can be factorized:
(a+b+c)(ab+bc+ca)=0
Scenario One
a+b+c=0
Scenario Two
−31(a+b+c)2≤ab+bc+ca=0≤31(a+b+c)2, then (a+b+c)2=a2+b2+c2+2(ab+bc+ca)=1
When a,b,c becomes the opposite number, the condition is still satisfied, so:
a+b+c=±1 So choose A ### A common conclusion Suppose the real number S,Q satisfies S2≤nQ Then there must be n real numbers x1,x2,⋯,xn such that x1+x2+⋯+xn=S,x12+x22+⋯+xn2=Q. On the other hand, if such n real numbers exist, from Cauchy’s inequality: (x1+x2+⋯+xn)2≤n(x12+x22+⋯+xn2), Of course there is S2≤nQ. The sufficiency is proved below. This conclusion can be solved using mathematical induction. When n=2, let x+y=S,x2+y2=Q. So xy=2S2−Q. So x,y is the equation t2−St+2S2−Q=0 of two roots. Its discriminant is Δ=S2−2(S2−Q)=2Q−S2. As long as S2≤2Q, there is Δ≥0, so x,y is a real number. Suppose the conclusion holds for n−1 real numbers. Now consider the case of n real numbers. Let the last number be xn=z. Then the remaining n−1 numbers need to satisfy x1+⋯+xn−1=S−z,x12+⋯+xn−12=Q−z2. According to the inductive hypothesis, we only need to ensure that (S−z)2≤(n−1)(Q−z2). well organized nz2−2Sz+S2−(n−1)Q≤0. Think of it as a quadratic inequality with respect to z whose discriminant is Δ=(−2S)2−4n[S2−(n−1)Q]=4(n−1)(nQ−S2)≥0. Therefore, the real number z can always be found, making the above formula true (in fact, z=nS is feasible). At this time, the remaining n−1 numbers satisfy the induction condition, so they exist.
To sum up,
S2≤nQ
Not only is it a necessary condition given by Cauchy's inequality, but also that there are real numbers A sufficient condition for x1,x2,⋯,xn.
In particular, when n=3 you only need to take one c first, and turn the problem into a binary problem of a+b and a2+b2; and the binary problem is ultimately a non-negative discriminant.