Tagged Questions
3
votes
0answers
86 views
Which starting conditions for the Fibonacci sequence, gives most primes
I found the following question (at http://aperiodical.com/2012/05/matt-parkers-twitter-puzzle-25-may/):
If you start the Fibonacci sequence 2,1 instead of 1,1 do you get more
or fewer primes?
...
4
votes
1answer
232 views
What is the next “Tribonacci-like” pseudoprime?
Given the three roots of $x^3=x^2+x+1$. Then we get the tribonacci-like sequence,
$B_n = x_1^n+x_2^n+x_3^n = 3, 1, 3, 7, 11, 21, 39, 71, 131,\dots$
where $B_n = B_{n-1}+B_{n-2}+B_{n-3}$, and the ...
2
votes
1answer
212 views
Prime power divisors of the fibonacci numbers
I came across a result that if $p^n \mid f_m$ for some $n\geq1$ then $p^{n+1} \mid f_{pm}$. I was wondering if this is true.
5
votes
4answers
238 views
Prime Appearances in Fibonacci Number Factorizations
Okay, THIS one is considerably more analytical... :P
(Used my post here as a basis.)
When successive Fibonacci numbers are factored, the primes appear in a specific order, which goes
$2, 3, 5, 13, 7, ...
4
votes
1answer
100 views
Prove that If $f_n$ where $n>3$ is prime, then $n$ is prime for a Fibonacci series where $f_1$=$f_2$=1
This problem came up in my conversation with a friend—not sure how basic it is, but it seems quite interesting:
Prove that if $f_n$ where $n>3$ is prime, then $n$ is prime for a Fibonacci sequence ...
