perplexus.info :: Just Math : 2 ways to prove it

2 ways to prove it (Posted on 2017-10-31)

For every positive integer n: 10ⁿ+18*n-1 is divisible by 27.

The above statement can be proven by more than one way.

Find at least 2 distinct methods.

No Solution Yet Submitted by Ady TZIDON

Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

Puzzle Solution: Method 1

| Comment 3 of 4 |

10^n + 18*n -1 10^n - 1 18*n

------------------------ = -------------- + ---------

9 9 9

= 11.....11 (n 1s) + 2*n

Now, {11....11(n 1s) +2*n} (mod 3)

= n (mod 3) + 2*n (mod 3)

= 3*n (mod 3)

= 0 (mod 3)

Consequently, 10^n+18*n-1 is divisible by 9*3 = 27

Posted by K Sengupta on 2022-05-14 23:38:14

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (0)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info