Theory.adb

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 1TF
icon
Related questions
Question

This code is in Ada code in Ada Please 

 

Not in C code 

 

Please type your solution out in working code don't just give me an example they may just confuse me more 

 

Below is Number_Theory.adb

 

with Ada.Numerics.Generic_Elementary_Functions;

 

package body Number_Theory is

 

   -- Instantiate the library for floating point math using Floating_Type.

   package Floating_Functions is new Ada.Numerics.Generic_Elementary_Functions(Floating_Type);

   use Floating_Functions;



   function Factorial(N : in Factorial_Argument_Type) return Positive is

   begin

      -- TODO: Finish me!

      --

      -- 0! is 1

      -- N! is N * (N-1) * (N-2) * ... * 1

      return 1;

   end Factorial;



   function Is_Prime(N : in Prime_Argument_Type) return Boolean is

      Upper_Bound     : Prime_Argument_Type;

      Current_Divisor : Prime_Argument_Type;

   begin

      -- Handle 2 as a special case.

      if N = 2 then

         return True;

      end if;

 

      Upper_Bound := N - 1;

      Current_Divisor := 2;

      while Current_Divisor < Upper_Bound loop

         if N rem Current_Divisor = 0 then

            return False;

         end if;

         Upper_Bound := N / Current_Divisor;

      end loop;

      return True;

   end Is_Prime;



   function Prime_Counting(N : in Prime_Argument_Type) return Natural is

   begin

      -- TODO: Finish me!

      --

      -- See the lab page for more information.

      return 0;

   end Prime_Counting;



   function Logarithmic_Integral(N : in Prime_Argument_Type) return Floating_Type is

   begin

      -- TODO: Finish me!

      --

      -- See the lab page for more information.

      return 1.0;

   end Logarithmic_Integral;

 

end Number_Theory;





Below is Number_Theory.ads

 

-- This package contains subprograms for doing number theoretic computations.

-- It is used in VTC's CIS-2730, Lab #2.

 

package Number_Theory is

 

   -- Constant Definitions

   -----------------------

   Gamma : constant := 0.57721_56649_01532_86060_65120_90082_40243_10421_59335_93992;



   -- Type Definitions

   -------------------

 

   -- The range of values for which N! can be computed without overflow.

   subtype Factorial_Argument_Type is Integer range 0 .. 12;

 

   -- The range of values that might meaningfully be asked: are you prime?

   subtype Prime_Argument_Type is Integer range 2 .. Integer'Last;

 

   -- A floating point type with at least 15 significant decimal digits.

   type Floating_Type is digits 15;



   -- Subprogram Declarations

   --------------------------

 

   -- Returns N!

   function Factorial(N : Factorial_Argument_Type) return Positive;

 

   -- Returns True if N is prime; False otherwise.

   function Is_Prime(N : in Prime_Argument_Type) return Boolean;

 

   -- Returns the number of prime numbers less than or equal to N.

   function Prime_Counting(N : in Prime_Argument_Type) return Natural;

 

   -- The logarithmic integral function, which is an approximation of the prime counting function.

   function Logarithmic_Integral(N : in Prime_Argument_Type) return Floating_Type;

 

end Number_Theory;



Below in main.adb

 

-- This main program is used in VTC's CIS-2730, Lab #2.

 

-- Some packages that we will need.

with Ada.Text_IO;

with Ada.Integer_Text_IO;

with Number_Theory;

 

-- Make the contents of the standard library packages "directly visible."

use Ada.Text_IO;

use Ada.Integer_Text_IO;



procedure Main is

   -- We need to print values of type Number_Theory.Floating_Type, so generate a package for that.

   package Floating_IO is new Ada.Text_IO.Float_IO(Number_Theory.Floating_Type);

   use Floating_IO;

 

   N : Number_Theory.Prime_Argument_Type;

   -- Add any other local variables you might need here.

 

begin

   Put_Line("Counting Primes!");

   -- TODO: Finish me!

end Main;

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 n(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)). Here are some values of r(n) you can check.
n(n)
10
4
100
25
1_000
168
1_229
9 592
78_498
664_579
100_000_000 5_761_455
1_000_000_000 50_847_534
10_000
100_000
1_000_000
10_000_000
4. Computing r(n) exactly can be time-consuming, especially for large values of n (note: you should be able to double the speed of your implementation by skipping even numbers.. don't forget to handle 2 as a special case). It turns out
there is an approximation formula for computing n(n) that is much faster to calculate. It entails evaluating an infinite series that uses the natural logarithm function. Here is the series:
v + In(1n(n)) + In²(n)/(1*1!) + 1n²(n)/(2*2!) + 1n³(n)/(3*3!) + ...
Here y (gamma) is Euler's constant and has the value (approximately):
v = 0.57721_56649_01532_86060_65120_90082_48243_10421_59335_93992
smaller. This series is
Although the series has infinitely many terms you don't need to add them all because the terms get smalle
roughly equal to li(n).
I the "logarithmic integral function" and goes by the name li(n). It is an amazing fact that n(n) is
Add a function to your package Number_Theory that computes li(n). Call your function Logarithmic_Integral.
The package Ada. Numerics.Generic_Elementary_Functions contains a function Log which computes the natural logarithm (shown as 'In' in the formula above). Note that the logarithmic integral is computed using floating point
numbers, so you'll need some type conversions to go back and forth between integers and floating point values. For example if N is an integer of some kind, you can convert its value to the floating point type declared in Number_Theory
by doing Floating_Type(N).
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 n(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)). Here are some values of r(n) you can check. n(n) 10 4 100 25 1_000 168 1_229 9 592 78_498 664_579 100_000_000 5_761_455 1_000_000_000 50_847_534 10_000 100_000 1_000_000 10_000_000 4. Computing r(n) exactly can be time-consuming, especially for large values of n (note: you should be able to double the speed of your implementation by skipping even numbers.. don't forget to handle 2 as a special case). It turns out there is an approximation formula for computing n(n) that is much faster to calculate. It entails evaluating an infinite series that uses the natural logarithm function. Here is the series: v + In(1n(n)) + In²(n)/(1*1!) + 1n²(n)/(2*2!) + 1n³(n)/(3*3!) + ... Here y (gamma) is Euler's constant and has the value (approximately): v = 0.57721_56649_01532_86060_65120_90082_48243_10421_59335_93992 smaller. This series is Although the series has infinitely many terms you don't need to add them all because the terms get smalle roughly equal to li(n). I the "logarithmic integral function" and goes by the name li(n). It is an amazing fact that n(n) is Add a function to your package Number_Theory that computes li(n). Call your function Logarithmic_Integral. The package Ada. Numerics.Generic_Elementary_Functions contains a function Log which computes the natural logarithm (shown as 'In' in the formula above). Note that the logarithmic integral is computed using floating point numbers, so you'll need some type conversions to go back and forth between integers and floating point values. For example if N is an integer of some kind, you can convert its value to the floating point type declared in Number_Theory by doing Floating_Type(N).
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Database Functions
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning