Free tools
Run it. Get results.
Free tools for networks, security, maps, money, maths and more. No sign-up, nothing to install.
No tool matches that. Try another word.
Network tools
DNS tools
Security tools
Developer tools
Math tools
Discrete mathematics
Food & drink
Everyday tools
Money tools
Space tools
Science tools
About the Recurrence relations solver
A recurrence relations solver: the terms of any recurrence in a(n − 1), a(n − 2)… and n, and the closed form for linear recurrences with constant coefficients (first order, and second order through the characteristic equation), checked against the terms.
How to use it
- Type the rule, e.g. 5a(n-1) - 6a(n-2) or a(n-1) + a(n-2).
- Type the starting values a(0), a(1)…
- Read the terms and the closed form.
Questions
How is the closed form found?
For a(n) = c₁a(n−1) + c₂a(n−2), from the roots of r² = c₁r + c₂: distinct, repeated or complex roots each give their own form.
Can it do Fibonacci?
Yes: a(n-1) + a(n-2) with 0, 1 gives the Fibonacci numbers and Binet's formula.
Logligent
Is your computer or server being attacked right now?
These tools answer one question at a time. Logligent watches your devices around the clock, and tells you the moment something isn't right.
- Every log line read as it arrives: brute force, web attacks, attack tools, malware and break-ins found and explained in plain words.
- Attackers blocked: by hand, automatically, or with the community blocklist of addresses attacking other customers.
- Security and health scores: for each device, with what to fix first.
- Told when something's wrong: a device stops reporting, a disk fills up, a new threat appears.
- Servers and personal computers: Linux, Windows, macOS and FreeBSD, with one small Collector.
Install in a minute (Linux, macOS, FreeBSD):
curl -fsSL https://logligent.com/install.sh | sudo sh -s -- --key lgk_…
Free plan, no credit card. Read the docs