Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
11 GPFs Positive integers (counting numbers) which have more than two factors are called composite numbers or simply composites. They are not prime but they do have factors which are prime. For example, here are some prime factorisations: 20 = 2 × 2 × 5, Thus the greatest prime factors (GPFs) of 20, 21, 22 are 5, 7, 11 respec- 21 = 3 × 7, 22 = 2 x 11. tively. The list of GPFs of successive composites is called a GPF sequence. For example, the sequence of GPFs for the composites from 40 to 49 is 5, 7, 11, 5, 23, 3, 7. Note that 41, 43, and 47 are prime and do not contribute to the sequence of GPFs. atorget a Find the sequence of GPFs for the composites from 60 to 65. b Explain why successive composites that give the sequence of GPFs 41, 19, 79 must all have at least four digits. c Find the smallest successive composites that give the sequence of GPFs 17, 73, 2, 19. 510, 511,512, 513 d Find the largest composite less than 10 000 with a GPF of 7 and prove that it is the largest. 7, 19, 23, 29, 31, 37,

11 GPFs Positive integers (counting numbers) which have more than two factors are called composite numbers or simply composites. They are not prime but they do have factors which are prime. For example, here are some prime factorisations: 20 = 2 × 2 × 5, Thus the greatest prime factors (GPFs) of 20, 21, 22 are 5, 7, 11 respec- 21 = 3 × 7, 22 = 2 x 11. tively. The list of GPFs of successive composites is called a GPF sequence. For example, the sequence of GPFs for the composites from 40 to 49 is 5, 7, 11, 5, 23, 3, 7. Note that 41, 43, and 47 are prime and do not contribute to the sequence of GPFs. atorget a Find the sequence of GPFs for the composites from 60 to 65. b Explain why successive composites that give the sequence of GPFs 41, 19, 79 must all have at least four digits. c Find the smallest successive composites that give the sequence of GPFs 17, 73, 2, 19. 510, 511,512, 513 d Find the largest composite less than 10 000 with a GPF of 7 and prove that it is the largest. 7, 19, 23, 29, 31, 37,

Advanced Engineering Mathematics
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
See similar textbooks
icon
Related questions
Question

please only answer parts b and d, as i have already answered parts a and c

11 GPFs Positive integers (counting numbers) which have more than two factors are called composite numbers or simply composites. They are not prime but they do have factors which are prime. For example, here are some prime factorisations: 20= 2 × 2 × 5, Thus the greatest prime factors (GPFs) of 20, 21, 22 are 5, 7, 11 respec- 21 = 3 × 7, 22 = 2 × 11. tively. The list of GPFs of successive composites is called a GPF sequence. PELO ovqU For example, the sequence of GPFs for the composites from 40 to 49 is 5, 7, 11, 5, 23, 3, 7. Note that 41, 43, and 47 are prime and do not contribute to the sequence of GPFs. aurorgon a Find the sequence of GPFs for the composites from 60 to 65. b Explain why successive composites that give the sequence of GPFs 41, 19, 79 must all have at least four digits. c Find the smallest successive composites that give the sequence of GPFs 17, 73, 2, 19. 510, 511,512, 513 d Find the largest composite less than 10 000 with a GPF of 7 and prove that it is the largest. 23,5,7,11, 13, 17, 19, 23, 29, 31, 37,
Transcribed Image Text:11 GPFs Positive integers (counting numbers) which have more than two factors are called composite numbers or simply composites. They are not prime but they do have factors which are prime. For example, here are some prime factorisations: 20= 2 × 2 × 5, Thus the greatest prime factors (GPFs) of 20, 21, 22 are 5, 7, 11 respec- 21 = 3 × 7, 22 = 2 × 11. tively. The list of GPFs of successive composites is called a GPF sequence. PELO ovqU For example, the sequence of GPFs for the composites from 40 to 49 is 5, 7, 11, 5, 23, 3, 7. Note that 41, 43, and 47 are prime and do not contribute to the sequence of GPFs. aurorgon a Find the sequence of GPFs for the composites from 60 to 65. b Explain why successive composites that give the sequence of GPFs 41, 19, 79 must all have at least four digits. c Find the smallest successive composites that give the sequence of GPFs 17, 73, 2, 19. 510, 511,512, 513 d Find the largest composite less than 10 000 with a GPF of 7 and prove that it is the largest. 23,5,7,11, 13, 17, 19, 23, 29, 31, 37,
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,
SEE MORE TEXTBOOKS