Alex's Simple Division

Find the largest possible value of n n such that 1 1 n 11^{n} is a divisor of 261994187 8888888888888...888888 1993 8s 626894701 261994187\underbrace{8888888888888...888888}_\text{1993 8s}626894701


The answer is 11.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Saurabh Mallik
Mar 27, 2014

The value of n = 11 n = 11

So, the largest possible divisor of:

2619941878888....88888626894701 ( 8 2619941878888....88888626894701 (8 written 1993 1993 times ) = 1 1 11 = 285 , 311 , 670 , 611 ) = 11^{11} = 285,311,670,611

So, the answer is 11 \boxed{11} .

How did you know that 285311670 divides that SOOOoo big number..?????????

Suklo Charan Kisku - 7 years, 1 month ago

Bad solution..... @Nanayaranaraknas Vahdam - Would kindly ask you to submit a solutions since you have solved this. Thanks :)_

Krishna Ar - 7 years ago

You are the most useless sucker ever @Saurabh Mallik . Youre solutions are never clear or correct.

Sanjana Nedunchezian - 6 years, 9 months ago

Log in to reply

You foolish insect. My solutions are nice. You are stupid not me. If you don't have any solution then shut up and stop commenting you fool. Be reasonable in your arguments!

Saurabh Mallik - 6 years, 9 months ago

calculator ka use mat kar mere bhai!!

manas vema - 7 years ago

Log in to reply

It is not possible to solve it in a calculator because it shows error in such big calculations.

Saurabh Mallik - 6 years, 12 months ago

Log in to reply

You are the most useless fool and sucker I have ever seen in my life.

Sanjana Nedunchezian - 6 years, 9 months ago
Kenny Lau
Sep 9, 2014

java code:

public class brilliant201409091555{
    static int count = 0;
    public static void main(String args[]){
        String number = "261994187";
        for(int i=0;i<1993;i++) number = number + "8";
        number = number + "626894701";
        process(number);
        System.out.println(count);
    }
    private static void process(String number){
        String quotient = "";
        int remainder = 0;
        for(int i=0;i<number.length();i++){
            remainder *= 10;
            remainder += (number.charAt(i)-48);
            if(remainder<11){
                quotient += "0";
                continue;
            }
            quotient += remainder/11;
            remainder %= 11;
        }
        if(remainder==0){
            count++;
            process(quotient);
        }
    }
}

output:

11
Press any key to continue . . .

Note: I used the concept of BigInteger by representing integers with strings.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...