Question

**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.**

Answer #1

**Code Screenshot
:**

**Executable
Code:**

recursive.myprint<-function (x) {

**#Quit if number less than or equal to 1**

if (x <= 1)

quit()

**#Print the numbers**

print(x - 1)

**#Recursive call to the function**

recursive.myprint(x - 1)

}

**#Function Call**

recursive.myprint(5)

**Sample
Output:**

**Please comment
below if you have any queries.
Please do give a thumbs up if you liked the answer thanks
:)**

In Matlab, write a function that takes a relatively small (less
than 100 billion) positive integer input and outputs the prime
factorization of that integer using as few built-in functions as
possible. Explain the processes with comments.
NOTE: Do not use the functions factor(n), primes(n), or
isprime(n). You should be able to write out what these functions do
yourself if you want to be able to do something similar.

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

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.

Write a program to ask user to input
an integer and display the special pattern accordingly.
REQUIREMENTS
The user input is always correct (input verification is not
required).
Your code must use loop statements (for, while or
do-while).
Your program should use only the following 3
output statements, one of EACH of the
followings:
System.out.print("-"); // print #
System.out.print("+"); // print +
System.out.println(); // print a newline
Your code must work exactly like the following example (the
text in bold...

In C programming language write a function that takes an integer
n as input and prints the following pattern on the screen:
1 (n times)
2 (n-1 times)
.n (1 time)
For example, if n was 5, the function should print
1 1 1 1 1
2 2 2 2
3 3 3
4 4
5

Use R Studio (show the code and output)
Please write an R function named “outlier_detect” to return or
print out the outliers from a given data vector. outlier_detect =
function(x){ #x: a column of numeric vector Body of 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...

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 a program that asks the user of a positive integer value.
The program should use a loop to get the sum of all the integers
from 1 up to the number entered. For example, if the user enters
50, the loop will find the sum of 1,2,3,4,…,50. using namespace
std;

Collapse
Write a program that prompts the user to input a positive
integer. It should then output a message indicating whether the
number is a prime number.
(Note: An even number is prime if it is 2. An odd integer is prime
if it is not divisible by any odd integer less than or equal to the
square root of the number.)
Turn in:
Your source code for with
The name of your program as a comment at the top...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 17 minutes ago

asked 27 minutes ago

asked 33 minutes ago

asked 37 minutes ago

asked 1 hour ago

asked 1 hour 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