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

package body Number_Theory is

— Instantiate the library for floating point math using 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!

—

return 0;

end Prime_Counting;

function Logarithmic_Integral(N : in Prime_Argument_Type) return Floating_Type is

begin

— TODO: Finish me!

—

return 1.0;

end Logarithmic_Integral;

end Number_Theory;

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

package body Number_Theory is

— Instantiate the library for floating point math using 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!

—

return 0;

end Prime_Counting;

function Logarithmic_Integral(N : in Prime_Argument_Type) return Floating_Type is

begin

— TODO: Finish me!

—

return 1.0;

end Logarithmic_Integral;

end Number_Theory;

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

package body Number_Theory is

— Instantiate the library for floating point math using 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!

—

return 0;

end Prime_Counting;

function Logarithmic_Integral(N : in Prime_Argument_Type) return Floating_Type is

begin

— TODO: Finish me!

—

return 1.0;

end Logarithmic_Integral;

end Number_Theory;

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

package body Number_Theory is

— Instantiate the library for floating point math using 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!

—

return 0;

end Prime_Counting;

function Logarithmic_Integral(N : in Prime_Argument_Type) return Floating_Type is

begin

— TODO: Finish me!

—

return 1.0;

end Logarithmic_Integral;

end Number_Theory;

## Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
\$26
The price is based on these factors:
Number of pages
Urgency
Basic features
• Free title page and bibliography
• Unlimited revisions
• Plagiarism-free guarantee
• Money-back guarantee
On-demand options
• Writer’s samples
• Part-by-part delivery
• Overnight delivery
• Copies of used sources
Paper format
• 275 words per page
• 12 pt Arial/Times New Roman
• Double line spacing
• Any citation style (APA, MLA, Chicago/Turabian, Harvard)

# Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

### Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

### Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

### Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.