Are two numbers divisible? Write a function called checkFactor that takes two arrays of positive numbers, firstNumberRow and secondNumberRow. checkFacto checks if the first entry in firstNumberRow is divisible by the first entry in secondNumberRow, and performs the same operation on the next array elements until all entries have been checked. All the numbers are positive and the number of entries in the arrays are the same. The function should return the identified divisible numbers in two row arrays named firstDivisible and secondDivisible. Restrictions: Branches or loops should not be used. The code must use the internal mod function. Hint: The mod function should be used to determine if two numbers are divisible. Ex: for Num1 and Num2 if mod(Num1,Num2) is 0, the the two numbers are divisible. Ex: firstNumberRow =[5, 7, 8, 6, 3]; secondNumberRow = [7, 7, 2, 3, 5]; [firstDivisible,secondDivisible]=checkFactor(firstNumberRow, secondNumberRow) produces firstDivisible =
Are two numbers divisible? Write a function called checkFactor that takes two arrays of positive numbers, firstNumberRow and secondNumberRow. checkFacto checks if the first entry in firstNumberRow is divisible by the first entry in secondNumberRow, and performs the same operation on the next array elements until all entries have been checked. All the numbers are positive and the number of entries in the arrays are the same. The function should return the identified divisible numbers in two row arrays named firstDivisible and secondDivisible. Restrictions: Branches or loops should not be used. The code must use the internal mod function. Hint: The mod function should be used to determine if two numbers are divisible. Ex: for Num1 and Num2 if mod(Num1,Num2) is 0, the the two numbers are divisible. Ex: firstNumberRow =[5, 7, 8, 6, 3]; secondNumberRow = [7, 7, 2, 3, 5]; [firstDivisible,secondDivisible]=checkFactor(firstNumberRow, secondNumberRow) produces firstDivisible =
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
100%
matlab code
![**Are two numbers divisible?**
Write a function called `checkFactor` that takes two arrays of positive numbers, `firstNumberRow` and `secondNumberRow`. `checkFactor` checks if the first entry in `firstNumberRow` is divisible by the first entry in `secondNumberRow`, and performs the same operation on the next array elements until all entries have been checked. All the numbers are positive and the number of entries in the arrays are the same. The function should return the identified divisible numbers in two row arrays named `firstDivisible` and `secondDivisible`.
**Restrictions:** Branches or loops should not be used. The code must use the internal `mod` function.
**Hint:** The `mod` function should be used to determine if two numbers are divisible. For Num1 and Num2, if `mod(Num1, Num2)` is 0, then the two numbers are divisible.
**Example:**
```plaintext
firstNumberRow = [5, 7, 8, 6, 3];
secondNumberRow = [7, 7, 2, 3, 5];
[firstDivisible, secondDivisible] = checkFactor(firstNumberRow, secondNumberRow)
```
produces
```plaintext
firstDivisible =
7 8 6
secondDivisible =
7 2 3
```
indicating that the second entries (the two 7s), the third entries (the 8 and the 2), and finally the fourth entries (the 6 and 3) are divisible positive integers.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F24f63304-7625-4842-b50d-6ec33aa41943%2Fc99eb9d2-95c2-4e88-b4cd-cb236b246fc2%2Fmez76j_processed.png&w=3840&q=75)
Transcribed Image Text:**Are two numbers divisible?**
Write a function called `checkFactor` that takes two arrays of positive numbers, `firstNumberRow` and `secondNumberRow`. `checkFactor` checks if the first entry in `firstNumberRow` is divisible by the first entry in `secondNumberRow`, and performs the same operation on the next array elements until all entries have been checked. All the numbers are positive and the number of entries in the arrays are the same. The function should return the identified divisible numbers in two row arrays named `firstDivisible` and `secondDivisible`.
**Restrictions:** Branches or loops should not be used. The code must use the internal `mod` function.
**Hint:** The `mod` function should be used to determine if two numbers are divisible. For Num1 and Num2, if `mod(Num1, Num2)` is 0, then the two numbers are divisible.
**Example:**
```plaintext
firstNumberRow = [5, 7, 8, 6, 3];
secondNumberRow = [7, 7, 2, 3, 5];
[firstDivisible, secondDivisible] = checkFactor(firstNumberRow, secondNumberRow)
```
produces
```plaintext
firstDivisible =
7 8 6
secondDivisible =
7 2 3
```
indicating that the second entries (the two 7s), the third entries (the 8 and the 2), and finally the fourth entries (the 6 and 3) are divisible positive integers.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY