Instruction: Create a java program using while/do-while that accepts as input an integer value N(assume N > 1) and prints out the Ulam sequence that begins with the input value N. Required: The .java file (FamilyName_Ulam.java) containing the code and 2 image files(Sample1 and Sample2) containing different sample input/output of the program. Instruction:A mathematician named Ulam proposed generating a sequence of numbers from anypositive integer N greater than 1 using the following procedure:If N is 1, stop.If N is even, replace it with N/2.If N is odd, replace it with 3 * N+ 1.Continue with this process until N reaches 1.Here are some examples of the Ulam sequence for the first few integers.2, 13, 10, 5, 16, 8, 4, 2, 14, 2, 15, 16, 8, 4, 2, 16, 3, 10, 5, 16, 8, 4, 2, 1Create a java program using while/do-while that accepts as input an integer value N(assume N> 1) and prints out the Ulam sequence that begins with the input value N.Sample Input/Output:Depicted below are sample outputs when the program is executed (the items in boldcharacters are input from the user, while the items in bold italic are calculated andprinted by the program):Input N: 14Ulam Sequence:14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1Input N: 5Ulam Sequence:5, 16, 8, 4, 2, 1Required: The java file (FamilyName_Ulam.java) containing the code and 2 image files(Samplel and Sample2) containing different sample input/output of the program.

Instruction: Create a java program using while/do-while that accepts as input an integer value N (assume N > 1) and prints out the Ulam sequence that begins with the input value N. Required: The .java file (FamilyName_Ulam.java) containing the code and 2 image files (Sample1 and Sample2) containing different sample input/output of the program.

Instruction: Create a java program using while/do-while that accepts as input an integer value N (assume N > 1) and prints out the Ulam sequence that begins with the input value N. Required: The .java file (FamilyName_Ulam.java) containing the code and 2 image files (Sample1 and Sample2) containing different sample input/output of the program.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 21PE

See similar textbooks

Similar questions

/*code Kth Largest Factor A positive integer d is said to be a factor of another positive integer N if when N is divided by d, the remainder obtained is zero. For example, for number 12, there are 6 factors 1, 2, 3, 4, 6, 12. Every positive integer k has at least two factors, 1 and the number k itself.Given two positive integers N and k, write a program to print the kth largest factor of N. Input Format: The input is a comma-separated list of positive integer pairs (N, k). Output Format: The kth highest factor of N. If N does not have k factors, the output should be 1. Constraints: 1<N<10000000000 1<k<600. You can assume that N will have no prime factors which are larger than 13..
Assignment for Computer Architecture: N Factual by Recusion *please have comments in the code* You are to write a program in MIPS that computes N! using recursion. Remember N! is the product of all the numbers from 1 to N inclusive, that is 1 x 2 x 3 x (N – 1) x N. It is defined as 1 for N = 0 and is undefined for values less than 0. The programs first requests the user to input the value of N (display a prompt first so the user knows what to do). If the input value is less than 0, the program is to display “N! undefined for values less than 0” and then requests the user to input the value of N again. If the value input is non-negative, it is to compute N! using a recursive function, that is one that calls itself. You are to have your name, the assignment number, and a brief description of the program in comments at the top of your program. Since this is an assembly language program, I expect to see comments on almost every line of code in the program. Also make the…
C++ Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an even number, then divide N by two to get a new value for N If N is an odd number, then multiply N by 3 and add 1 to get a new value for N. Continue to generate numbers in this way until N becomes equal to 1 For example, starting from N = 3 the complete ’3N+1’ sequence would be: 3, 10, 5, 16, 8, 4, 2, 1 Write code to ask the user to enter a positive integer (N) in the main() function. Write a function sequence() that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that was received (entered by the user). The function must also count and return the numbers that the sequenceconsists of. The returned value must be displayed from the main() function.
le.com/forms/d/e/1FAlpQLSc6PlhZGOLJ4LOHo5cCGEf9HDChfQ-tT1bES-BKgkKu44eEnw/formResponse The following iterative sequence is defined for the set of positive integers: Sn/2 3n +1 ifn is odd if n is even Un = Using the rule above and starting with 13, we generate the following sequence: 13 u13 = 40 u40 =20 u20 = 10→ u10 =5 u5 = 16 u16 = 8 ug = 4 → Us =2 u2 =1. It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. The below function takes as input an integer n and returns the number of terms generated by the sequence starting at n. function i-Seq (n) u=n; i=%3; while u =1 if statement 1 u=u/2; else statement 2 end i=i+1; end statement 1 and statement 2 should be replaced by: None of the choices statement 1 is "mod(u,2)=D%3D0" and statement 2 is "u = 3*u+1;" statement 1 is "u%2" and statement 2 is "u = 3*u+1;" O statement 1 is "mod(n,2)=30" and statement 2 is "u = 3*n+1;"
+ dgenuity.com/Player/ Semester A def fib(n): Complete the code for this recursive function. if n == 1: return 0 if n == 2: return 1 else: 3 return 5 # The first number in the list. # The second number in the list. # Add the previous two numbers. Mark this and return (n-1) + O (n-2) Σ B 0 Save and Exit Next Sign out English Mart
please code in python You place a pawn at the top left corner of an n-by-n chess board, labeled (0,0). For each move, you have a choice: move the pawn down a single space, or move the pawn down one space and right one space. That is, if the pawn is at position (i,j), you can move the pawn to (i+1,j) or (i+1, j+1). Ask the user for the size of a chessboard, n (integer). Find the number of different paths starting from (0,0) that the pawn could take to reach each position on the chess board. For example, there are two different paths the pawn can take to reach (2,1). Look at the diagrams below to convince yourself of this. You can see the four paths that you can take by move 2. Start -> Move 1 -> Move 2 (0,0) -> (1,0) -> (2,1) (0,0) -> (1,0) -> (2,0) (0,0) -> (1,1) -> (2,1) (0,0) -> (1,1) -> (2,2) Print the board with the number of ways to reach each square labeled as shown below. For example: Enter a board size: 4 1 0 0 0 1 1 0 0 1 2 1 0 1 3 3 1
hexadecimal We usually write numbers in decimal form (or base 10), meaning numbers are composed using 10 different “digits” {0, 1, . . . , 9}. Sometimes though it is useful to write numbers hexadecimal or base 16. Now there are 16 distinct digits that can be used to form numbers: {0,1,...,9,A,B,C,D,E,F}. So for example, a 3 digit hexadecimal number might be 2B8. (d) How many 3-digit hexadecimals start with a letter (A-F) or end with a numeral (0-9) (or both)? Explain (please answer it the way i can make myself understand)
*Using Python The scientist has 500 cages in which to hold her rabbits. Each cage holds one pair of rabbits. Assuming that no rabbits ever die, when will she run out of cages? Your program must do the following: Print a table that contains the following information for each month. The number of months that have passed. The number adult rabbit pairs (those over 1 month old). The number of baby rabbits pairs produced this month. The total number of rabbit pairs in the lab. Calculate how many months it will take until the number of rabbits exceeds the number of available cages. Stop printing when you run out of cages. Print a message giving how many months it will take to run out of cages Output file should look like the following. Comments in the file begin with '#', and must appear as shown too: Code must contain def main(): #main function need in all programs for automated testing """ Program starts here """ #end of main program if __name__ == '__main__': main() #excucte main…
Given an integer n, you can do the following replacement operations: 1. Replace n with n/2 if n is even 2. Replace n with either n - 1 or n + 1 if n is odd Given an integer n, determine the minimum number of replacements needed to reach 1? For example, if n = 50, then we need a minimum of 7 replacements, as follows: 50 divide by 2 →25 50 add 1 23- Another example, if n = 23, then we need a minimum of 6 replacements, as follows: divide by 2 subtract 1 24 Output: 24 12 divide by 2 divide by 2 12 6 Please use recursion to solve this task and do NOT use loops. Sample Testcase 0: Input: divide divide by 2
GRADED ACTIVITY #6 (M8.1): REPETITION CONTROL STRUCTURE (WHILE, DO-WHILE) Instruction: A mathematician named Ulam proposed generating a sequence of numbers from any positive integer N greater than 1 using the following procedure: If N is 1, stop. If N is even, replace it with N/2. If N is odd, replace it with 3 * N + 1. Continue with this process until N reaches 1. Here are some examples of the Ulam sequence for the first few integers. 2, 1 3, 10, 5, 16, 8, 4, 2, 1 4, 2, 1 5, 16, 8, 4, 2, 1 6, 3, 10, 5, 16, 8, 4, 2, 1 Write a Java program using while/do-while that accepts as input an integer value N (assume N> 1) and prints out the Ulam sequence that begins with the input value N. Sample Input/Output: Depicted below are sample outputs when the program is executed (the items in bold characters are input from the user, while the items in bold italic are calculated and printed by the program): Input N: 14 Ulam Sequence: Input N: 5 Ulam Sequence: 5, 16, 8, 4, 2, 1 14, 7, 22, 11, 34, 17,…
Following is the formula for calculating the mean or average of a set of values: X_mean = (1.0/n)(X_i) Where n is the number of data.This can be done in C by keeping a running sum of numbers as the user enters them. In other words, you have a loop that runs, and every time the user inputs a new number x, the number is added to the running sum xsum (x and xsum are already declared as double)Write appropriate ‘for loop’ that gathers a number “x” from the user. Add the value of x, once collected, to the running sum xsum. This ‘for loop’ will repeat as many as the number of data provided.
please code in python You are probably familiar with the famous Fibonacci sequence of numbers, which begins like this: 1, 1, 2, 3, 5, 8, 13, 21... We'll index from 0, so the 0th and 1st numbers are both 1. The 2nd Fibonacci number is found by summing the 0th and 1st: 1 + 1 = 2. The 3rd is found by summing the 1st and 2nd: 1 + 2 = 3. After this point, each Fibonacci number is found by summing the previous two numbers. You are to write a recursive function to compute the nth Fibonacci number. This means that your function will call itself and will NOT include explicit loops. Hint: Your function should include a line that looks a lot like the mathematical definition of the nth Fibonacci number. Another Hint: It's possible for a recursive function to call itself more than once. Example: print(Fibonacci(1)) 1