![Trending Articles on Technical and Non Technical topics](/images/trending_categories.jpeg)
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Which least number should be subtracted from 1000, so that the difference is exactly divisible by 35.
Given :
The given statement is least number should be subtracted from 1000, so that the difference is exactly divisible by 35.
To find :
We have to find the least number.
Solution :
According to Euclid's division algorithm,
$a=bq+r$
Where,
a= dividend
b=divisor
q=quotient and
r=remainder.
So let a=1000, b=35,
So we get,
$1000= 35\times 28+20$
Subtracting 20 from both sides,
$1000–20=35\times28+20–20$
Thus, $980=35\times 28$
Therefore, as seen above, 980 is perfectly divisible by 35.
And so, 20 is the smallest number to be subtracted from 1000 so that the difference is exactly divisible by 35.
Advertisements