There will be 9 tests for this problem.
In each test you will be provided with 2 integers n=[n1,n2],
where n2 is equal to the test number.
Your code should return n1*(remainder(n2/n3)+2) +remainder(n2/n3+1)
Prime factor digits
Cody Matlab Version
07 - Common functions and indexing 2
07 - Common functions and indexing 3
Narcissistic number ?
Strange Number Algorithms
Create numeric palindromes and their square roots
Convert a Cell Array into an Array
Tony's trick for duplicating an mx1 vector n times
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office