Smallest Prime Number Near to an Input of a Function
3 次查看(过去 30 天)
显示 更早的评论
I was doing Homework Assigment for a Course and Wrote small Function called "next_prime" which finds and returns k, the smallest prime number that is greater than n (Input).
It was Mandatory to Use while Loop and I know that this version is Full of Bugs but I Think It works well with Quite Small Values but with Very Large Ranges it Stopes so I need Youy Help to get a better Solution and here is the Function:-
function k = next_prime(n)
k_test = n+1;
while k_test > n
r = primes(n+15);
w = r(r>n);
k_test = w(1);
k = k_test;
return
end
回答(1 个)
Tatvam Dadheech
2019-6-27
编辑:Tatvam Dadheech
2019-6-27
There is an inbuilt function to detect if a number is prime or not .i.e. isprime(n).
Try to loop over every number greater than n and check if its a prime or not using isprime function.
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Loops and Conditional Statements 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!