Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
The Fundamental Theorem of Arithmetic states that any positive integer can be expressed as the product of prime numbers. This program will use a while loop structure to produce the prime factorization of a positive integer provided by the user. You may remember having done this using “Factor Trees"

The Fundamental Theorem of Arithmetic states that any positive integer can be expressed as the product of prime numbers. This program will use a while loop structure to produce the prime factorization of a positive integer provided by the user. You may remember having done this using “Factor Trees"

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
100%

JAVA ONLY, please read the full direction becuase there is a lot.

PRIME FACTORIZATION PROGRAM The Fundamental Theorem of Arithmetic states that any positive integer can be expressed as the product of prime numbers. This program will use a while loop structure to produce the prime factorization of a positive integer provided by the user. You may remember having done this using "Factor Trees" The Algorithm: 1. Obtain a positive integer from the user. 2. For every number from 2 up to the positive integer: A. Determine if the number is a factor (HOW?). If it is: 1. List the number as a factor. 2. Divide the number out of the positive integer. 3. Determine if the integer is a prime number (only factor being itself and 1). Examples: For the positive integer 30 30 % 2 = 0 Therefore 2 is a factor 30 /2 = 15 15 % 3 = 0 Therefore 3 is a factor 15/3 = 5 This means we're 5 % 5 = 0 Therefore 5 is a factor 5/5 = 1 + done!!!
Transcribed Image Text:PRIME FACTORIZATION PROGRAM The Fundamental Theorem of Arithmetic states that any positive integer can be expressed as the product of prime numbers. This program will use a while loop structure to produce the prime factorization of a positive integer provided by the user. You may remember having done this using "Factor Trees" The Algorithm: 1. Obtain a positive integer from the user. 2. For every number from 2 up to the positive integer: A. Determine if the number is a factor (HOW?). If it is: 1. List the number as a factor. 2. Divide the number out of the positive integer. 3. Determine if the integer is a prime number (only factor being itself and 1). Examples: For the positive integer 30 30 % 2 = 0 Therefore 2 is a factor 30 /2 = 15 15 % 3 = 0 Therefore 3 is a factor 15/3 = 5 This means we're 5 % 5 = 0 Therefore 5 is a factor 5/5 = 1 + done!!!
Some things to think about: What should my condition be in my while loop? What do I do if a prime factor occurs more than once? ( 24 = 2 x 2 x 2 x 3 ) How can I make the program as efficient as possible? Be sure to use good JAVA style and include plenty of comments!! The output should be similar to the example below: Enter a positive integer: 150 150 = 2 x 3 x 5 x 5 150 is not a prime number. Write your algorithm in pseudocode below. Clearly indicate any loop structures or conditional statements.
Transcribed Image Text:Some things to think about: What should my condition be in my while loop? What do I do if a prime factor occurs more than once? ( 24 = 2 x 2 x 2 x 3 ) How can I make the program as efficient as possible? Be sure to use good JAVA style and include plenty of comments!! The output should be similar to the example below: Enter a positive integer: 150 150 = 2 x 3 x 5 x 5 150 is not a prime number. Write your algorithm in pseudocode below. Clearly indicate any loop structures or conditional statements.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 4 images

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