I need a function that returns the smallest prime number p smaller than 100,000 such that (p + n) is also prime, where n is a scalar integer and is the sole input argument to the function
显示 更早的评论
Write a function called prime_pairs that returns the smallest prime number p smaller than 100,000 such that (p + n) is also prime, where n is a scalar integer and is the sole input argument to the function. If no such number exists, then the function returns -1. You may use the built-in functions, primes and isprime.
采纳的回答
function p = prime_pairs(n)
V = primes(1e5);
V = V(isprime(n+V));
if isempty(V)
p = -1;
else
p = V(1);
end
end
更多回答（1 个）
charu sharma
2015-8-27
0 个投票
For simple code refer this and ask if you have any query: http://farzicoders.blogspot.in/2015/08/write-function-called-primepairs-that.html
1 个评论
Stephen23
2015-8-27
"simple code" with:
- poorly named variables: for i=1:l
- superfluous intermediate variables: flag
- superfluous loops when code vectorization would be neater.
- superfluous return statements.
类别
在 帮助中心 和 File Exchange 中查找有关 Discrete Math 的更多信息
Translated by 
