Talk:Lucas sequence: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Hendra I. Nurdin
imported>Karsten Meyer
No edit summary
 
(6 intermediate revisions by 3 users not shown)
Line 1: Line 1:
{{subpages}}
==Equality==
==Equality==
<math>V_p(a_2+1,a_2) \equiv V_1(a_2+1,a_2)</math> is equal to <math>a_2^p \equiv a_2 \mod p</math>
<math>V_p(a_2+1,a_2) \equiv V_1(a_2+1,a_2) \pmod p</math> is equal to <math>a_2^p \equiv a_2 \pmod p</math>


Proof:
Proof:
Line 14: Line 15:
Follows:
Follows:


<math>V_n(a_2+1,a) = a_2^n + 1\ </math>
<math>V_n(a_2+1,a_2) = a_2^n + 1\ </math>


follows:
follows:


<math>V_p(a_2+1,a) - V_1(a_2+1,a) = a_2^p + 1 - (a_2 + 1) = a_2^p - a_2\ </math>
<math>V_p(a_2+1,a_2) - V_1(a_2+1,a_2) = a_2^p + 1 - (a_2 + 1) = a_2^p - a_2\ </math>


--[[User:Karsten Meyer|arbol01]] 21:33, 15 November 2007 (CST)
--[[User:Karsten Meyer|arbol01]] 21:33, 15 November 2007 (CST)
Line 24: Line 25:
==Improvement of readability==
==Improvement of readability==
Please do not be offended, but this article was not so readable due to the poor use of English. I've tried to help improve the presentation of this article. --[[User:Hendra I. Nurdin|Hendra]] 07:34, 17 November 2007 (CST)
Please do not be offended, but this article was not so readable due to the poor use of English. I've tried to help improve the presentation of this article. --[[User:Hendra I. Nurdin|Hendra]] 07:34, 17 November 2007 (CST)
:Oh, i am not offended. I am german, and i know about my foibles. I am very grateful to every help, i can get. --[[User:Karsten Meyer|arbol01]] 08:03, 17 November 2007 (CST)
==ggT==
What is "ggT" used in the article (see "Properties")? [[User:Aleksander Stos|Aleksander Stos]] 10:11, 8 December 2007 (CST)
:I am sorry! ggT (größter gemeinsamer Teiler) is the german name for gcd (greatest common divisor).I fix it. --[[User:Karsten Meyer|arbol01]] 19:42, 8 December 2007 (CST)

Latest revision as of 20:42, 8 December 2007

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition A particular generalisation of sequences like the Fibonacci numbers, Lucas numbers, Pell numbers or Jacobsthal numbers. [d] [e]
Checklist and Archives
 Workgroup category Mathematics [Categories OK]
 Talk Archive none  English language variant British English

Equality

is equal to

Proof:

and

and

Follows:

follows:

--arbol01 21:33, 15 November 2007 (CST)

Improvement of readability

Please do not be offended, but this article was not so readable due to the poor use of English. I've tried to help improve the presentation of this article. --Hendra 07:34, 17 November 2007 (CST)

Oh, i am not offended. I am german, and i know about my foibles. I am very grateful to every help, i can get. --arbol01 08:03, 17 November 2007 (CST)

ggT

What is "ggT" used in the article (see "Properties")? Aleksander Stos 10:11, 8 December 2007 (CST)

I am sorry! ggT (größter gemeinsamer Teiler) is the german name for gcd (greatest common divisor).I fix it. --arbol01 19:42, 8 December 2007 (CST)