Note to self: 1 is not a prime number.
–
Calvin Lin
Staff
·
1 year ago

Log in to reply

This is from the First HK TST.
–
Sualeh Asif
·
10 months, 3 weeks ago

Log in to reply

One question from me:
Is every odd prime representable in form of 4k \( \pm\) 1, where k \( \epsilon \) N ? Or Is every prime greater than 3 is representable in form of 6k \( \pm\) 1, where k \( \epsilon \) N ?
–
Sachin Vishwakarma
·
1 year ago

Log in to reply

@Sachin Vishwakarma
–
Every odd number (not necessarily prime) is representable in the form \( 4k \pm 1 \) for a suitable k.
–
Calvin Lin
Staff
·
1 year ago

## Comments

Sort by:

TopNewestNote to self: 1 is not a prime number. – Calvin Lin Staff · 1 year ago

Log in to reply

This is from the First HK TST. – Sualeh Asif · 10 months, 3 weeks ago

Log in to reply

One question from me: Is every odd prime representable in form of 4k \( \pm\) 1, where k \( \epsilon \) N ? Or Is every prime greater than 3 is representable in form of 6k \( \pm\) 1, where k \( \epsilon \) N ? – Sachin Vishwakarma · 1 year ago

Log in to reply

– Calvin Lin Staff · 1 year ago

Every odd number (not necessarily prime) is representable in the form \( 4k \pm 1 \) for a suitable k.Log in to reply

– Sachin Vishwakarma · 1 year ago

And for \( 6k \pm 1 \) ?Log in to reply

Proof: \(6k, 6k +2,6k+4\) are divisible by 2

\(6k+3\) is divisible by 3 – Sualeh Asif · 10 months, 3 weeks ago

Log in to reply