Admin
Adobe
Apache
Banking
Big Data Analytics
Business Topics
Business intelligence
Cloud computing
Database
DevOps
Digital Marketing
Hadoop
IBM
IT Security
Java
JavaScript library
Microsoft
Mainframe
Mobile Development
Networking
Oracle
Peoplesoft
Programming
PHP Framework
Qlikview
SAP
SAS
Salesforce
Testing
Telecom
Web Development
The least common multiple (L.C.M.) of two numbers is the smallest positive integer that is perfectly divisible by the two given numbers. For example, the L.C.M. of 12 and 14 is 84. Program: lcm <- function(x, y) { # choose the greater number if(x...
The least common multiple (L.C.M.) of two numbers is the smallest positive integer that is perfectly divisible by the two given numbers. For example, the L.C.M. of 12 and 14 is 84. Program: lcm <- function(x, y) { # choose the greater number if(x...
The highest common factor (H.C.F) or greatest common divisor (G.C.D) of two numbers is the largest positive integer that perfectly divides the two given numbers. For example, the H.C.F of 12 and 14 is 2. Program: hcf <- function(x, y) { # choose the...
The highest common factor (H.C.F) or greatest common divisor (G.C.D) of two numbers is the largest positive integer that perfectly divides the two given numbers. For example, the H.C.F of 12 and 14 is 2. Program: hcf <- function(x, y) { # choose the...
print_factors <- function(x) { print(paste(“The factors of”,x,”are:”)) for(i in 1:x) { if((x %% i) == 0) { print(i) } } } Output: The factors of 24 are:” 1 2 3 4 6 8 12 24 Built...
print_factors <- function(x) { print(paste(“The factors of”,x,”are:”)) for(i in 1:x) { if((x %% i) == 0) { print(i) } } } Output: The factors of 24 are:” 1 2 3 4 6 8 12 24 Built...
Without Formula: num = as.integer(readline(prompt = “Enter a number: “)) if(num < 0) { print(“Enter a positive number”) } else { sum = # use while loop to iterate until zero while(num > 0) { sum = sum + num num = num – 1 } print(paste(“The sum is”, sum)) } Output: Enter a
Without Formula: num = as.integer(readline(prompt = “Enter a number: “)) if(num < 0) { print(“Enter a positive number”) } else { sum = # use while loop to iterate until zero while(num > 0) { sum = sum + num num = num – 1 } print(paste(“The sum is”, sum)) } Output: Enter a
An Armstrong number, also known as narcissistic number, is a number that is equal to the sum of the cubes of its own digits. For example, 370 is an Armstrong number since 370 = 3*3*3 + 7*7*7 + 0*0*0. Program: num = as.integer(readline(prompt=”Enter a...
An Armstrong number, also known as narcissistic number, is a number that is equal to the sum of the cubes of its own digits. For example, 370 is an Armstrong number since 370 = 3*3*3 + 7*7*7 + 0*0*0. Program: num = as.integer(readline(prompt=”Enter a...
year = as.integer(readline(prompt=”Enter a year: “)) if((year %% 4) == 0) { if((year %% 100) == 0) { if((year %% 400) == 0) { print(paste(year,”is a leap year”)) } else { print(paste(year,”is not a leap year”)) } } else { print(paste(year,”is a leap year”))...
year = as.integer(readline(prompt=”Enter a year: “)) if((year %% 4) == 0) { if((year %% 100) == 0) { if((year %% 400) == 0) { print(paste(year,”is a leap year”)) } else { print(paste(year,”is not a leap year”)) } } else { print(paste(year,”is a leap year”))...
The factorial of a number is the product of all the integers from 1 to that number. For example, the factorial of 6 (denoted as 6!) is 1*2*3*4*5*6 = 720. Factorial is not defined for negative numbers and the factorial of zero is one,...
The factorial of a number is the product of all the integers from 1 to that number. For example, the factorial of 6 (denoted as 6!) is 1*2*3*4*5*6 = 720. Factorial is not defined for negative numbers and the factorial of zero is one,...
nterms = as.integer(readline(prompt=”How many terms? “)) # first two terms n1 = n2 = 1 count = 2 # check if the number of terms is valid if(nterms <= 0) { print(“Plese enter a positive integer”) } else { if(nterms == 1) { print(“Fibonacci sequence:”) print(n1) } else { print(“Fibonacci sequence:”) print(n1) print(n2) while(count
nterms = as.integer(readline(prompt=”How many terms? “)) # first two terms n1 = n2 = 1 count = 2 # check if the number of terms is valid if(nterms <= 0) { print(“Plese enter a positive integer”) } else { if(nterms == 1) { print(“Fibonacci sequence:”) print(n1) } else { print(“Fibonacci sequence:”) print(n1) print(n2) while(count
