All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Consecutively Divisible (Posted on 2013-03-18)
PART A:

P is a positive integer such that each of sod(P-1), sod(P) and P+1 is divisible by 13. Determine the minimum value of P.

What if each of P-1, sod(P) and sod(P+1) is divisible by 13? How about each of sod(P-1), P and sod(P+1) being divisible by 13?

PART B:

What will be the respective answers to Part A, when the words "divisible by 13" are replaced with "divisible by 11"?

*** sod(x) refers to the sum of the digits in the base ten expansion of x.

 No Solution Yet Submitted by K Sengupta No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re:1/6 remaining Comment 3 of 3 |

Answer to B3:

P  = 550000000000                = 11×50000000000
P-1= 549999999999 : sod(P-1)= 99 = 11×9
P+1= 550000000001 : sod(P+1)= 11 = 11×1

For the smallest |sod(P-1) - sod(P+1)| with a positive multiple of 11 is 88 and the smallest sod(P+1) with a positive multiple of 11 is 11, the sod(P-1) = 99. As can be found, the smallest number for an sod(P-1) of 99 is a twelve-digit number. The smallest twelve-digit number that conforms to the specifications is 550000000000.

Edited on March 27, 2013, 11:45 pm
 Posted by Dej Mar on 2013-03-20 00:55:05

Please log in:
 Login: Password: Remember me: Sign up! | Forgot password

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

Chatterbox:
Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information