tough and tricky questions : remainders . 1 ^ 1 + 2 ^ 2 + 3 ^ 3 + . . . + 7 ^ 7 is divided by 7 . what is the remainder ?
a number is divisible by 5 , if its last digit is divisible by 5 let ' s look into the sum of last digits of each term of the given expression 1 ^ 1 = 1 2 ^ 2 = 4 3 ^ 3 = 7 4 ^ 4 = 6 5 ^ 5 = 5 6 ^ 6 = 6 7 ^ 7 = 3 adding all these numbers we get 32 which gives a remainder of 4 when divided by 7 . so answer must be 4 . bunuel , can you please confirm the answer of this question . yes , the oa is c . clicked the wrong button when posting . edited . thank you . e
subtract(add(add(add(add(add(add(1, const_4), 7), add(const_4, const_2)), add(const_4, const_1)), add(const_4, const_2)), const_3), multiply(7, floor(divide(add(add(add(add(add(add(1, const_4), 7), add(const_4, const_2)), add(const_4, const_1)), add(const_4, const_2)), const_3), 7))))