Number of Terms and R-F Factor Relation

According to the binomial hypothesis, the entirety of n + 1 terms takes shape in an arrangement of terms that take progressive values of the record r. Subsequently, the entirety of the two integrability a and b is additionally nth control. Articulations will be communicated by the numbers 0, 1, 2,…, n. The taking characterises the binomial coefficient after condition, but n! (moreover known as factorial n) is the item of n first-order normal integrability 1, 2, 3,…, n (0! Is respected as identical to 1). The coefficients are to be put away as a cluster, known as Pascal’s triangle. Suppose a binomial expression (x + y)n has to be expanded. In that case, the binomial expansion formula can be utilised to express it in simple expression terms in the form of ax + by + c in which ‘b’ and ‘c’ are non-negative integers. Note that the value of ‘a’ is completely reliant on ‘n’ and ‘b.’

The R-F Factor Relationship

The goal is to detect the integer and fractional parts of the form (a+b+c )n. Where a, b, and c are all natural integers. 

Algorithm:

1] The expression provided is in the form I + f. Where f is a fraction from 0 to 1. 

2] To get the conjugate f`, replace the negative sign with a positive sign. 

3] Add or remove to get the integer part = I. 

4] The remainder is converted to 

When added,

0 < f < 1

0 < f’ < 1

Total = 0 f + f’ 2

When it is subtracted,

0 f 1 as well as 0 f’ 1

1 – 1 – f’ 0

Difference = – 1 < f – f’ < 1 

R-F Factor Relation: Problems of the form (√A + B)ⁿ = I + f, where I and n are positive integers.

0 ≤ f ≤ 1, |A – B²|= k and |√A+B|< 1.

Approaches for these sorts of problems are often learned from the following examples:

Example: Integral a part of (4√3 + 7)ⁿ is (n ϵ N)

Solution: “n ϵ N, (7 + 4√3)ⁿ Ï N

Denote (7 + 4√3)ⁿ by I + f

Where I is an integer and such 0 < f < 1

∵ 0 < 7 – 4√3 < 1

∴ we will denote (7 + 4√3)ⁿ by G.

Where, G ϵ R such 0 < G < 1

Now, I + f = (7 + 4√3)ⁿ = 7ⁿ + ⁿC₁ 7ⁿ⁻¹ (4√3) + ⁿC₂ 7ⁿ⁻² (4√3)² + … (i)

G = (7 – 4√3)ⁿ = 7ⁿ – ⁿC₁ 7ⁿ⁻¹ (4√3) + ⁿC₂ 7ⁿ⁻² (4√3)² + … (ii)

To cancel irrational terms, we add eqs. (i) and (ii), we get:

I + f + G = 2 (7ⁿ + ⁿC₂ 7ⁿ⁻² (48) + ⁿC₄ 7ⁿ⁻⁴ (48)² + …)

= 2k, where k is an integer

∵ I is an integer.

∴ f + G = 2k – I is an integer … (iii)

Now, 0 < f < 1

And, 0 < G < 1

⇒ 0 < f + G < 2 … (iv)

From eqⁿ (iii) and (iv), f + G = 1

Now, form eqⁿ (iii) l = 2k – 1

⇒ Integral a part of (7 + 4√3)ⁿ.

i.e., l is an odd integer.

(ii) Divisibility problem: within the expansion, (1 + α)ⁿ = 1 + ⁿC₁ α + ⁿC₂ α² + … + ⁿCn αⁿ.

Therefore:

 (i) (1 + α)ⁿ – 1 = ⁿC₁ α + ⁿC₂ α² + … + ⁿCn αⁿ is divisible by α i.e., it’s a multiple of α.

Example: For all n ϵ R, 9ⁿ⁺¹ – 8n – 9 is divisible by

Step-by-step solution: 9ⁿ⁺¹ – 8n – 9 = 9ⁿ x 9 – 8n – 9

= (1 + 8)ⁿ x 9 – 8n – 9

= [ⁿC₀ + ⁿC₁ 8 + ⁿC₂ 8² + ⁿC₃ 8³ + … + ⁿCn 8ⁿ] 9 – 8n – 9

= [1 + 8n + ⁿC₂ 8² + ⁿC₃ 8³ + … + ⁿCn 8ⁿ] 9 – 8n – 9

= 9 + 72n + [ⁿC₂ 8² + ⁿC₃ 8³ + … + ⁿCn 8ⁿ] 9 – 8n – 9

= (72n – 8n) + 8² [ⁿC₂ + ⁿC₃ 8 + … + ⁿCn 8ⁿ⁻²] 9

= 64n + 64 [ⁿC₂ + ⁿC₃ 8 + … + 8ⁿ⁻²] 9

= 64 [n + (ⁿC₂ + ⁿC₃ 8 + … + ⁿCn 8ⁿ⁻²)9]

= 64 x some constant numbers

= Divisible by 64.

Conclusion

For positive values of a and b, the n = 2 theorem may be a geometrically undisputed incontrovertible fact that a square on the side a + b is a square on the side a, a square on side b, and it is often two rectangles. Edge a is B. For n = 3, the idea is that a cube with side a + b is usually a cube with side a, a cube with side b, an oblong box with three a × a × b, and three rectangles. It is a. × b × b box.