New user? Sign up

Existing user? Sign in

Let \(n\geqslant 2\) and \(k\) be any positive integers. Prove that \((n-1)^2 | (n^k - 1) \) if and only if \((n-1) | k \).

Note by أحمد الحلاق 1 year ago

Easy Math Editor

*italics*

_italics_

**bold**

__bold__

- bulleted- list

1. numbered2. list

paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)

> This is a quote

This is a quote

# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"

2 \times 3

2^{34}

a_{i-1}

\frac{2}{3}

\sqrt{2}

\sum_{i=1}^3

\sin \theta

\boxed{123}

Sort by:

Just use the identity

\(\frac{n^k-1}{n-1}=n^{k-1}+\ldots+n^1+1\)

and take the resulting equation \(\text{mod n}\)

Log in to reply

Thank you so much

I mean \(\text{mod (n-1)}\)

Could you please provide a solution?

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestJust use the identity

\(\frac{n^k-1}{n-1}=n^{k-1}+\ldots+n^1+1\)

and take the resulting equation \(\text{mod n}\)

Log in to reply

Thank you so much

Log in to reply

I mean \(\text{mod (n-1)}\)

Log in to reply

Could you please provide a solution?

Log in to reply