#Calculate the n-th prime number when n<=100.

23 messages · Page 1 of 1 (latest)

white kernel
#

Hi everyone, I'm here again. I was studying this Math book about the natural numbers set properties and induction, and looked this problem, Idk how to face it, can you help me?

kind ledgeBOT
#
  1. Wait patiently for a helper to come along.
  2. Once someone helps you, say thank you and close the thread with:
+close
  1. Feel free to nominate the person for helper of the week in #helper-nominations
  2. Do not ping the mods, unless someone is breaking the rules.
  3. If you're happy with the help you got here, and the server overall, you can contribute financially as well:
proper cave
#

oka

true cedarBOT
#

wolfqz

proper cave
# true cedar **wolfqz**

because the argument of cosine (excluding pi) is an integer for all j=1 and prime j but fractional for all composite j (by wilsons theorem)

#

@umbral wind can you help me here :3

umbral wind
#

hi

umbral wind
#

I doubt wolfie knows it

proper cave
umbral wind
#

wolfie you aren't actually helping

proper cave
#

wdym bro

proper cave
sharp island
#

idk

white kernel
#

Hi @proper cave and @umbral wind , nice to meet you and thank u for your help. I'm looking at Sieve method, I can't give a conclusion about it yet.

Idk if it is asking to build a function or something like that; just before that exercise I learned about the Hanoi Towers and the function T(n)=2^(n)-1, how to deduce and demonstrate it; then, the book gives me that problem and I was wtf bro?
What do you think about what it is asking me?

bronze sirenBOT
#

@white kernel has given 1 rep to @proper cave @umbral wind

white kernel
#

And @sharp island Idk what it means, in my opinion it asks me to build a sequence or a function about the prime numbers. I was studying Induction and natural numbers set properties before the problem, and Hanoi Towers, of course. What do you think?

sharp island
#

there's not a good formula for the nth prime

#

there is only overcomplicated stuff that ends up just basically being a computer program

steady moon
#

As in almost just as efficient as just crossing every multiple of the highest prime you've got and fi ding the next one