GET THE APP

A Curious Connection Between Fermat’s Number and Multiple Factoriangular Numbers

# Journal of Applied & Computational Mathematics

ISSN: 2168-9679

Open Access

Research Article - (2021) Volume 10, Issue 9

# A Curious Connection Between Fermat’s Number and Multiple Factoriangular Numbers

Swati Bisht* and Dr. Anand Singh Uniyal
*Correspondence: Swati Bisht, Govt. P.G. College Uttarakhand, India, Tel: 8630337677, Email: ,
Govt. P.G. College Uttarakhand, India

Received: 01-Sep-2021 Published: 23-Sep-2021 , DOI: 10.37421/2168-9679.2021.10.485
Citation: Swati Bisht, Dr. Anand Singh Uniyal. "A Curious Connection Between Fermat’s Number and Multiple Factoriangular Numbers." J Appl Computat Math 9 (2020): 469.
Copyright: © 2021 Bisht S, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

## Abstract

In the seventeenth century Fermat defined a sequence of numbers Fn=22n +1 for n ≥ 0 known as Fermat’s number . If Fn happens to be prime then Fn is called Fermat prime. All the Fermat’s number are of the form n!k+ Σnk for some fixed value of k and n. Further we will prove that after F4 no other Fermat prime exist upto 1050 .

#### Keywords

Fermat’s Number • Prime Number • Multiple Factoriangular Numbers • Fer mat Prime

#### Introduction

Fermat Number: A positive number of the form Fn =22n + 1 where n is nonnegative integer.

First few Fermat’s number are3, 5, 17, 257, 65537…

Pierre de Fermat conjectured that all numbers

(1.1) Fn=22n +1 for m = 0, 1, 2, . . .

Are prime. Nowadays we know that the first five members of this sequence are prime and that (see [2])

(1.2) Fn is composite for 5 ≤ m ≤ 32.

The status of F33 is for the time being unknown, i.e., we do not know yet whether it is prime or composite [1,2].

The numbers Fn are called Fermat numbers. If Fn is prime, we say that it is a Fermat prime.

Fermat numbers were most likely a mathematical interest before 1796. When C. F. Gauss mentioned that there is a remarkable relation between the Euclidean construction (i.e., by ruler and compass) of regular polygons and the Fermat numbers, interest in the Fermat primes skyrocketed. In particular, he proved that if the number of sides of a regular polygonal shape is of the form 2kFm1. Fmr, where k ≥ 0,r ≥ 0, where Fmi are distinct Fermat primes, then this polygonal shape can be made by using compass ruler . The converse statement was proved later by Wantzel in [3,4].

There exist many necessary and sufficient conditions concerning the primality of Fn . For instance, the number Fn(n >0) is a prime if and only if it can be written as a sum of two squares in essentially only one way, namely Fn= (22n-1)2 + 12.

Recall also further necessary and sufficient conditions: the well-known Pepin’s test, Wilson’s Theorem, Lucas’s Theorem for primality, etc., see [4].

Multiple Factoriangular number [5] : A generalization of Factoriangular number is known as multiple Factoriangular numbers and are defined as

Ft(n,k)=(n!)k +Σ nk

Where Tn(k)=Σnk =1k + 2k …+nk.

In this paper, we establish a connection between multiple Factoriangular numbers and Fermat number Table 1.

Table 1. A connection between multiple Factoriangular numbers and Fermat number.

N Ft(2,2n-1) Prime factorization of Ft(n,15) Number of digits Sum of squares of prime, integer, natural numbers
0 3 Prime 1
1 5 Prime 1 22 +12
2 17 Prime 2 42 +12
3 257 Prime 3 16² + 1²
4 65537 Prime 5 256² + 1²
5 4294 967297 641 × 6 700417 10 65536² + 1²
6 18 446744 073709 551617 274177 × 67 280421 310721 20 4046 803256² + 1438 793759²
7 340 282366 920938 463463 374607 431768 211457 59649 589127 497217 × 5704 689200 685129 054721 39 18 446744 073709 551616² + 1²
8 115792 089237 316195 423570 985008 687907 853269 984665 640564 039457 584007 913129 639937 238 926361 552897 × 93 461639 715357 977769 163558 199606 896584 051237 541638 188580 280321 78 339 840244 399005 511779 394711 120340 266111² + 17 340632 172455 487023 654788 790090 010704 ²

By the common observation we see that the sequence of number so formed is well known Fermat Number Sequence and it follow the properties described in [2,4].

Now

Ft(2 , 2n -1) = (2!)2n –1 + Σ 22n -1 = 22n +1.

Corollary: All the Fermat prime are multiple Factoriangular primes.

#### Conclusion

We end up with the conclusion that the only primes we get in different sequences of multiple Factoriangular numbers till 1050 are the Fermat Prime F0, F1 , F2 , F3 , F4. Also Sequence of Fermat Number are a special case of multiple Factoriangular number by fixing n=2, k= 2n -1.

#### Journal Highlights

###### Citations: 1282

Journal of Applied & Computational Mathematics received 1282 citations as per Google Scholar report

#### Open Access Journals

arrow_upward arrow_upward