TITLE: Original Lucas sequences primality test
QUESTION [5 upvotes]: When I found in Edouard Lucas' Wikipedia page that he proved that $2^{127}-1$ is prime by hand, I wanted to see how did he do it. Unfortunately, every piece of information I find is about the Lucas-Lehmer test, that is a version of his test refined by Lehmer.
Since I wanted to do some comparisons about how many it would take to do so with a computer and a high-school multiplication algorithm (according to Wikipedia it took him $19$ years by hand) the Lucas-Lehmer test is not exactly what I am looking for. So, finally, where can I find the original test?

REPLY [3 votes]: The relevant papers are:

"Théorie des Fonctions Numériques Simplement Périodiques [I]," American Journal of Mathematics , Vol. 1, No. 2 (1878), pp. 184-196.  http://www.jstor.org/stable/2369308
"Théorie des Fonctions Numériques Simplement Périodiques [II]," American Journal of Mathematics , Vol. 1, No. 4 (1878), pp. 289-321.  http://www.jstor.org/stable/2369373