All Tools
Categories
Number Tools 69 XML Tools 64 Email Marketing Tools 55 Import-Export Tools 50 JSON Tools 45 Text Tools 13 Shipping Freight Tools 5 Calculator 4
About Contact Privacy

Lucas Prime Test

Free Lucas prime checker. Test any number - 7, 47, 521, 2207 - and learn whether it is a Lucas number, prime, or both. Exact BigInt membership via 5n squared +/- 20, Miller-Rabin primality, index lookup, batches up to 10,000. Runs in your browser. No sign-up.

Number(s)
Two exact tests: Lucas membership via 5n² ± 20, primality via Miller-Rabin — both BigInt-exact.
Verdicts

          

About Lucas Prime Test

A Lucas prime must satisfy two separate questions at once: does it belong to the Lucas sequence 2, 1, 3, 4, 7, 11, 18, 29, 47... and does it have only one and itself as divisors? Small answers are easy — 7, 47, 199 — but traps wait everywhere: 18 is Lucas and not prime, 29 is both, 5 is prime and never Lucas, and even 2207, the ninth Lucas prime, fools the unaided eye. Membership alone never decides anything.

Lucas Prime Test runs both checks exactly. The Lucas square identity — 5n squared ± 20 a perfect square — decides membership and the index; a twelve-base Miller-Rabin test decides primality on BigInt values, immune to rounding. Verdicts come as one of four labels, batches of 10,000 values run in a single pass, and nothing ever leaves the browser.

Features

  • Four exact verdicts: Lucas prime, Lucas composite, plain prime, or neither — never a vague answer.
  • Exact membership: The Lucas square identity 5n² ± 20 with BigInt square roots.
  • Exact primality: Miller-Rabin, twelve prime bases, deterministic below 3.3 x 10^24.
  • Index retrieval: Every Lucas verdict reports its k, from L(4) = 7 to L(16) = 2207 and beyond.
  • Special cases: 1 is L(1) yet not prime; 0 is not Lucas at all — both handled explicitly.
  • Batch testing: Up to 10,000 values per run, each with independent verdict and detail.
  • Copy or download: Verdict list and numbers list, both one-click exports.
  • Reference tab: Known Lucas primes, the filters, the Fibonacci connection.
  • Free and private: Everything runs locally in the browser; nothing is uploaded or stored.

How to Use

  1. Enter numbers — one per line, or a batch separated by commas or spaces.
  2. Read the verdict badge — Lucas prime, Lucas composite, prime, or neither.
  3. See the index — Lucas values carry their exact k with L(k) = n.
  4. Follow the detail — which square candidate passed and which primality path decided.
  5. Copy or download the results for research, teaching or further analysis.

Examples

Example 1 — The first answers. Enter 7, 47 and 199. All three return Lucas prime at indexes 4, 8 and 11 — three of the first nine Lucas primes.

Example 2 — The traps. Enter 18 and 123. Both are Lucas but composite: 18 = 2 x 3 x 3 and 123 = 3 x 41. The badge keeps membership and primality visibly separate.

Example 3 — The other side. Enter 5 and 29. 5 is prime but never Lucas; 29 is L(7) and prime — two verdicts that demand both tests.

Example 4 — A big verified jump. Enter 3010349. The tool reports Lucas prime at index 31 — a seven-digit value decided in milliseconds by the in-browser Miller-Rabin test.

Example 5 — Batch audit. Paste 2, 3, 5, 8, 18, 29, 47, 123, 199 together: the output mixes Lucas primes (2, 3, 29, 47, 199), Lucas composites (8, 18, 123) and the plain prime 5, exercising every verdict in one pass.

Benefits

  • Both tests, exact: Membership and primality are each proven, never guessed.
  • Lucas-verified fast: The square identity answers membership instantly, so the index arrives with the verdict.
  • Practical certainty: Deterministic Miller-Rabin bases cover the entire range ordinary numbers occupy.
  • Educational clarity: Indexes and explanation rows show exactly why each verdict holds.
  • Batch speed: Ten thousand candidates classified per run with per-line detail.
  • Private and free: Everything runs in the browser; nothing is uploaded, stored or logged.

Frequently Asked Questions

What is a Lucas prime?
A number that is both a member of the Lucas sequence 2, 1, 3, 4, 7, 11, 18, 29... and a prime. The small ones are L(0) = 2, L(2) = 3, L(4) = 7, L(5) = 11, L(7) = 29, L(8) = 47, L(11) = 199, L(13) = 521, L(16) = 2207 and L(17) = 3571.
How does the tool decide membership?
The Lucas analogue of the Fibonacci square test: n is a Lucas number exactly when 5n squared - 20 or 5n squared + 20 is a perfect square. The tool computes both with BigInt square roots, so 7, 47 and 2207 pass while near-misses like 8, 48 and 2206 fail.
How is primality decided?
Miller-Rabin with the first twelve prime bases, deterministically correct below 3.3 x 10^24 and probabilistically certain above. BigInt arithmetic means every verdict is exact for every size this tool accepts.
What are the verdicts?
Four: Lucas prime (both tests pass), Lucas but composite (like 18 or 123), prime but not Lucas (like 5), and neither. Rows also show the exact index when the number is a Lucas member.
Why are most Lucas numbers composite?
L(2m) candidates evaporate for structural reasons: indexes 2 mod 4 give multiples of 3 and indexes divisible by 3 give even values. Only odd indexes and indexes divisible by 4 survive — that is why primes are so sparse.
Can I check a batch?
Yes. Paste up to 10,000 numbers separated by new lines, commas or spaces. Each value gets its own verdict line with index and detail, and invalid entries are reported without stopping the rest.
How is the index found?
Membership via the square test returns the answer instantly; the index k with L(k) = n is then located by walking the recurrence — a handful of steps since Lucas values grow like golden-ratio powers.
What about 0 and 1?
0 is not a Lucas number at all. 1 is L(1), but 1 is neither prime nor composite — it receives an explicit verdict instead of a misclassification.
Is anything stored or uploaded?
No. Both tests run entirely in your browser with BigInt arithmetic. Nothing is sent to a server, saved or logged. Copy or download the results before closing the tab.