Find the greatest number of 6 digits exactly divisible by 24, Mathematics

Assignment Help:

Find the greatest number of 6 digits exactly divisible by 24, 15 and 36. (Ans:999720)

Ans: LCM of 24, 15, 36

LCM = 3 × 2 × 2 × 2 × 3 × 5 = 360

Now, the greatest six digit number is 999999

Divide 999999 by 360

∴ Q = 2777 , R = 279

∴ the required number = 999999 - 279 = 999720

Related Discussions:- Find the greatest number of 6 digits exactly divisible by 24

Quantitative, A lobster catcher spends $12 500 per month to maintain a lobs...

A lobster catcher spends $12 500 per month to maintain a lobster boat. He plans to catch an average of 20 days per month during lobster season. For each day, he must allow approx

Zero-day attack, What is Zero-Day Attack? Explain Zero-Day Attack

What is Zero-Day Attack? Explain Zero-Day Attack

Regression, A regression line drawn as Y=C+1075x, when x was 2, and y was 2...

A regression line drawn as Y=C+1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residual

How did they go about "modernizing" the region, What were the two main poli...

What were the two main political parties that formed in the majority of the new nations of Latin America post independence? In what ways were they different? Which party ascended t

Statistics and probability, STATISTICS AND PROBABILITY : Statistics ar...

STATISTICS AND PROBABILITY : Statistics are the only tools by which an opening can be cut through the formidable thicket of difficulties that bars the path of

Cluster sampling, Cluster Sampling Cluster sampling is where a few geog...

Cluster Sampling Cluster sampling is where a few geographical regions for illustration, a location, village or town are selected at random and say every single household or sho

Algorithm for division helping a child grasp, E1) Why don't you think of so...

E1) Why don't you think of some activities for the same purpose now? E2) Suggest, in detail, another activity for helping a child grasp the algorithm for division. We come to

Prove asymptotic bounds for recursion relations, 1. (‡) Prove asymptotic b...

1. (‡) Prove asymptotic bounds for the following recursion relations. Tighter bounds will receive more marks. You may use the Master Theorem if it applies. 1. C(n) = 3C(n/2) + n

Construct the finite automaton for state transition table, Construct the fi...

Construct the finite automaton for the state transition table given below. Ans: The finite automata is displayed below. The initial state is marked along with arrow sign a

Creating input- output tables, How do I create an input-output table with t...

How do I create an input-output table with the rule -12

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages