GigaCode logo GigaCode

Developer tools, fast and local, because your privacy matters.

QR Code Generator CPF/CNPJ Generator JSON Formatter & Validator Fluff text generator JWT Decoder SQL Formatter Text diff CSS Units Converter Base64 Encoder/Decoder SVG to PNG or JPEG converter JPG/PNG ↔ WebP converter Image resizer Grayscale image filter

Arithmetic and geometric progression

Calculate nth term and sum in arithmetic and geometric progression.

{{ t("mathProgressionArithmeticHelp") }}

{{ t("mathProgressionGeometricHelp") }}

{{ progressionCalc.message }}

Overview

AP uses constant difference and GP uses constant ratio.

Provide a1, ratio, and n to compute nth term and sum of first n terms.

Technical deep dive

Common questions summarized

  • What is this tool for?: It runs fully in your browser: useful to validate, format, or convert data in everyday development.
  • Are my inputs sent to a server?: Processing happens locally with JavaScript. We do not store what you paste into the text areas.
  • Can I use this for real production data?: Use at your own risk. For secrets (passwords, tokens), prefer controlled environments and your company policies. And always review the generated contents. Never trust blindly things you see on the internet.

Sample payload to try

  • See also the larger "Code Snippets" sample; paste this excerpt to try locally: Example — PA: a1=2, r=3, n=5 an=14, Sn=40

Code Snippets

Code example
PA: a1=2, r=3, n=5
an=14, Sn=40

Example 

PA: a1=2, r=3, n=5
an=14, Sn=40

FAQ

What is this tool for?

It runs fully in your browser: useful to validate, format, or convert data in everyday development.

Are my inputs sent to a server?

Processing happens locally with JavaScript. We do not store what you paste into the text areas.

Can I use this for real production data?

Use at your own risk. For secrets (passwords, tokens), prefer controlled environments and your company policies. And always review the generated contents. Never trust blindly things you see on the internet.

GigaCode global FAQ