Fermat’s last theorem, had the statement that there are no natural numbers A, B, and C such that A<sup>n</sup> + B<sup>n</sup> = C<sup>n</sup>, in which n is a natural number great...Fermat’s last theorem, had the statement that there are no natural numbers A, B, and C such that A<sup>n</sup> + B<sup>n</sup> = C<sup>n</sup>, in which n is a natural number greater than 2. We have shown that any product of two odd numbers can generate Fermat or Pythagoras triple (A, B, C) following n = 2 and also it is applicable A<sup>2</sup> + B<sup>2</sup> + C<sup>2</sup> + D<sup>2</sup> + so on =A<sub>n</sub><sup>2 </sup>where all are natural numbers.展开更多
The Fermat–Pramanik series are like below: .The mathematical principle has been established by factorization principle. The Fermat-Pramanik tree can be grown. It produces branched Fermat-Pramanik series using same pr...The Fermat–Pramanik series are like below: .The mathematical principle has been established by factorization principle. The Fermat-Pramanik tree can be grown. It produces branched Fermat-Pramanik series using same principle making Fermat-Pramanik chain. Branched chain can be propagated at any point of the main chain with indefinite length using factorization principle as follows: Same principle is applicable for integer solutions of A<sup>M</sup>+B<sup>2</sup>=C<sup>2</sup>which produces series of the type . It has been shown that this equation is solvable with N{A, B, C, M}. where , , M=M<sub>1</sub>+M<sub>2</sub> and M<sub>1</sub>>M<sub>2</sub>. Subsequently, it has been shown that using M= M<sub>1</sub>+M<sub>2</sub>+M<sub>3</sub>+... The combinations of Ms should be taken so that the values of both the parts (C<sub>n</sub>+B<sub>n</sub>) and (C<sub>n</sub>-B<sub>n</sub>) should be even or odd for obtaining Z{B,C}. Hence, it has been shown that the Fermat triple can generate a) Fermat-Pramanik multiplate, b) Fermat-Pramanik Branched multiplate and c) Fermat-Pramanik deductive series. All these formalisms are useful for development of new principle of cryptography. .展开更多
文摘Fermat’s last theorem, had the statement that there are no natural numbers A, B, and C such that A<sup>n</sup> + B<sup>n</sup> = C<sup>n</sup>, in which n is a natural number greater than 2. We have shown that any product of two odd numbers can generate Fermat or Pythagoras triple (A, B, C) following n = 2 and also it is applicable A<sup>2</sup> + B<sup>2</sup> + C<sup>2</sup> + D<sup>2</sup> + so on =A<sub>n</sub><sup>2 </sup>where all are natural numbers.
文摘The Fermat–Pramanik series are like below: .The mathematical principle has been established by factorization principle. The Fermat-Pramanik tree can be grown. It produces branched Fermat-Pramanik series using same principle making Fermat-Pramanik chain. Branched chain can be propagated at any point of the main chain with indefinite length using factorization principle as follows: Same principle is applicable for integer solutions of A<sup>M</sup>+B<sup>2</sup>=C<sup>2</sup>which produces series of the type . It has been shown that this equation is solvable with N{A, B, C, M}. where , , M=M<sub>1</sub>+M<sub>2</sub> and M<sub>1</sub>>M<sub>2</sub>. Subsequently, it has been shown that using M= M<sub>1</sub>+M<sub>2</sub>+M<sub>3</sub>+... The combinations of Ms should be taken so that the values of both the parts (C<sub>n</sub>+B<sub>n</sub>) and (C<sub>n</sub>-B<sub>n</sub>) should be even or odd for obtaining Z{B,C}. Hence, it has been shown that the Fermat triple can generate a) Fermat-Pramanik multiplate, b) Fermat-Pramanik Branched multiplate and c) Fermat-Pramanik deductive series. All these formalisms are useful for development of new principle of cryptography. .
