Hello, everybody.
My teacher recently (a year ago) gave me some sheets with problems about coprime numbers, however, without help I couldn't solve even one problem. It is quite sad because I usually don't feel so beat down by math that I wouldn't even get an idea of where to start with solving a problem. That got me thinking that perhaps I lack understanding of coprimes. Perhaps anyone know great resources for learning some stuff about them? Keep in mind that I am not really advanced in math and that all things about coprimes that I know are that greatest common divisor of all the coprime numbers are 1 (recently got into phi function as well, but that is not helping me at all in doing those problems :( ).
Examples of problems that I am struggling with:
1: Prove that if and are coprime, then and are also coprime, if is any natural number.
2: Prove that if is a prime number, which isn't equal to 2 nor 3, then is a multiple of 24. (Oh, I think that I lack of understanding of prime numbers as well)
And quite a lot more. (I understand when someone give the solution to problem, but I can't grasp any of them on my own...)
If you don't know any books, but can give me some advice, I would be glad to read it :)
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
First example: As gcd(a,b)=1, a and b have no common prime factors. They won't have any common prime factors when they are raised to a natural number. The result follows.
Second example: All prime numbers>3 are of the form 6n±1 where n is a positive integer.
So, a2−1=36n2±12n=12n(3n±1).
If n is even, 24 all divide 12n and if n is odd, 24 will divide 12(3n±1).
Proved.
Check out greatest common divisor and euclidean algorithm.
Log in to reply
Thank you very much!