Question

Find all positive integers $n$ such that $72|(10^n+8)$

score 45 · Answer 1 · 2016-11-20 13:52:15

45

Views

Find all positive integers $n$ such that $72|(10^n+8)$

Published on 20 Nov 2016 - 13:52

score 692 · Answer 2 · 2026-03-25 15:24:42

692

Views

Example on Euler Totient function

Published on 25 Mar 2026 - 15:24

score 888 · Answer 3 · 2016-11-20 20:35:10

888

Views

Show that if n divides m where n and m are positive ints greater than 1, then a ≡ b (mod m) implies a ≡ b (mod n) for any positive integers a and b

Published on 20 Nov 2016 - 20:35

score 477 · Answer 4 · 2016-11-21 10:30:40

477

Views

Proving $n!$ is never divisible by $2^n$

Published on 21 Nov 2016 - 10:30

score 128 · Answer 5 · 2016-11-21 19:41:24

128

Views

Find all numbers $n\in \{ 1,...,100 \}$ which have 5 unique divisors.

Published on 21 Nov 2016 - 19:41

score 327 · Answer 6 · 2016-11-22 06:48:51

327

Views

Prove that if $a$ is odd, then $a^2\equiv 1\pmod 8$

Published on 22 Nov 2016 - 6:48

score 334 · Answer 7 · 2016-11-22 18:43:09

334

Views

Show that there are infinitely many positive integers $k$ such that

Published on 22 Nov 2016 - 18:43

score 85 · Answer 8 · 2016-11-23 09:54:50

85

Views

Prove: $2005|\underbrace{5 5\cdots 5}_{800\text{ digits}}$

Published on 23 Nov 2016 - 9:54

score 83 · Answer 9 · 2016-11-23 22:09:05

$\forall n\in\mathbb N$ prove that at least one of the number $3^{3n}-2^{3n}$,$3^{3n}+2^{3n}$ is divisible by $35$.

score 430 · Answer 10 · 2026-03-26 06:29:09

430

Views

Sexagesimal Reciprocals - Confused About Floating Point Reciprocals

Published on 26 Mar 2026 - 6:29

score 313 · Answer 11 · 2026-03-25 09:16:59

313

Views

The smallest Fibonacci number that can be divided by $2^m$

Published on 25 Mar 2026 - 9:16

score 13 · Answer 12 · 2026-03-01 05:19:04

13

Views

Calculating new value in increased serving size

Published on 01 Mar 2026 - 5:19

score 1.4k · Answer 13 · 2026-04-02 00:13:25

1.4k

Views

Show that the divisibility relation $\text{ | }$ is an ordering relation in $\mathbb{N}$

Published on 02 Apr 2026 - 0:13

score 47 · Answer 14 · 2016-11-26 18:21:34

47

Views

Determine remainder when dividing polynomials if we know other remainders

Published on 26 Nov 2016 - 18:21

score 238 · Answer 15 · 2016-11-27 03:01:15

238

Views

How do I prove $11\mid 2^{6n+1}+3^{2n + 2}$ by induction?

Published on 27 Nov 2016 - 3:01

List Question

Find all positive integers $n$ such that $72|(10^n+8)$

Example on Euler Totient function

Show that if n divides m where n and m are positive ints greater than 1, then a ≡ b (mod m) implies a ≡ b (mod n) for any positive integers a and b

Proving $n!$ is never divisible by $2^n$

Find all numbers $n\in \{ 1,...,100 \}$ which have 5 unique divisors.

Prove that if $a$ is odd, then $a^2\equiv 1\pmod 8$

Show that there are infinitely many positive integers $k$ such that

Prove: $2005|\underbrace{5 5\cdots 5}_{800\text{ digits}}$

$\forall n\in\mathbb N$ prove that at least one of the number $3^{3n}-2^{3n}$,$3^{3n}+2^{3n}$ is divisible by $35$.

Sexagesimal Reciprocals - Confused About Floating Point Reciprocals

The smallest Fibonacci number that can be divided by $2^m$

Calculating new value in increased serving size

Show that the divisibility relation $\text{ | }$ is an ordering relation in $\mathbb{N}$

Determine remainder when dividing polynomials if we know other remainders

How do I prove $11\mid 2^{6n+1}+3^{2n + 2}$ by induction?

Trending Questions

Popular # Hahtags

Popular Questions