Theory of number has become crown of mathematics since Pythagoras time.

The Pythagorean equation,

A 1 2 + A 2 2 = A 3 2 (1)

has an infinite number of positive integer solutions for A 1 , A 2 and A 3 ; these solutions are known as Pythagorean triplets (P.T.) (with the simplest example 3 2 + 4 2 = 5 2 [1] - [6] . Around 1637, Fermat wrote in the margin of a book that the more generalized equation, A 1 n + A 2 n = A 3 n had no solutions in the positive integers if n is an integer greater than 2. In theory, this statement is known as Fermat’s Last Theorem (it is also called as Fermat’s conjecture before 1995). The cases n = 1 and n = 2 have been known from Pythagoras time having infinite solutions [1] . The proposition was first stated as a theorem by Pierre de Fermat around 1637. It was written in the margin of a copy of Arithmetica. Fermat claimed that he had a proof and due to the lengthy calculation, he was unable to fit in the margin of the copy. However, after his death no document was found to substantiate his claim. Consequently, the proposition became as a conjecture rather than a theorem. After 358 years of effort by mathematicians, the first successful proof was completed in 1994 by Andrew Wiles and formally published in 1995. It was described as a “stunning advance in mathematics” in the citation for Wiles’s Abel Prize award in 2016. It was also proved many parts of the Taniyama-Shimura conjecture. Afterward, it was defined as the modularity theorem, and opened up new approaches to numerous other problems and developed powerful technique known as modularity lifting in mathematics. It is among the most outstanding out come in mathematical analysis [7] [8] [9] . Very few attempts have been made to extend the Fermat’s equation upto the 4^th term [10] [11] . Recently Pramanik et.al has shown that Pythagoras triplet can adapt n number of terms in place of three terms [12] .

A 1 2 + A 2 2 + A 3 2 + ⋯ + A n − 1 2 = A n 2 (Fermat-Pramanik multiplate) (2)

It is already discussed how to generate Pythagoras triplet by simple method which is illustrated briefly below [3] .

A 1 2 + A 2 2 = A 3 2

A 1 2 + A 2 2 = A 3 2 ⇒ A 1 2 = A 3 2 − A 2 2 (3)

∴ A 1 2 = ( A 3 + A 2 ) ( A 3 − A 2 ) (4)

Now let us consider A 1 = B 1 B 2 where all are odd or even. If A₁ will be prime then one of the B will be 1.

Henceforth from Equation (4) we can obtain,

A 3 + A 2 = B 2 2 and A 3 − A 2 = B 1 2 Involving B 1 and B 2 (5)

Thus, A 3 = B 1 2 + B 2 2 2 and A 2 = B 2 2 − B 1 2 2 (6)

With this principle it has been shown that Fermat-Pramanik multiplate can be generated [3] . It is to be noted that A 3 and any of A 1 and A 2 of Pythagorean triplets should be odd numbers if there is no common factor for A 1 , A 2 and A 3 .

Now principle of generation of branching of Fermat-Pramanik multiplate will be illustrated by a simple principle. Let A 1 is even and it is related with A 2 and A 3 through Equation (4) which is A 1 2 = ( A 3 + A 2 ) ( A 3 − A 2 ) .

A 2 and A 3 can be generated from any combination of B 1 , B 2 , B 3 , B 4 etc. If all Bs are “odd” then the following combinations will be permitted for A 1 as illustrated in Table 1.

Order of values of Bs are B 1 < B 2 < B 3 < B 4 < ⋯ . For Illustration the following values of B 1 , B 2 , B 3 , B 4 are taken B 1 = 5 , B 2 = 11 , B 3 = 19 , B 4 = 29 . Thus, A 3 = ( B 1 2 + B 2 2 ) / 2 and A 2 = ( B 2 2 − B 1 2 ) / 2 . Now sets will be generated are as follows,

A 1 2 + A 2 2 = A 3 2 ⇒ A 1 2 = A 3 2 − A 2 2

If all Bs are even the choice for solution of A 1 , A 2 , A 3 have no problem. A 3 may have any number of any of Bs and A 2 may have any number of any of Bs. It is to be noted that all A 3 and A 1 are odd (Table 2).

Now principle of branching will be illustrated.

If the Fermat-Pramanik series are like below [12] ,

A 1 2 + A 2 2 + A 3 2 + A 4 2 + A 5 2 + A 6 2 + ⋯ + A n − 1 2 = A n 2 (7)

Branching can be done at any A x for x = 1 , 2 , 3 , 4 , ⋯   soon and at any number. Then first it to be checked at A x for its odd or even character. Let A 4 is taken for illustration. If A 4 is odd and branching is to be done at A 4 2 , then A 4 should be the product of two different odd numbers. If A 4 is prime number then one number may be 1.

If A 4 is even and it is the product of two even numbers then it can be used for branching.

A 4 2 + C 1 2 = C 2 2 ⇒ A 4 2 = C 2 2 − C 1 2 ⇒ A 4 2 = ( C 2 + C 1 ) ( C 2 − C 1 ) (8)

Now it may be assumed A 4 2 = X 2 Y 2 where X and Y are even and X > Y .

Therefore, C 2 + C 1 = X 2 and C 2 − C 1 = Y 2 .

C 1 = X 2 + Y 2 2 and C 2 = X 2 − Y 2 2 (9)

²+: symbol denotes branching of A₄ “square” to C₁ square.

Hence A 1 2 + A 2 2 + A 3 2 + A 4 2 + A 5 2 + ⋯ + A n − 1 2 = A n 2

+²

C 1 2 ( 20 2 ) = C 2 2 ( 29 2 ) ⇒ ( A 4 2 + C 1 2 = C 2 2 ) ⇒ 21 2 + 20 2 = 29 2

Let it to be illustrated with the numbers. To expand it further, the prime number 29 has been considered which can thus be splitted as the product of 1 ×

29. Thus, C 3 = ( 29 2 − 1 ) / 2 = 420 and C 4 = ( 29 2 + 1 ) / 2 = 421 . Henceforth, A 4 2 + C 1 2 + C 2 2 + C 3 2 = C 4 2 ⇒ 21 2 + 20 2 + 420 2 = 421 2 .

C 1 can also be expanded with the same principle. So any number of branches of any length can be fabricated after proper scrutiny of A x finding X and Y, hence Cs.

This equation is solvable with N { A , B , C , M } . Even then the combination should be taken so that the values of both the parts will be even or odd.

A M = C 2 − B 2 (10)

A M = ( C + B ) ( C − B ) (11)

Now, if M = M 1 + M 2 and M 1 > M 2 then,

A M = A M 1 + M 2 = A M 1 A M 2 = ( C + B ) ( C − B ) (12)

Now if A is even, then both A M 1 and A M 2 are even and A M 1 > A M 2

Henceforth from Equation (12) we can obtain,

B + C = A M 1     and     C − B = A M 2 (13)

Therefore,

B = A M 1 − A M 2 2     and     C = A M 1 + A M 2 2 (14)

∴ C 2 − B 2 = A M 1 + M 2 = A M (15)

Let various combinations of Ms may be taken (here are 3 M x ) as M = M 1 + M 2 + M 3 and values are as follows M 1 < M 2 < M 3 .

Here two sets of Ms are taken: (a) M 1 + M 3 and M 2 and (b) M 2 + M 3 and M 1 .

Therefore,

C 1 + B 1 = A M 1 + M 2 and C 1 − B 1 = A M 2 (16)

Thus the product of ( C 1 + B 1 ) and ( C 1 − B 1 ) will result in,

C 1 2 − B 1 2 = A M 1 + M 2 + M 3 = A M (17)

Similarly,

C 2 + B 2 = A M 2 + M 3 and C 2 − B 2 = A M 1 (18)

Therefore, the product of ( C 1 + B 1 ) and ( C 1 − B 1 ) will yield in

C 2 2 − B 2 2 = A M 1 + M 2 + M 3 = A M (19)

Thus, from Equations (17) and (19) we can obtain,

C 1 2 − B 1 2 = C 2 2 − B 2 2 (20)

For more elaboration N 1 upto N 8 are accepted and values of Ns are in this order of N 1 > N 2 > N 3 > N 4 > N 5 > N 6 > N 7 > N 8 . Some of the combinations are illustrated in Table 3.

Here is a small numerical example. For A = 2 and M = 1 + 2 + 3 + 4 = 10 ,

C 5 + B 5 = A 1 + 2 + 3   and   C 5 − B 5 = A 4 (21)

Thus, evaluated values of B 5 and C 5 are 40 and 24 respectively and therefore, 40 2 − 24 2 = 2 1 + 2 + 3 + 4 = 2 10 .

Similarly, For A = 2 and M = 1 + 2 + 3 + 4 = 10 ,

C 6 + B 6 = A 4 + 3   and   C 6 − B 6 = A 1 + 2 (22)

Therefore, evaluated values of C 6 and B 6 are 68 and 60 respectively and henceforth, 68 2 − 60 2 = 2 1 + 2 + 3 + 4 = 2 10 .

Thus it may be concluded that a new deductive series from Fermat–Pramanik principle can be generated as,

C 1 2 − B 1 2 = C 2 2 − B 2 2 = C 3 2 − B 3 2 = ⋯ = C n 2 − B n 2 = A M 1 + M 2 + M 3 + M 4 + M 5 + M 6 + ⋯ + soon = A M (23)

where, M = M 1 + M 2 + M 3 + M 4 + M 5 + M 6 + ⋯ + soon .

Thus we have shown that the Fermat triple can generate a) Fermat-Pramanik multiplate [12] , b) Fermat-Pramanik Branched multiplate and c) Fermat-Pramanik deductive series. All these formalisms are useful for cryptography and those studies are in progress [13] .

The authors are grateful to Jadavpur University, Kolkata for moral support.

The authors declare no conflicts of interest regarding the publication of this paper.

Pramanik, P., Pramanik, S. and Sen, S. (2024) Tree of Fermat- Pramanik Series and Solution of with Integers Produces a New Series of . Advances in Pure Mathematics, 14, 160-166. https://doi.org/10.4236/apm.2024.143008