Function to find the next prime number...

18 vues (au cours des 30 derniers jours)
Jyothi Alugolu
Jyothi Alugolu le 19 Fév 2018
Commenté : Stephen23 le 28 Juil 2021
I have a vector of size 1*152.Now i want to find the next prime number of every number present in the vector..
Ex: My vector is a=[2 4 7 8] i want the output as [2 5 7 11]..i.e., if the number is a prime then that number will be the output i.e., like 2 and 7 in the given example...
I tried using nextprime like below it gives the following error:
case 1:
>>nextprime(sym(100))
Undefined function 'nextprime' for input arguments of type 'sym'.
case 2:
>> nextprime(3)
Undefined function 'nextprime' for input arguments of type 'double'.

Réponse acceptée

Basil C.
Basil C. le 19 Fév 2018
Method 1 This functionality does not run in MATLAB and can be used only via MuPAD Notebook Interface.
  • To create an MuPAD interface use the following code
mupad
nb = allMuPADNotebooks
Then a interface screen shall pop up where you can proceed by using the nextprime(num) function.
Method 2
  • You could also create a user defined function to compute the next prime number. This function takes only a non-negative integers as an argument
function p = nextprime(n)
if (isprime(n))
p=n;
else
while(~isprime(n))
n=n+1;
end
p=n;
end
end
  4 commentaires
Walter Roberson
Walter Roberson le 21 Déc 2019
No. Consider nextprime(3) . isprime(3) is true, so your code would return the non-prime 4.
function Q = nextprime(n)
if (isprime(n))
n=n+1;
end
while(~isprime(n))
n=n+1;
end
Q=n;
end
However, this can be simplified down to Stephen's code of always adding 1 to n first
Hicham Satti
Hicham Satti le 31 Août 2020
%That will run very well
function k=next_prime(n)
if ~n>0 || n~=fix(n) || ~isscalar(n)
error ('Tap a integer positif scalar argument');
else
if isprime(n+1)
k=n+1;
else
j=n+1;
while ~isprime(j)
k=j+1;
j=j+1;
end
end
end

Connectez-vous pour commenter.

Plus de réponses (12)

Arafat Roney
Arafat Roney le 11 Mai 2020
function k=next_prime(n)
i=n+1;
if(isprime(i))
k=i;
else
while(~isprime(i))
i=i+1;
end
k=i;
end
end
  3 commentaires
THIERNO AMADOU MOUCTAR BALDE
thanks
Kartik rao
Kartik rao le 21 Avr 2021
thanks

Connectez-vous pour commenter.


Walter Roberson
Walter Roberson le 19 Fév 2018
nextprime() was added to the Symbolic Toolbox in R2016b.
In releases before that,
feval(symengine, 'nextprime', sym(100))

Siddharth Joshi
Siddharth Joshi le 25 Avr 2020
function k = next_prime(n)
if (~isscalar(n) || n<1 || n ~= fix(n))
error('n should be positive scalar ineger!!!')
else
p=-1;
while p<=0
n=n+1;
p=isprime(n)
end
k=n
end
end
k = next_prime(79)
k =
83
  4 commentaires
Walter Roberson
Walter Roberson le 28 Juil 2021
isprime() returns 0 (false) or 1 (true). Comparing that as < 0 is going to be false except the first time due to the initialization of p=-1 .
The code would have been better as
function k = next_prime(n)
if (~isscalar(n) || n<1 || n ~= fix(n))
error('n should be positive scalar ineger!!!')
else
p=false;
while ~p
n=n+1;
p=isprime(n);
end
k=n;
end
end
Stephen23
Stephen23 le 28 Juil 2021
"The code would have been better as"
... and ultimately simplifies down to this.

Connectez-vous pour commenter.


Buwaneka Dissanayake
Buwaneka Dissanayake le 21 Juin 2020
% what's wrong with this? it take too long to run & fail
function n = next_prime(n)
k = n+1;
while ~isprime(k)
n = n+1;
end
end
what's wrong with this? it take too long to run & fail.
  2 commentaires
Walter Roberson
Walter Roberson le 21 Juin 2020
you test if k is prime but you increment n
SAKSHI CHANDRA
SAKSHI CHANDRA le 22 Juil 2020
your control statement defines k but there is nothing related in the block statements which would check
~isprime(k)

Connectez-vous pour commenter.


MD SADIQUE IQBAL
MD SADIQUE IQBAL le 17 Juil 2020
unction n = next_prime(n)
k = n+1;
while ~isprime(k)
n = n+1;
end
end
  2 commentaires
Stephen23
Stephen23 le 17 Juil 2020
Fails every basic test:
>> next_prime(1)
ans = 1
>> next_prime(2)
ans = 2
>> next_prime(3) % infinite loop, stop using ctrl+c
>> next_prime(4)
ans = 4
>> next_prime(5) % infinite loop, stop using ctrl+c
>> next_prime(6)
ans = 6
>> next_prime(7) % infinite loop, stop using ctrl+c
I can see the pattern... it is a very big hint as to what the bug is. As is reading this thread.
SAKSHI CHANDRA
SAKSHI CHANDRA le 22 Juil 2020
your control statement defines k but there is nothing related in the block statements which would check
~isprime(k)

Connectez-vous pour commenter.


SAKSHI CHANDRA
SAKSHI CHANDRA le 22 Juil 2020
function k = nxt_prime(n)
k=n+1;
while ~isprime(k)
k=k+1;
end
end

Ravindra Pawar
Ravindra Pawar le 13 Août 2020
Modifié(e) : Ravindra Pawar le 13 Août 2020
function k = next_prime(n) %function definition
while ~isprime(n+1) %if n+1 is prime we are out of for loop else loop restarts
n = n+1;
end
k = n+1;
end

shweta s
shweta s le 14 Août 2020
%to find the next prime no.
function p = next_prime(n)
if (isprime(n))
p=n+1;
else
while(~isprime(n))
n=n+1;
end
p=n;
end
end
  3 commentaires
Rik
Rik le 15 Avr 2021
@Sai Krishna Praneeth Duggirala And that is why you should be smart if you want to cheat from this page.
Walter Roberson
Walter Roberson le 15 Avr 2021
Fails for any prime except 2.

Connectez-vous pour commenter.


Hicham Satti
Hicham Satti le 31 Août 2020
%That will run very well
function k=next_prime(n)
if ~n>0 || n~=fix(n) || ~isscalar(n)
error ('Tap a integer positif scalar argument');
else
if isprime(n+1)
k=n+1;
else
j=n+1;
while ~isprime(j)
k=j+1;
j=j+1;
end
end
end
  3 commentaires
Hicham Satti
Hicham Satti le 8 Sep 2020
why the other codes answers are not deleted ??
Rik
Rik le 8 Sep 2020
Because I'm just one person trying to clean up thread like this. And you didn't answer my question (neither here, nor on the other next_prime thread).

Connectez-vous pour commenter.


Pragyan Dash
Pragyan Dash le 19 Sep 2020
function k = next_prime(n)
while (~isprime(n + 1))
n = n + 1;
end
k = n + 1;
end

Malgorzata Frydrych
Malgorzata Frydrych le 26 Juin 2021
function k= next_prime(n)
if ~isscalar(n) || n<=0 || mod(n,1)~=0;
error('number should be a positive integer scalar')
end
k=0;
while ~isprime(k)
n=n+1;
k=n;
end
end
  1 commentaire
Walter Roberson
Walter Roberson le 26 Juin 2021
Is this efficient? If you are currently at 15, is there a point in testing 16?

Connectez-vous pour commenter.


Dikshita Madkatte
Dikshita Madkatte le 14 Juil 2021
Modifié(e) : Dikshita Madkatte le 14 Juil 2021
function k=next_prime(n)
if ~n>0 || n~=fix(n) || ~isscalar(n);
fprintf('n should be positive interger')
end
i=n+1;
if (isprime(i))
k=i;
else
while(~isprime(i))
i=i+1;
end
k=i;
end
end
  1 commentaire
Rik
Rik le 14 Juil 2021
A few remarks:
fprintf is not an error. Your code will still run after it fails the check.
You can increment i by two, since 2 is the only even prime, and the while loop will not be reached if n is 1.
You forgot to write documentation for your function. What is this going to teach? Why should it not be deleted?

Connectez-vous pour commenter.

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by