4. The following algorithm gives a test if a given number is prime. Write a script to test it. Then try it out on the numbers: 4058879 (not prime), 193707721 (prime): (a) Input P (b) Initialize N to 3 (c) Find remainder R when P is divided by N (d) While R#0 and N < VP repeat: Increase N by 2 Find R when P is divided by N (e) If R#0 then P is prime Else P is not prime (f) Stop

4. The following algorithm gives a test if a given number is prime. Write a script to test it. Then try it out on the numbers: 4058879 (not prime), 193707721 (prime): (a) Input P (b) Initialize N to 3 (c) Find remainder R when P is divided by N (d) While R#0 and N < VP repeat: Increase N by 2 Find R when P is divided by N (e) If R#0 then P is prime Else P is not prime (f) Stop

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 29PE

See similar textbooks

Similar questions

Use following series to do the given task; 135 79 11 13 15 1719 21 23 25 27 29 31 ... Given the number N of odd numbers in a certain line, your task is to determine the sum of the last three numbers of that line. For example N = 5 means, the third line, the last three numbers are 13, 15 and 17. The summation of these three numbers is 45. InputThe first line tells the number of test cases. From the next line, the input is a sequence of lines, one odd number N (1 < N <1000000000) per line. OutputFor each input line write the sum of the last three odd numbers written in that line of series with N numbers.
Write a program that reads in three integers and prints “in order” if they are sorted in ascending or descending order, or “not in order” otherwise. For example, 1 2 5 in order 1 5 2 not in order 5 2 1 in order 1 2 2 in order
Write a program to read A[n, n] of numbers, then put 10 instead each evenpositive number.
In PYTHON, write a code that allows the user to input two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no number repeats), both terminated by a -1. The output of this code should be a third sequence that is a COMBINATION of both sequences 1 and 2 and is sorted in non-decreasing order where if there are two of the same number they are put together in the final sequence. Such as 1, 20.3, 20.3, 66, 7, 4   please do this using PYTHON, ONLY using while loops. NO language of "break", "len", "True", or "return" anywhere in the code! DO THIS USING 3 SEPARATE LISTS!
In PYTHON, write a code that allows the user to input two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no number repeats), both terminated by a -1. The output of this code should be a third sequence that is a COMBINATION of both sequences 1 and 2 and is sorted in non-decreasing order where if there are two of the same number they are put together in the final sequence. Such as 1, 20.3, 20.3, 66, 7, 4   please do this using PYTHON, ONLY using while loops. NO language of "break", "len", "True", or "return" anywhere in the code! DO THIS USING 3 SEPARATE WHILE LOOPS!
Start with any positive number n. If n is even divide it by 2, if n is odd multiply by 3 and add 1. Repeat until n becomes 1. The sequence that is generated is called a bumpy sequence. For example, the bumpy sequence that starts at n = 10 is: 10, 5, 16, 8, 4, 2, 1and the one that starts at 11 is11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 Write a function named lengthBumpy that returns the length of the bumpy sequence generated by its integer argument. The signature of the function is    int lengthBumpy(int n) Examples:lengthBumpy(10) returns 7, and lengthBumpy(11) returns 15. You may assume that the argument n is positive and that the sequence converges to 1 without arithmetic overflow.
Encryption is commonly used to disguise messages on the internet. A Caesar cipher performs a shift of all of the characters in a string (based on their ASCII values, see Table 1.2), e.g. h e l l o  m j q q t The example shows a shift with a distance of 5 characters, i.e. h(ASCII:104)  m(ASCII:109) Write a Python program that ask the user to input a line of plaintext and the distance value and outputs an encrypted text using a Caesar cipher, with the ASCII values range from 0 through 127. The program should work for any printable characters.
A Fibonacci sequence is a sequence of numbers where each successivenumber is the sum of the previous two. The classic Fibonacci sequencebegins: 1, 1, 2, 3, 5, 8, 13, .... Write a program that computes the nthFibonacci number where n is a value input by the user. For example, ifn = 6, then the result is 8.
Write this using java Write a complete version of the Bresenham Midpoint algorithm to handle ALL slope values. m = 0 m > 0 m < 0 m = 1 m > 1 swap the rolls of x and y m < 1 m = infinity ( needs special test case) Include appropriate tests for ‘special case’ conditions. Insteadof “WritePixel” write to the screen the coordinates of the pixel that would be drawn. Please provide photos that it works and so I can understand the code better
IN STO a IN STO b test LDA a SUB b BRP count LDA c OUT LDA d OUT HLT count STO a LDA c ADD one STO c LDA d SUB b STO d BR test a DAT b DAT c DAT 0 one DAT 1 d DAT 0 Using this LMC program to solve a÷b=cRd where a = 20 b = 4 what is c and remainder d. IF a = 20 b = 4 c should be 5 and d should be 0. IS there reason to why i keep getting the remainder as 980
Write an Algorithm that will read the student name and student id, the algorithm will Print the student name and student id, each in separate line. print the count of number of characters in student name (The space is calculated as character) Check the student ID last two digit, if last two digits are even numbers or odd numbers for the student ID which categorized as even, print the summation of odd number inside the student id, and print the count for the even number inside the entered student ID. The student ID which have an odd number in last two digit, print “the last two digits in student ID is odd numbers”. print the summation of even number inside the student id print the count for the odd numbers inside the enter student ID. Example Mohammed Ali Abdullah 1135728 Student Name: Mohammed Ali Abdullah Student ID: 1135728 number of characters: 21 The last two digits in student ID are even numbers The summation of odd numbers is 17 The count of odd numbers is 5
Given two variables A and B, with integer values, write an algorithm that changes the values of the variables, without creating a new variable.ex: A = 3, B = 5 -> A = 5, b = 3)