Posted 9 Feb 2013 Find the smallest number consisting of only "1"-s, which would be divisible by "333...3" (one hundred "3"-s.) (Decimal system.) 0 Share this post Link to post Share on other sites

0 Posted 9 Feb 2013 3333....3 is 3*1111....1 The number consisting of only ones must be a multiple of 3 and 1111...1. For it to be a multiple of 111....1, it must be a multiple of 100 1's long. The first multiple of 100 divisible by 3 is 300. So, the number is 111...1 with 300 1's. 1 Share this post Link to post Share on other sites

0 Posted 9 Feb 2013 (edited) 3333....3 is 3*1111....1 The number consisting of only ones must be a multiple of 3 and 1111...1. For it to be a multiple of 111....1, it must be a multiple of 100 1's long. The first multiple of 100 divisible by 3 is 300. So, the number is 111...1 with 300 1's. That's the number I was looking for! Edited 9 Feb 2013 by Prime 0 Share this post Link to post Share on other sites

Posted

Find the smallest number consisting of only "1"-s,

which would be divisible by "333...3" (one hundred "3"-s.)

(Decimal system.)

## Share this post

## Link to post

## Share on other sites