What is the first 11 digit prime of Fibonacci?
$begingroup$
I am having difficulty finding the first eleven-digit prime number of Fibonacci..
If anyone has an answer I would greatly appreciate it.
I'm mostly asking this because it's one part of a greater puzzle I am trying to solve..
fibonacci-numbers
edited Dec 28 '18 at 23:35
David G. Stork
11k41432
asked Dec 28 '18 at 23:05
CodeMonkeyAlxCodeMonkeyAlx
1152
$endgroup$
|
show 3 more comments
$begingroup$
I am having difficulty finding the first eleven-digit prime number of Fibonacci..
If anyone has an answer I would greatly appreciate it.
I'm mostly asking this because it's one part of a greater puzzle I am trying to solve..
fibonacci-numbers
edited Dec 28 '18 at 23:35
David G. Stork
11k41432
asked Dec 28 '18 at 23:05
CodeMonkeyAlxCodeMonkeyAlx
1152
$endgroup$
2
$begingroup$
There are no eleven-digit Fibonacci primes: oeis.org/A005478 There is, however, a 10-digit Fibonacci prime: $2971215073$
$endgroup$
– Noble Mushtak
Dec 28 '18 at 23:07
$begingroup$
@RobArthan That's not how upvotes work. If you feel that this post is a good post (i.e. that it includes things like showing genuine effort, either work or research, and some context so that you, for instance, don't have to guess whether it's a coding problem) you are free to upvote. But they do not cancel eachother out, and they're not meant to.
$endgroup$
– Arthur
Dec 28 '18 at 23:16
$begingroup$
@RobArthan I can see that it's one vote up and one down, rather than none. And you get 5 reputation for an upvote and lose 2 for a downvote on a question post. So no, they do not outweigh one another at all. I agree that downvoters ought to explain their reasons. But undoing votes is a moderator privilege (at least I think they can do that), and not something we should go around doing all willy nilly. Upvote if you genuinely think the post deserves it (I don't think it does). Not to undo a downvote.
$endgroup$
– Arthur
Dec 28 '18 at 23:31
2
$begingroup$
@RobArthan Also, sociopath is a very strong word. Please refrain from using the names of actual mental diagnoses on what's likely just laziness or apathy. Or possibly being a jerk.
$endgroup$
– Arthur
Dec 29 '18 at 0:22
$begingroup$
Alright for those who were wondering. An employer posted a puzzle to find the elusive 11 digit Fibonacci Prime. in regards to a network security job. Thing is I know the tools I just dont know the Fibonacci. So I came here seeking out some help.
$endgroup$
– CodeMonkeyAlx
Dec 29 '18 at 0:49
|
show 3 more comments
$begingroup$
I am having difficulty finding the first eleven-digit prime number of Fibonacci..
If anyone has an answer I would greatly appreciate it.
I'm mostly asking this because it's one part of a greater puzzle I am trying to solve..
fibonacci-numbers
edited Dec 28 '18 at 23:35
David G. Stork
11k41432
asked Dec 28 '18 at 23:05
CodeMonkeyAlxCodeMonkeyAlx
1152
$endgroup$
I am having difficulty finding the first eleven-digit prime number of Fibonacci..
If anyone has an answer I would greatly appreciate it.
I'm mostly asking this because it's one part of a greater puzzle I am trying to solve..
fibonacci-numbers
fibonacci-numbers
edited Dec 28 '18 at 23:35
David G. Stork
11k41432
asked Dec 28 '18 at 23:05
CodeMonkeyAlxCodeMonkeyAlx
1152
edited Dec 28 '18 at 23:35
David G. Stork
11k41432
asked Dec 28 '18 at 23:05
CodeMonkeyAlxCodeMonkeyAlx
1152
edited Dec 28 '18 at 23:35
David G. Stork
11k41432
edited Dec 28 '18 at 23:35
David G. Stork
11k41432
edited Dec 28 '18 at 23:35
David G. Stork
11k41432
11k41432
asked Dec 28 '18 at 23:05
CodeMonkeyAlxCodeMonkeyAlx
1152
asked Dec 28 '18 at 23:05
CodeMonkeyAlxCodeMonkeyAlx
1152
asked Dec 28 '18 at 23:05
CodeMonkeyAlxCodeMonkeyAlx
1152
1152
2
$begingroup$
There are no eleven-digit Fibonacci primes: oeis.org/A005478 There is, however, a 10-digit Fibonacci prime: $2971215073$
$endgroup$
– Noble Mushtak
Dec 28 '18 at 23:07
$begingroup$
@RobArthan That's not how upvotes work. If you feel that this post is a good post (i.e. that it includes things like showing genuine effort, either work or research, and some context so that you, for instance, don't have to guess whether it's a coding problem) you are free to upvote. But they do not cancel eachother out, and they're not meant to.
$endgroup$
– Arthur
Dec 28 '18 at 23:16
$begingroup$
@RobArthan I can see that it's one vote up and one down, rather than none. And you get 5 reputation for an upvote and lose 2 for a downvote on a question post. So no, they do not outweigh one another at all. I agree that downvoters ought to explain their reasons. But undoing votes is a moderator privilege (at least I think they can do that), and not something we should go around doing all willy nilly. Upvote if you genuinely think the post deserves it (I don't think it does). Not to undo a downvote.
$endgroup$
– Arthur
Dec 28 '18 at 23:31
2
$begingroup$
@RobArthan Also, sociopath is a very strong word. Please refrain from using the names of actual mental diagnoses on what's likely just laziness or apathy. Or possibly being a jerk.
$endgroup$
– Arthur
Dec 29 '18 at 0:22
$begingroup$
Alright for those who were wondering. An employer posted a puzzle to find the elusive 11 digit Fibonacci Prime. in regards to a network security job. Thing is I know the tools I just dont know the Fibonacci. So I came here seeking out some help.
$endgroup$
– CodeMonkeyAlx
Dec 29 '18 at 0:49
|
show 3 more comments
2
$begingroup$
There are no eleven-digit Fibonacci primes: oeis.org/A005478 There is, however, a 10-digit Fibonacci prime: $2971215073$
$endgroup$
– Noble Mushtak
Dec 28 '18 at 23:07
$begingroup$
@RobArthan That's not how upvotes work. If you feel that this post is a good post (i.e. that it includes things like showing genuine effort, either work or research, and some context so that you, for instance, don't have to guess whether it's a coding problem) you are free to upvote. But they do not cancel eachother out, and they're not meant to.
$endgroup$
– Arthur
Dec 28 '18 at 23:16
$begingroup$
@RobArthan I can see that it's one vote up and one down, rather than none. And you get 5 reputation for an upvote and lose 2 for a downvote on a question post. So no, they do not outweigh one another at all. I agree that downvoters ought to explain their reasons. But undoing votes is a moderator privilege (at least I think they can do that), and not something we should go around doing all willy nilly. Upvote if you genuinely think the post deserves it (I don't think it does). Not to undo a downvote.
$endgroup$
– Arthur
Dec 28 '18 at 23:31
2
$begingroup$
@RobArthan Also, sociopath is a very strong word. Please refrain from using the names of actual mental diagnoses on what's likely just laziness or apathy. Or possibly being a jerk.
$endgroup$
– Arthur
Dec 29 '18 at 0:22
$begingroup$
Alright for those who were wondering. An employer posted a puzzle to find the elusive 11 digit Fibonacci Prime. in regards to a network security job. Thing is I know the tools I just dont know the Fibonacci. So I came here seeking out some help.
$endgroup$
– CodeMonkeyAlx
Dec 29 '18 at 0:49
2
2
$begingroup$
There are no eleven-digit Fibonacci primes: oeis.org/A005478 There is, however, a 10-digit Fibonacci prime: $2971215073$
$endgroup$
– Noble Mushtak
Dec 28 '18 at 23:07
$begingroup$
There are no eleven-digit Fibonacci primes: oeis.org/A005478 There is, however, a 10-digit Fibonacci prime: $2971215073$
$endgroup$
– Noble Mushtak
Dec 28 '18 at 23:07
$begingroup$
@RobArthan That's not how upvotes work. If you feel that this post is a good post (i.e. that it includes things like showing genuine effort, either work or research, and some context so that you, for instance, don't have to guess whether it's a coding problem) you are free to upvote. But they do not cancel eachother out, and they're not meant to.
$endgroup$
– Arthur
Dec 28 '18 at 23:16
$begingroup$
@RobArthan That's not how upvotes work. If you feel that this post is a good post (i.e. that it includes things like showing genuine effort, either work or research, and some context so that you, for instance, don't have to guess whether it's a coding problem) you are free to upvote. But they do not cancel eachother out, and they're not meant to.
$endgroup$
– Arthur
Dec 28 '18 at 23:16
$begingroup$
@RobArthan I can see that it's one vote up and one down, rather than none. And you get 5 reputation for an upvote and lose 2 for a downvote on a question post. So no, they do not outweigh one another at all. I agree that downvoters ought to explain their reasons. But undoing votes is a moderator privilege (at least I think they can do that), and not something we should go around doing all willy nilly. Upvote if you genuinely think the post deserves it (I don't think it does). Not to undo a downvote.
$endgroup$
– Arthur
Dec 28 '18 at 23:31
$begingroup$
@RobArthan I can see that it's one vote up and one down, rather than none. And you get 5 reputation for an upvote and lose 2 for a downvote on a question post. So no, they do not outweigh one another at all. I agree that downvoters ought to explain their reasons. But undoing votes is a moderator privilege (at least I think they can do that), and not something we should go around doing all willy nilly. Upvote if you genuinely think the post deserves it (I don't think it does). Not to undo a downvote.
$endgroup$
– Arthur
Dec 28 '18 at 23:31
2
2
$begingroup$
@RobArthan Also, sociopath is a very strong word. Please refrain from using the names of actual mental diagnoses on what's likely just laziness or apathy. Or possibly being a jerk.
$endgroup$
– Arthur
Dec 29 '18 at 0:22
$begingroup$
@RobArthan Also, sociopath is a very strong word. Please refrain from using the names of actual mental diagnoses on what's likely just laziness or apathy. Or possibly being a jerk.
$endgroup$
– Arthur
Dec 29 '18 at 0:22
$begingroup$
Alright for those who were wondering. An employer posted a puzzle to find the elusive 11 digit Fibonacci Prime. in regards to a network security job. Thing is I know the tools I just dont know the Fibonacci. So I came here seeking out some help.
$endgroup$
– CodeMonkeyAlx
Dec 29 '18 at 0:49
$begingroup$
Alright for those who were wondering. An employer posted a puzzle to find the elusive 11 digit Fibonacci Prime. in regards to a network security job. Thing is I know the tools I just dont know the Fibonacci. So I came here seeking out some help.
$endgroup$
– CodeMonkeyAlx
Dec 29 '18 at 0:49
|
show 3 more comments
2 Answers
2
active
oldest
votes
$begingroup$
It is a standard result that if the $n$-th Fibonacci number is prime, then $n$ is prime, unless $n=4$. This makes the search much easier.
The Fibonacci number $F_{47}$ has 10 digits, and the Fibonacci number $F_{59}$ has 12 digits. (this is easy to check by direct computation, or using the approximation $F_n approx phi^n / sqrt{5}$.) There is only one prime between $47$ and $59$, namely $53$.
So all we have to check is whether $F_{53}$ is prime. But with a computer, it is easy to find that $953$ is a factor.
We can conclude that there are no 11-digit Fibonacci primes.
answered Dec 29 '18 at 4:16
SladeSlade
25.2k12665
$endgroup$
add a comment |
$begingroup$
Here are the Fibonacci primes:
Select[Table[Fibonacci[i], {i, 1, 200}], PrimeQ]
${2, 3, 5, 13, 89, 233, 1597, 28657, 514229, 433494437,$
$ 2971215073, 99194853094755497, 1066340417491710595814572169,$
$ 19134702400093278081449423917 }$
answered Dec 28 '18 at 23:18
David G. StorkDavid G. Stork
11k41432
$endgroup$
$begingroup$
OP asked for an 11 digit prime number. The fact that your number ends in $5$ may suggest that you have made a mistake.
$endgroup$
– Mohammad Zuhair Khan
Dec 28 '18 at 23:57
$begingroup$
@OscarLanzi Please check the edit history.
$endgroup$
– Mohammad Zuhair Khan
Dec 29 '18 at 0:10
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3055369%2fwhat-is-the-first-11-digit-prime-of-fibonacci%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
It is a standard result that if the $n$-th Fibonacci number is prime, then $n$ is prime, unless $n=4$. This makes the search much easier.
The Fibonacci number $F_{47}$ has 10 digits, and the Fibonacci number $F_{59}$ has 12 digits. (this is easy to check by direct computation, or using the approximation $F_n approx phi^n / sqrt{5}$.) There is only one prime between $47$ and $59$, namely $53$.
So all we have to check is whether $F_{53}$ is prime. But with a computer, it is easy to find that $953$ is a factor.
We can conclude that there are no 11-digit Fibonacci primes.
answered Dec 29 '18 at 4:16
SladeSlade
25.2k12665
$endgroup$
add a comment |
$begingroup$
It is a standard result that if the $n$-th Fibonacci number is prime, then $n$ is prime, unless $n=4$. This makes the search much easier.
The Fibonacci number $F_{47}$ has 10 digits, and the Fibonacci number $F_{59}$ has 12 digits. (this is easy to check by direct computation, or using the approximation $F_n approx phi^n / sqrt{5}$.) There is only one prime between $47$ and $59$, namely $53$.
So all we have to check is whether $F_{53}$ is prime. But with a computer, it is easy to find that $953$ is a factor.
We can conclude that there are no 11-digit Fibonacci primes.
answered Dec 29 '18 at 4:16
SladeSlade
25.2k12665
$endgroup$
add a comment |
$begingroup$
It is a standard result that if the $n$-th Fibonacci number is prime, then $n$ is prime, unless $n=4$. This makes the search much easier.
The Fibonacci number $F_{47}$ has 10 digits, and the Fibonacci number $F_{59}$ has 12 digits. (this is easy to check by direct computation, or using the approximation $F_n approx phi^n / sqrt{5}$.) There is only one prime between $47$ and $59$, namely $53$.
So all we have to check is whether $F_{53}$ is prime. But with a computer, it is easy to find that $953$ is a factor.
We can conclude that there are no 11-digit Fibonacci primes.
answered Dec 29 '18 at 4:16
SladeSlade
25.2k12665
$endgroup$
It is a standard result that if the $n$-th Fibonacci number is prime, then $n$ is prime, unless $n=4$. This makes the search much easier.
The Fibonacci number $F_{47}$ has 10 digits, and the Fibonacci number $F_{59}$ has 12 digits. (this is easy to check by direct computation, or using the approximation $F_n approx phi^n / sqrt{5}$.) There is only one prime between $47$ and $59$, namely $53$.
So all we have to check is whether $F_{53}$ is prime. But with a computer, it is easy to find that $953$ is a factor.
We can conclude that there are no 11-digit Fibonacci primes.
answered Dec 29 '18 at 4:16
SladeSlade
25.2k12665
answered Dec 29 '18 at 4:16
SladeSlade
25.2k12665
answered Dec 29 '18 at 4:16
SladeSlade
25.2k12665
answered Dec 29 '18 at 4:16
SladeSlade
25.2k12665
25.2k12665
add a comment |
add a comment |
$begingroup$
Here are the Fibonacci primes:
Select[Table[Fibonacci[i], {i, 1, 200}], PrimeQ]
${2, 3, 5, 13, 89, 233, 1597, 28657, 514229, 433494437,$
$ 2971215073, 99194853094755497, 1066340417491710595814572169,$
$ 19134702400093278081449423917 }$
answered Dec 28 '18 at 23:18
David G. StorkDavid G. Stork
11k41432
$endgroup$
$begingroup$
OP asked for an 11 digit prime number. The fact that your number ends in $5$ may suggest that you have made a mistake.
$endgroup$
– Mohammad Zuhair Khan
Dec 28 '18 at 23:57
$begingroup$
@OscarLanzi Please check the edit history.
$endgroup$
– Mohammad Zuhair Khan
Dec 29 '18 at 0:10
add a comment |
$begingroup$
Here are the Fibonacci primes:
Select[Table[Fibonacci[i], {i, 1, 200}], PrimeQ]
${2, 3, 5, 13, 89, 233, 1597, 28657, 514229, 433494437,$
$ 2971215073, 99194853094755497, 1066340417491710595814572169,$
$ 19134702400093278081449423917 }$
answered Dec 28 '18 at 23:18
David G. StorkDavid G. Stork
11k41432
$endgroup$
$begingroup$
OP asked for an 11 digit prime number. The fact that your number ends in $5$ may suggest that you have made a mistake.
$endgroup$
– Mohammad Zuhair Khan
Dec 28 '18 at 23:57
$begingroup$
@OscarLanzi Please check the edit history.
$endgroup$
– Mohammad Zuhair Khan
Dec 29 '18 at 0:10
add a comment |
$begingroup$
Here are the Fibonacci primes:
Select[Table[Fibonacci[i], {i, 1, 200}], PrimeQ]
${2, 3, 5, 13, 89, 233, 1597, 28657, 514229, 433494437,$
$ 2971215073, 99194853094755497, 1066340417491710595814572169,$
$ 19134702400093278081449423917 }$
answered Dec 28 '18 at 23:18
David G. StorkDavid G. Stork
11k41432
$endgroup$
Here are the Fibonacci primes:
Select[Table[Fibonacci[i], {i, 1, 200}], PrimeQ]
${2, 3, 5, 13, 89, 233, 1597, 28657, 514229, 433494437,$
$ 2971215073, 99194853094755497, 1066340417491710595814572169,$
$ 19134702400093278081449423917 }$
answered Dec 28 '18 at 23:18
David G. StorkDavid G. Stork
11k41432
edited Dec 29 '18 at 0:19
answered Dec 28 '18 at 23:18
David G. StorkDavid G. Stork
11k41432
answered Dec 28 '18 at 23:18
David G. StorkDavid G. Stork
11k41432
answered Dec 28 '18 at 23:18
David G. StorkDavid G. Stork
11k41432
11k41432
$begingroup$
OP asked for an 11 digit prime number. The fact that your number ends in $5$ may suggest that you have made a mistake.
$endgroup$
– Mohammad Zuhair Khan
Dec 28 '18 at 23:57
$begingroup$
@OscarLanzi Please check the edit history.
$endgroup$
– Mohammad Zuhair Khan
Dec 29 '18 at 0:10
add a comment |
$begingroup$
OP asked for an 11 digit prime number. The fact that your number ends in $5$ may suggest that you have made a mistake.
$endgroup$
– Mohammad Zuhair Khan
Dec 28 '18 at 23:57
$begingroup$
@OscarLanzi Please check the edit history.
$endgroup$
– Mohammad Zuhair Khan
Dec 29 '18 at 0:10
$begingroup$
OP asked for an 11 digit prime number. The fact that your number ends in $5$ may suggest that you have made a mistake.
$endgroup$
– Mohammad Zuhair Khan
Dec 28 '18 at 23:57
$begingroup$
OP asked for an 11 digit prime number. The fact that your number ends in $5$ may suggest that you have made a mistake.
$endgroup$
– Mohammad Zuhair Khan
Dec 28 '18 at 23:57
$begingroup$
@OscarLanzi Please check the edit history.
$endgroup$
– Mohammad Zuhair Khan
Dec 29 '18 at 0:10
$begingroup$
@OscarLanzi Please check the edit history.
$endgroup$
– Mohammad Zuhair Khan
Dec 29 '18 at 0:10
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3055369%2fwhat-is-the-first-11-digit-prime-of-fibonacci%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
$begingroup$
There are no eleven-digit Fibonacci primes: oeis.org/A005478 There is, however, a 10-digit Fibonacci prime: $2971215073$
$endgroup$
– Noble Mushtak
Dec 28 '18 at 23:07
$begingroup$
@RobArthan That's not how upvotes work. If you feel that this post is a good post (i.e. that it includes things like showing genuine effort, either work or research, and some context so that you, for instance, don't have to guess whether it's a coding problem) you are free to upvote. But they do not cancel eachother out, and they're not meant to.
$endgroup$
– Arthur
Dec 28 '18 at 23:16
$begingroup$
@RobArthan I can see that it's one vote up and one down, rather than none. And you get 5 reputation for an upvote and lose 2 for a downvote on a question post. So no, they do not outweigh one another at all. I agree that downvoters ought to explain their reasons. But undoing votes is a moderator privilege (at least I think they can do that), and not something we should go around doing all willy nilly. Upvote if you genuinely think the post deserves it (I don't think it does). Not to undo a downvote.
$endgroup$
– Arthur
Dec 28 '18 at 23:31
2
$begingroup$
@RobArthan Also, sociopath is a very strong word. Please refrain from using the names of actual mental diagnoses on what's likely just laziness or apathy. Or possibly being a jerk.
$endgroup$
– Arthur
Dec 29 '18 at 0:22
$begingroup$
Alright for those who were wondering. An employer posted a puzzle to find the elusive 11 digit Fibonacci Prime. in regards to a network security job. Thing is I know the tools I just dont know the Fibonacci. So I came here seeking out some help.
$endgroup$
– CodeMonkeyAlx
Dec 29 '18 at 0:49