Courses
Courses for Kids
Free study material
Offline Centres
More
Store Icon
Store
seo-qna
SearchIcon
banner

Check whether the given numbers are divisible by $8$ or not ?
A. \[4808\]
B. \[1324\]
C. \[1000\]
D. \[76728\]

Answer
VerifiedVerified
567k+ views
Hint: To check whether the number is divisible by 8 we take the last three of the options and divide it by \[8\], if the last three digit number is divisible by 8 completely without leaving a remainder than the whole number is divisible by 8. We have to check for each option separately.

Complete step-by-step answer:
To check which number is divisible by \[8\] we check each option one by one first let us check for the option A, \[4808\]. The last three numbers of the value \[4808\] is \[808\]. So let us divide the number by \[8\].
Dividing \[808\] by \[8\], we get the value as:
 \[\Rightarrow \dfrac{808}{8} =101\]
Hence, the number is divisible by \[8\] completely with no remainder.

For option B, \[1324\]. The last three numbers of the value \[1324\] is \[324\]. So let us divide the number by \[8\].
Dividing \[324\] by \[8\], we get the value as:
 \[\Rightarrow \dfrac{324}{8} =40.5\]
Hence, the number is not divisible by \[8\] completely.

For option C, \[1000\]. The last three numbers of the value \[1000\] is \[000\]. So let us divide the number by \[8\]. Dividing \[000\] by \[8\], we get the value as:
 \[\Rightarrow \dfrac{000}{8} =0\]
Hence, the number is divisible by \[8\] completely with no remainder.

For option D, \[76728\]. The last three numbers of the value \[76728\] is \[728\]. So let us divide the number by \[8\].
Dividing \[728\] by \[8\], we get the value as:
 \[\Rightarrow \dfrac{728}{8} =91\]
Hence, the number is divisible by \[8\] completely with no remainder.
Therefore, option A, B, C and D are all divisible by \[8\] completely with no remainder.

So, the correct answer is “Option A , C and D”.

Note: There is another method to check which numbers are divisible by \[8\] but that process is longer and more tedious, process where we need to check every number by dividing each option by \[8\] and then checking which are divisible by \[8\] or not. The process gives the right answer but is long.