In Java Write a Java Program to find the factorial of a number. The factorial of nonnegative integer n (denoted by n!) is the product of all positive integers less than or equal to n. Example: 4! = 4 × 3 × 2 × 1 = 24. The value of 1! Is 1 and the value of 0! Is 1 too. Do not accept negative numbers. Sample Run: Enter a positive integer: -1 Invalid entry. Enter a positive integer: -15 Invalid entry. Enter a positive integer: 5 Factorial of 5 = 120

In Java Write a Java Program to find the factorial of a number. The factorial of nonnegative integer n (denoted by n!) is the product of all positive integers less than or equal to n. Example: 4! = 4 × 3 × 2 × 1 = 24. The value of 1! Is 1 and the value of 0! Is 1 too. Do not accept negative numbers. Sample Run: Enter a positive integer: -1 Invalid entry. Enter a positive integer: -15 Invalid entry. Enter a positive integer: 5 Factorial of 5 = 120

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter6: Looping

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

QuadraticAA.java Write a program that solves quadratic equations of the form , where The values A, B, and C will be real numbers (doubles) that you will request from the user. The equation below is what is used to solve for . Remember, there will be two solutions for x (not necessarily distinct). No loops are necessary, so don’t include any. To find the two solutions for this equation, you will use the quadratic formula: Remember that it must be solved for both the and : You will ask the user to input a value for A, B, and C (in that order, using those same letters), then you will use those values to find the two values of x as above. Your output MUST then display the original quadratic equation back to the user with their coefficients in place, and then output the two results. We will assume that the user will not put zero for A. *Format ALL OUTPUT VALUES (including the equation) to have only two decimal places. There is a test case below. Your program should run the…
1. Generalized harmonic numbers. Write a program GeneralizedHarmonic.java that takes two integer command-line arguments n and r and uses a for loop to compute the nth generalized harmonic number of order r, which is defined by the following formula: 1 1 +...+ 1 H(n,r) = +7 1" 1 1 1 For example, H(3,2) = 12 49 = 1.361111. 36 %3D 22 32 -/Desktop/loops> java GeneralizedHarmonic 1 1 1.0 -/Desktop/loops> java GeneralizedHarmonic 2 1 1.5 -/Desktop/loops> java GeneralizedHarmonic 3 1 1.8333333333333333 ~/Desktop/loops> java GeneralizedHarmonic 1 2 1.0 -/Desktop/loops> java GeneralizedHarmonic 2 2 1.25 ~/Desktop/loops> java GeneralizedHarmonic 3 2 1.3611111111111112 Note: you may assume that n is a positive integer. The generalized harmonic numbers are closely related to the Riemann zeta function, which plays a central role in number theory.
A prime number is called a Mersenne prime if it can be writtenin the form 2p - 1 for some positive integer p. Write a program that findsall Mersenne primes with p ≤100 and displays the output as shown below.(Hint: You have to use BigInteger to store the number because it is too big tobe stored in long. Your program may take several hours to run.) p 2^p – 1---------------------2 33 75 31...
java program that shows exact output as picture program that asks the user to enter a number to be tested for repeated digits. For each input number from the user, the program prints a table showing how many times each digit appears in the number. Let’s assume that the appearance of a digit will not be over 1000 times in the input. Make sure your table printout can align well. The program should terminate when the user enters a number that is less than or equal to 0. A sample output is shown in the attachment.
In python, generate_num_digits(pct_per_digit): Takes one float as input. Returns an integer that is constructed as follows. Start with the integer 1. Then, generate a random percentage (float) between 0 and 1 (using random.random). If the percentage is smaller than the input float, then increase the integer to be returned by 1. Repeat until the generated percentage is not smaller than the input float, and return the integer. >>> random.seed(1337) >>> generate_num_digits(0) 1 >>> random.seed(9001) >>> generate_num_digits(0.5) 3 • generate_number(pct_per_digit): Takes one float as input. Returns a random number that is constructed as follows. First, use the function above to get a random number. This number will correspond to the length (number of digits) that the number generated by this function should have. For example, if that function returns 3, then this function should generate and return a random number with three digits. Note that in the case…
Q1: Write a program that reads a set of N integers. Then, the program finds and outputs the sum of the even values and the sum of the odd values of them. For example: if the value entered for N=5, and the five integers are 3, 6, 2, 9, 7. Then the sum of even values (6+2 = 8), and the sum of odd values (3+9+7 = 19) Q2: Write a program that reads some numbers until it reaches a specific value (assume -1 is a stop value in this case). The program should find and outputs the average of all of the numbers (between 10...40) except the stop value (-1). For example: If the numbers look like: 12 5 30 48 -1. Then, the average of the numbers: (12+30)/2 = 21.
Reza Enterprises sells tickets for buses, tours, and other travel services. Because Reza frequently mistypes long ticket numbers, Reza Enterprises has asked his students to write an application that shows if a ticket is invalid. Your application/program tellsthe ticket agent to enter a six-digit ticket number. Ticket numbers are designed so that if you lose the last digit of the number, then divide by 7, the remainder of the division is exactly the same to the last dropped digit. This process is shown below: Step 1: Enter the ticket number; for example 123454 Step 2: Remove the last digit, leaving 12345 Step 3: Determine the remainder when the ticket number from step 2 is divided by 7. In this case, 12345 divided by 7 leaves a remainder of 4. Step 4: Display a message to the ticket agent indicating whether the ticket number is valid or not.. Test your application with the following ticket numbers: - 123454; is a valid ticket number - 147103; is a valid ticket number -…
Mailbox Mnemonic Code IN STO 90 IN ADD 90 STO 90 IN SUB 90 OUT COB 00 01 02 1. The following Little Man program is supposed to add two input numbers, subtract a third input number from the sum, and output the result, i.e., OUT = IN1 + IN2 – IN3 03 04 05 06 07 08 Numeric Code 901 390 901 190 390 901 290 902 000 What is wrong with this program? Modify the program so that it produces the correct result.
Write a program that allows the user to enter a number between 1 and 1000. If the number is invalid, provide an error message and allow the user to try again until he enters a valid value. Once you have a valid number, use it to determine and print the following information: *Note that in the list of factor pairs, you should not include duplicates. program in python Number squared Number cubed Number Type: Even composite numberOdd or Even Prime (Exactly 2 factors) or Composite (More than 2 factors) Whether the number is a perfect square: No (6 does not have an integer square root like 4 or 9) Square Root: (Print this line only if the number is perfect square) List of factors that exclude duplicates and are printed horizontally on a single lineFactors: (1, 12) (2, 6) (3, 4) (4, 3) (6, 2) (12, 1) should not be included
Prime factors of an integer \( n \) are a set of prime numbers that can be multiplied together to obtain \( n \). Write a proHide Transcribed Text Prime factors of an integernare a set of prime numbers that can be multiplied together to obtainn. Write a program that asks the user to enter a number and displays the prime factors ordered from smallest to largest. If the number entered by the user is less than 2 then there are no prime factors and the message "No prime factors" should be displayed. The following algorithm can be used to discover the prime factors: - initialize factor to 2 - while factor is less than or equal tondo: ifnis evenly divisible by factor then - conclude that factor is a factor ofn- dividenby factor using floor division else: - increase factor by 1 Adapt the algorithm so it can be used to print out the prime factors of a number. Notes: - You can assume that the number entered by the user will be an integer number. - The output must be in the format shown in the…
Using Java and using only the scanner class: Part B: For Loop Program Write a program to compute the sum of the first N Fibonacci numbers, where N is an integer that is input by the user. Once it computes the sum, the program will prompt the user for a new value of N. The program will exit if the user enters a non-integer number or string (such as “quit”) instead of an integer. Additionally: For both the above problems, the first four numbers of the Fibonacci sequence are: 0, 1, 1, and 2. Part A must use While loops only. Part B must use at least one For loop, but may also use while loops. Sample output and a suggested flowchart is provided for Part A, but not part B.
Programming Lang - Java & using the Scanner class Create this program below Part A: While Loop Program Write a program that detects Fibonacci numbers. Prompt the user to input a positive integer. Upon input, the program will determine if the number is either a Fibonacci number or not. If a Fibonacci number, then the order of the number in the sequence must be output. If not a Fibonacci number, then the Fibonacci numbers above and below it (including their order in the sequence) must be output. Once it finishes, the program will prompt the user for a new number. The program will exit if the user enters a non-integer number or string (such as “quit”) instead of an integer. Use the sample output file, fib-seq-det.txt, to view a sample session. Additionally: For both the above problems, the first four numbers of the Fibonacci sequence are 0, 1, 1, and 2. Part A must use While loops only. Sample Output: Welcome to the Fibonacci Sequence Detector Please input a number for…