Lucas numbers are similar to Fibonacci numbers , each number is defined to be the sum of its two previous terms. The first two Lucas numbers are as opposed to the first two Fibonacci numbers . (Assume the sequence is extended with initial term ).
The sequence of Lucas numbers is
How many prime Lucas numbers less than are there?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I did this by simply calculating the sequence that comes after.
The first few Lucas numbers are as follows.
0 = 2
1 = 1
2 = 3
3 = 4 = 2 X 2
4 = 7
5 = 1 1
6 = 1 8 = 2 X 2 X 3
7 = 2 9
8 = 4 7
9 = 7 6 = 2 X 2 X 1 9
1 0 = 1 2 3 = 3 X 4 1
1 1 = 1 9 9
1 2 = 3 2 2 = 2 X 7 X 2 3
1 3 = 5 2 1
1 4 = 8 4 3 = 3 X 2 8 1
1 5 = 1 3 6 4 = 2 2 X 1 1 X 3 1
1 6 = 2 2 0 7
1 7 = 3 5 7 1
1 8 = 5 7 7 8 = 2 X 3 3 X 1 0 7
1 9 = 9 3 4 9
2 0 = 1 5 1 2 7 = 7 X 2 1 6 1
As we can see, the 2 0 t h term exceeds 1 0 0 0 0 , therefore we can check whether the numbers before the 2 0 t h term are prime.