• :00Days
  • :00Hours
  • :00Mins
  • 00Seconds
A new era for learning is coming soonSign up for free
Log In Start studying!

Select your language

Suggested languages for you:
Deutsch (DE)
Deutsch (UK)
Deutsch (US)

Americas

Europe

Answers without the blur. Sign up and see all textbooks for free! → Illustration

Q2SE

Expert-verified
Discrete Mathematics and its Applications
Found in: Page 307
Discrete Mathematics and its Applications

Discrete Mathematics and its Applications

Book edition 7th
Author(s) Kenneth H. Rosen
Pages 808 pages
ISBN 9780073383095

Answers without the blur.

Just sign up for free and you're in.

Register for Free I’ll do it later
Illustration

Short Answer

a) Explain why n div 7 equals the number of complete weeks in days.

b) Explain why n div 24 equals the number of complete days inn hours.

  1. It is explained that n div 7 equals the number of complete weeks in n days.
  2. It is explained that n div 7 equals the number of complete days in n hours.
See the step by step solution

Step by Step Solution

TABLE OF CONTENTS :
TABLE OF CONTENTS

Step 1: Defining term.

a | b (a divide b) there is an integer c such that b = ac .

(a) Step 2: Explaining  div equals the number of complete weeks in days.

It is given that

Total days are n

We know a week has 7 days

If we divide the total days by 7, we get the number of weeks in n days

And if we take the integer part of this number, we will get the complete weeks in days.

hence n div 7 equals the number of complete weeks in n days.

(b) Step 3: Explaining  div equals the number of complete days in hours.

It is given that

Total hours are n

We know a day has 24 hours

If we divide the total hours by 24 , we get the number of days in n hours

And if we take the integer part of this number, we will get the complete days in n hours

Hence, n div 24 equals the number of complete days in n hours.

Most popular questions for Math Textbooks

What are the greatest common divisors of these pairs of integers?

a) 22·33·55, 25·33·52

b) 2·3·5·7·11·13, 211·39·11·1714

c) 17, 1717

d) 22·7, 53·13

e) 0, 5

f) 2·3·5·7, 2·3·5·7

Describe a procedure for converting decimal (base 10) expansions of integers into hexadecimal expansions.

Express in pseudocode with the algorithm described the text for finding the prime factorization of an integer.

Show that if a≡b(mod m) and c ≡d( mod m), then a+c≡ b+d (mod m).

Describe an algorithm that finds the Cantor expansion of an integer.
Icon

Want to see more solutions like these?

Sign up for free to discover our expert answers
Get Started - It’s free

Recommended explanations on Math Textbooks

Decision Maths

Read explanation

Calculus

Read explanation

Probability and Statistics

Read explanation

Statistics

Read explanation

Mechanics Maths

Read explanation

Geometry

Read explanation

Pure Maths

Read explanation

94% of StudySmarter users get better grades.

Sign up for free
94% of StudySmarter users get better grades.