By dividing the number n by each number from 2..n/2 in an inner loop, create a programme that finds prime numbers from 3 to n in a loop. Find the smallest number that divides n using the remainder (rem) operation. Leave the inner loop if n is divisible. If the inner loop is still running after reaching the n/2 limit, the integer is prime, and you should output it. In this case, your programme would print out "2, 3, 5, 7, 11, 13, 17, 19, 23" if the user entered 25. code in assembly language

By dividing the number n by each number from 2..n/2 in an inner loop, create a programme that finds prime numbers from 3 to n in a loop. Find the smallest number that divides n using the remainder (rem) operation. Leave the inner loop if n is divisible. If the inner loop is still running after reaching the n/2 limit, the integer is prime, and you should output it. In this case, your programme would print out "2, 3, 5, 7, 11, 13, 17, 19, 23" if the user entered 25. code in assembly language

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.3: Interactive While Loops

Problem 5E

See similar textbooks

Similar questions

Write a programme that finds prime integers from 3 to n in a loop by dividing n by all numbers between 2..n/2 in an inner loop. Determine whether n is divisible by any number using the remainder (rem) operator. If n is divisible, the inner loop is skipped. If the limit of n/2 is reached and the inner loop is not exited, the number is prime and should be output. If the user enters 25, your programme will output "2, 3, 5, 7, 11, 13, 17, 19, 23" To code, use assembly language:
Write a program to find prime numbers from 3 to n in a loop by dividing the number n by all numbers from 2..n/2 in an inner loop. Using the remainder (rem) operation, determine if n is divisible by any number. If n is divisible, leave the inner loop. If the limit of n/2 is reached and the inner loop has not been exited, the number is prime and you should output the number. So if the user were to enter 25, your program would print out "2, 3, 5, 7, 11, 13, 17, 19, 23" use assembly language to code:
Write a program using while loop. You should ask a user to enter a number as an input and in each loop iteration, divide the number by 2, then print the numbers. While loop should repeat as long as the number each step is greater than or equal to 1.. Sample output with input: 30 20.0 10.0 5 2.5 1.25 0.625
The program takes a number (n) and processes it through the while loop. It is complete when the value of n reaches 1.the program would normally print out the value it started with and the length of the sequence of numbers it went through to reach 1. In other words, it takes one value for n and processes it, producing a series (or sequence) of numbers. For example, using the supplied program, output using the start value of 51 would look like: The sequence starting at 51 has length 25 What You Must Do Test all possible input values between 1 and 500,000 (including those two values). You are looking for two sequences: one with the longest sequence of numbers of any of the sequences, and one with the highest value reached of any value in any of the sequences. At end of the program, with appropriate messages, show: the starting value and the length (number of values) of the longest sequence in the series, and the starting value of the sequence with the highest value reached…
Convert the following summation formulas into while loops. After each loop is complete, display the computed sum. For example, 10 summation i=1(1) should produce the output of 10 since it is adding 1 to the sum 10 times. 10 summation i=0 (i) 4 summation i=1 (i^2) 15 summation i=0 (i(i+1)) The above summations should produce sums of 55, 30, and 1360 if done correctly.
a) Take an input of your registration number in the University. Write a programme to print all the prime numbers in your registration number my registration number is 11917488. b) Input numbers from user and find sum of all those input numbers until user inputs zero. In other means, loop should end when user enters 0. Finally, display the sum of all those numbers entered by user.
Write a program to sum the numbers from 1 to 10 with increment 0.5 by using while loop
Using nested loops, print the money from 1 dollar and 0 cents to 10 dollars and 0 cents, going up by 25 cents each time. The output should look like the sample below. Sample output: $1.00 $1.25 $1.50 $1.75 $2.00 $2.25 etc .. up to $10.00 Hint: Use printf("$%d:%02d" to format your data nicely as currency as shown in the example.
Using the do-while loop, Draw a simple calculator flowchart of your choice using a minimum of 5 operators that also runs for a minimum of the number of operators used.(so if 5 operators were used, then it should run a minimum of 5 times before terminating
Write while loops to do the following: Repeatedly print the value of the variable xValue, decreasing it by 0.5 each time, as long as xValue remains positive. Print the square roots of the first 25 odd positive integers. Repeats a block of code as long as the user indicates they want it to. Drive the user crazy by insisting they re-enter a particular input no matter what they enter.
a) Rewrite the following line using the while loop! for ( int x = 0; x <10; x + = 2) printf (“5”) ; b) using the switch structure , the number 25, Pressing 1 makes 25%,Pressing 2 will double it,When 3 is pressed, the remainder of the section with 3,If a numeric key other than 1, 2, 3 is pressed, 'Wrong selection!' Write a program to print. The screen outputs of the program should be as follows!
Write a program that will print asterisks in the shape of a diamond. The height of the diamond will depend on the value entered by the user. That value MUST be greater than 0, and it MUST be odd. To make sure that the value is correct, you will validate the value once the user has entered it using a validation loop. Then you will print out a diamond in the pattern demonstrated in the sample execution. Remember that the height will vary based on the user input.