Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
2. Number theory is a branch of mathematics that concerns itself with the properties of the integers. One function of considerable interest in number theory is the prime counting function. It is traditionally given the namen (but it has nothing to do with circles). For example r(6) = 3 because there are three prime numbers less than or equal to 6 (namely, 2, 3, and 5). Start by adding a function to package Number_Theory that computes (n) for positive values n greater than or equal to 2. Note that the package already has a function Is_Prime that you will no doubt find useful. You might also want to make use of the defined subtype Prime_Argument_Type. Ada allows you to use Greek letters in variable names, but I suggest using the name Prime_Counting for n instead. 3. Modify the main file main.adb to exercise your function (ask the user to input a value n and then output 1(n)). Here are some values of n(n) you can check. T(n) 10 100 25 1_000 168 10_000 1_229 100_000 9_592 1_000_000 78_498 10_000_000 664_579 100_000_000 5_761_455 1_000_000_000 50_847_534

2. Number theory is a branch of mathematics that concerns itself with the properties of the integers. One function of considerable interest in number theory is the prime counting function. It is traditionally given the namen (but it has nothing to do with circles). For example r(6) = 3 because there are three prime numbers less than or equal to 6 (namely, 2, 3, and 5). Start by adding a function to package Number_Theory that computes (n) for positive values n greater than or equal to 2. Note that the package already has a function Is_Prime that you will no doubt find useful. You might also want to make use of the defined subtype Prime_Argument_Type. Ada allows you to use Greek letters in variable names, but I suggest using the name Prime_Counting for n instead. 3. Modify the main file main.adb to exercise your function (ask the user to input a value n and then output 1(n)). Here are some values of n(n) you can check. T(n) 10 100 25 1_000 168 10_000 1_229 100_000 9_592 1_000_000 78_498 10_000_000 664_579 100_000_000 5_761_455 1_000_000_000 50_847_534

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
2. Number theory is a branch of mathematics that concerns itself with the properties of the integers. One function of considerable interest in number theory is the prime counting function. It is traditionally given the name n (but it has nothing to do with circles). For example r(6) = 3 because there are three prime numbers less than or equal to 6 (namely, 2, 3, and 5). Start by adding a function to package Number_Theory that computes n(n) for positive values n greater than or equal to 2. Note that the package already has a function Is_Prime that you will no doubt find useful. You might also want to make use of the defined subtype Prime_Argument_Type. Ada allows you to use Greek letters in variable names, but I suggest using the name Prime_Counting for n instead. 3. Modify the main file main.adb to exercise your function (ask the user to input a value n and then output n(n)). Here are some values of r(n) you can check. n(n) 10 4 100 25 1_000 168 10_000 1_229 100_000 9_592 1_000_000 78_498 10_000_000 664_579 100_000_000 5_761_455 |1_000_000_000 50_847_534
Transcribed Image Text:2. Number theory is a branch of mathematics that concerns itself with the properties of the integers. One function of considerable interest in number theory is the prime counting function. It is traditionally given the name n (but it has nothing to do with circles). For example r(6) = 3 because there are three prime numbers less than or equal to 6 (namely, 2, 3, and 5). Start by adding a function to package Number_Theory that computes n(n) for positive values n greater than or equal to 2. Note that the package already has a function Is_Prime that you will no doubt find useful. You might also want to make use of the defined subtype Prime_Argument_Type. Ada allows you to use Greek letters in variable names, but I suggest using the name Prime_Counting for n instead. 3. Modify the main file main.adb to exercise your function (ask the user to input a value n and then output n(n)). Here are some values of r(n) you can check. n(n) 10 4 100 25 1_000 168 10_000 1_229 100_000 9_592 1_000_000 78_498 10_000_000 664_579 100_000_000 5_761_455 |1_000_000_000 50_847_534
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS