MyQuestionIcon

9

You visited us 9 times! Enjoying our articles? Unlock Full Access!

Continued Proportions

Let n=64064...

Question

Let $n = 640640640643$ , without actually computing $n^{2}$ . Prove that $n^{2}$ leave a remainder 1 when divided by 8.

Open in App

Solution

Since 640640640000 is a multiple of 8
$643 \equiv 3 (m o d 8)$
$∴ n = 8 k + 3$ for some positive integer k
$∴ n^{2} = 64 k^{2} + 48 k + 9 = 1 + a$ multiple of 8

Suggest Corrections

thumbs-up

0

Similar questions

2 n + 1

is a prime number, show that

1^{2}, 2^{2}, 3^{2}, . . . . n^{2}

when divided by

2 n + 1

leave different remainder.

Q. A certain number 'C' when divided by

N_{1}

it leaves a remainder of 13 and when it is divided by

N_{2}

it leaves a remainder of 1, where

N_{1}

N_{2}

are the positive integers. Then the value of

N_{1} + N_{2} i s, i f \frac{N_{1}}{N_{2}} = \frac{5}{4}

Q. N is a positive integer, which when divided by 16, 17 and 18 leaves remainders of 6, 7 and 8 respectively. Find the remainder when

N^{2} + 5 N + 6

is divided by 12.

P (n) = 3^{2 n} \forall n \in N

, when divided by

8

leaves the remainder

Q. Using binomial theorem, prove that

6^{n} - 5 n

always leaves remainder

1

when divided by

25

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Continued Proportions

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Continued Proportions

Standard IX Mathematics

Join BYJU'S Learning Program

CrossIcon