Find a counterexample to the following: If n is a natural number then n^2 + n + 41 is a prime number. I guess the only way to do this is by trial and error?
Let n = 41 then you can factor 41 out.
yes! - that didn't occur to me!!!!
obvious really!!
this form might make it obvious \[n(n+1) + 41\]
can someone pls help me
this was widely believed to be a prime generating function until Euler gave counter example putting an end to the conjecture
history behind this quadratic is pretty interesting
yeah there is greats formula ppl thought they are prime :D
yes - i've been reading about Euler recently - he was amazing. He could do complex problems in his head. A lot of his best work was done after he lost his sight.
great things cant be seen by eyes , only whom open their hears and minds can see it !
like eluer xD
he did a surgery himself on his eye, which was successful but later he got an infection (they did not know about sterilization)
he had mathematician ego :D
:)
Didn't newton do a surgery on his own eye to, wait he put a needle on his eye to see what would happen to light...silly geniuses.
yes, he put a needle in his eye. he also stared the sun
- not too clever in that respect!!
I think that was Gallileo who stared at the sun
many scientists died or received harm in the pursuit of knowledge, such as the caries and their experiments on radium and polonium
i thought it was newton :) woops
Nope :d Newton knows!
well , im sure he dint do it again :D
lol reminds me of a story... there is a demigod in hindu mythology who flied to the setting sun thinking of it as a red apple and screwed up his lips ;) http://media1.santabanta.com/full1/Bollywood%20Movies/Hanuman/han1v.jpg
Aw :3
cute lol
I've heard that story before to xD
lol
Join our real-time social learning platform and learn together with your friends!