tabacus

Welcome to tabacus!

Thanks for trying out our beta!

As a sign of our gratitude, we've given you free access to all Pro features for the duration of the beta, and you'll get an exclusive discount when the app is fully released.

Expect frequent updates and fixes. We're working hard to make the app as good as possible, so any feedback is highly appreciated!

By using tabacus you agree to the Terms of Service and Privacy Policy.

Send feedback

Your profile

A square crop is kept, 256 × 256.
Change password

Leave both blank to keep your password. You don't need your old one: choose a new password here and save. Never set one? This sets it.

Clear this sheet?

You can undo it for a few seconds afterward.

Delete your account?

This permanently deletes the account and everything saved to it: your synced sheets, equations, materials and constants, your profile and picture, saved files, and connected AI apps. It can't be undone.

The work open in this browser stays here.

Save document

Open a document

Draw a molecule

Click an atom to grow a chain, drag from it to draw a bond, click a bond to make it double or triple. Keys: C N O S, 1 2 3 for bonds, B for benzene, E to erase.

Export this tab


    

Prove 6 divides 7^n - 1

Tabacus proves that 6 divides 7^n - 1 for all n by induction, exhibiting the divisor explicitly at each step.

Answer. Claim: 6 | 7^n-1, for all n ≥ 1.

Worked solution

Claim: 6 | 7^n-1, for all n ≥ 1.

Proof. By induction on n.

Base case (n = 1): 7^1-1 = 6 = 6·1, which is divisible by 6.

Inductive hypothesis: assume 6 | 7^k-1 for some integer k ≥ 1; that is, 7^k-1 = 6r for some integer r.

Inductive step: we show 6 | 7^(k+1)-1.
  7^(k+1)-1
    = 7·7^k-1      [since 7^(k+1) = 7·7^k]
    = 6·7^k + (7^k-1)      [grouping the multiple of 6]
    = 6·7^k + 6r      [by the inductive hypothesis, 7^k-1 = 6r]
    = 6(7^k + r),
  which is divisible by 6 because 7^k + r is an integer.

By the principle of induction, 6 | 7^n-1 for all n ≥ 1. ∎

Frequently asked questions

Is 7^n - 1 always divisible by 6?

Yes, for every positive integer n, and the proof is by induction.

What is the inductive step?

Show 6 divides the difference between consecutive terms, so divisibility carries from k to k+1.

Related tools

All tabacus tools

The calculator above is already loaded with this problem, edit it or type your own.