#Prime proofs
77 messages · Page 1 of 1 (latest)
Second part is easy if you are calm and go slowly
If all primes starting from 2 are multiplied together
Like p1 p2 p3 …….. pn
Then this number will be divisible by all primes or any combination of primes from p1 to pn
But since you added 1 to it, it means it won’t divisible by any of those, because if it were divisible, then you would be able to factorise and write like this pn, where p is a number multiplied to another number n. But trying to factorise leads p(n + 1/p ), and 1/p is not integer
Because no prime number (not just prime, you can also the say same of any integer except 1 and 0) divides into n
So either the number created by adding 1 is prime
Or not prime
And if not prime
This means there is a new prime factor
Because of what I mentioned earlier in 5th line
I hope Q3 is very obvious after this
@steel jasper
This is one of my favourite proofs btw
You should do more questions like this
I understand it now
watched a few bids
vids
the hard part was trying to figure out was that when you factor out a prime from the new number that it leaves a reminder
is it saying that
all numbers can be factored by primes
but since the number we have leaves a remainder after being divided by a prime
there must be some bigger prime that does factor into the new number
is that it?
@hot python
and also
what other qs are like this
thanks!!
Yes
Either that or the new number itself is a prime
Olympiad problems
ohyggy
ok
I understand it
This branch of maths is called number theory
I need to look into doing those
Yep
ye ik
I've always loved seeing the problems
But they are very tough
but they're always so complicated
So take your time
We are not used proofs as much so makes sense
ye true
tf is SMC
oh😭😭
Wait
thought Olympiad and SMC were the same thing yk
maybe.....
They are
Olympiad is like category of competitions
ah
Olympiads could be about lot of things
then smc is the maths part I'm guessing
I definitely will