Question

For C++:

a) Write a function is_prime that takes a positive integer X and returns 1 if X is a prime number, or 1 if X is not a prime number.

b) write a program that takes a positive integer N and prints all prime numbers from 2 to N by calling your function is_prime from part a.

Answer #1

In C++ Using recursion write a program that takes a positive
integer number and returns whether there is 6. For example, if the
input number is 7068, the function returns true

Write the following in C:
2. An integer is said to be prime if it is divisible by only 1
and itself. Write a function called prime() that takes in one
integer number, and returns 1 (true) if the number is prime and 0
(false) otherwise. Write a program to generate six random numbers
between 1 to 100 and calls function prime() on each one to
determine if it is prime or not.

Write a function that takes two integer inputs and returns the
sum of all even numbers between these inputs, and another function
that takes two integer inputs and returns the sum of odd numbers
between these inputs .In main function, the program will asks the
user to enter two integer numbers and then passes them to these two
functions and display the result of each of them.
[0.5 mark] (BY
USING C PROGRAM)

In R- Studio : Write a function that takes as an input a
positive integer and uses the print() function to print out all the
numbers less than the input integer. (Example: for input 5, the
function should print the numbers 1,2,3,4 { for input 1, the
function should not print a number.) Write a recursive function, do
not use any of the loop commands in your code.

Write a method which takes as input an integer, returns true if
the integer is prime, and returns false otherwise. Do not import
anything.
If the input is negative, 0 or 1, false should be returned.
If the input x is greater than 1, you can test if it is prime
(inefficiently) by checking if it is divisible by any integer from
2 up to half of x. If it is not divisible by any of these numbers,
then it...

Write a function
called TaylorSin.m that takes as input an array x, and positive
integer N, and returns the Nth Taylor polynomial approximation of
sin(x), centered at a = 0. The first line of your code should
read
function s =
TaylorSin(x,N)
HINT: in computing k!,
use kfact = k*(k-1)*kfact since you are counting by 2

write a recursive racket function "sum-alternate" that takes a
positive integer x as a parameter. The function should return the
sum of all the integers x, x-2, x-4, x-6, etc. as long as the
numbers are positive. For example, [sum-alternate 5] should
evaluate to 5 + 3 + 1, and [sum-alternate 6] should evaluate to
6+4+2.

An
integer 'n' greater than 1 is prime if its only positive divisor is
1 or itself. For example, 2, 3, 5, and 7 are prime numbers, but 4,
6, 8, and 9 are not. Write a python program that defines a function
isPrime (number) with the following header: def isPrime (number):
that checks whether a number is prime or not. Use that function in
your main program to count the number of prime numbers that are
less than 5000....

C programing
Write a function that takes in an integer as input and returns an
integer array of zeros.

Write a function called "isPrime()” that checks if an integer
number is prime or not. The function returns integer 1 if the
number is prime, or integer 0 if the number is not prime. Write a
simple test program in main() to show that the function works
properly.in C programming language.

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 19 minutes ago

asked 53 minutes ago

asked 58 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 2 hours ago

asked 3 hours ago