mersenneforum.org Lucas number cubic and quadratic reciprocity
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2018-06-27, 03:12 #1 carpetpool     "Sam" Nov 2016 2×3×53 Posts Lucas number cubic and quadratic reciprocity If q is a Sophie Germain prime (p = 2*q+1 is also prime), then it is well known that a^q = 1 modulo p if and only if a is a quadratic residue modulo p (leave a = 0, 1, -1 aside as special cases). In the same sense, if q is a prime, and p = q*k+1 is also prime, then a^q = 1 modulo p if and only if a is a k-th power residue modulo p. Equivalently stated, the former is true if and only if x^k = a modulo p is solvable. This is a nice and easy "reciprocity" law to determine weather or not p divides a^q-1. Is it possible to apply some kind of "reciprocity" law to the Lucas numbers and their generalizations such as the Companion-Pell numbers and Lucas Polynomial sequences? Let L(n) be the nth Lucas Number. If q is a Sophie Germain prime and p = 2*q+1, then p divides L(q) if and only if p = q = 4 modulo 5. What if q and p = q*k+1 are primes where k > 2? What is the "reciprocity" law to determine weather or not p divides L(q) for given primes p,q with the conditions above? For instance, if p = 6*q+1 where p and q are primes, already given that p = 4 modulo 5, what other rule is there to determine weather or not p divides L(q) or it divides L(3*q)?

 Similar Threads Thread Thread Starter Forum Replies Last Post Nick Number Theory Discussion Group 4 2017-03-27 06:01 Nick Number Theory Discussion Group 0 2017-01-31 14:41 Raman Math 1 2012-09-12 13:21 LLL mersennewiki 1 2008-12-16 15:34 wpolly Math 0 2004-12-01 11:14

All times are UTC. The time now is 16:16.

Tue Nov 24 16:16:26 UTC 2020 up 75 days, 13:27, 4 users, load averages: 2.23, 1.92, 1.80