Is $a$ an Integer and What is its Modulo 5 Value?

  • MHB
  • Thread starter lfdahl
  • Start date
  • Tags
    Integer
In summary, the conversation discusses proving that $a = 5^{1000}\cdot sin(1000\alpha)$ is an integer and finding its value modulo 5. However, the method used to find the value is considered unreasonable due to its lack of numerical accuracy. The approximate value of $\alpha$ is only accurate to two decimal places, resulting in a large possible range for $5^{1000}\cdot sin(1000\alpha)$. Thus, this method cannot accurately determine the value of $a$ as an integer.
  • #1
lfdahl
Gold Member
MHB
749
0
Let $a = 5^{1000}\cdot sin(1000\alpha)$ , where $sin(\alpha)=\frac{3}{5}$.

Prove that $a\in \mathbb{Z},$ and find $a\:\: (mod \:\:5)$.
 
Mathematics news on Phys.org
  • #2
lfdahl said:
Let $a = 5^{1000}\cdot sin(1000\alpha)$ , where $sin(\alpha)=\frac{3}{5}$.

Prove that $a\in \mathbb{Z},$ and find $a\:\: (mod \:\:5)$.
I check using calculator $a$ can't be an integer
for $sin(\alpha)=\dfrac{3}{5}\,\,\,\rightarrow \alpha\approx 36.87^o$
$1000\alpha \approx 36870^o$
$sin(1000\alpha)=sin(36870^o)=sin(30^o)=0.5=\dfrac {1}{2}$
$a=\dfrac {5^{1000}}{2}\notin \mathbb{Z},$
for $5^{1000}$ is an odd number
a flaw exists ,this method is incorrect
see #5 Opalg's explanation
 
Last edited:
  • #3
lfdahl said:
Let $a = 5^{1000}\cdot sin(1000\alpha)$ , where $sin(\alpha)=\frac{3}{5}$.

Prove that $a\in \mathbb{Z},$ and find $a\:\: (mod \:\:5)$.

because $\sin \alpha = \frac{3}{5}$ we have $\cos \alpha = \frac{\pm 4}{5}$
we have $\sin(1000\alpha) = Im(\cos(1000\alpha) + i\sin (1000\alpha)) = Im(e^{1000\alpha i})$
$=Im((e^{\alpha i})^{1000}) = Im((\cos \alpha + i\sin\alpha)^{1000}) = I am ( \frac{\pm 4}{5} + i \frac{3}{5})^{1000}$
hence $a = I am (\pm 4 + 3i)^{1000} = Im(\sum_{n=0}^{1000}{1000 \choose b} (\pm 4)^n * (3i)^{1000-n}$
or $a= \sum_{n=1}^{499}{1000 \choose 2n+1} (\pm 4)^{1000 - (2n+ 1)} * 3 * (3i)^{2n}$
The value of a shall be above sum
as each element above is integer and multiple of 5 because $(1000 \choose n)$ is divisible by 5 for all n except 0 and 1000
because numerator has more 5's than denominator hence a is divisible by 5 or $a \pmod 5 = 0$
 
  • #4
kaliprasad said:
because $\sin \alpha = \frac{3}{5}$ we have $\cos \alpha = \frac{\pm 4}{5}$
we have $\sin(1000\alpha) = Im(\cos(1000\alpha) + i\sin (1000\alpha)) = Im(e^{1000\alpha i})$
$=Im((e^{\alpha i})^{1000}) = Im((\cos \alpha + i\sin\alpha)^{1000}) = I am ( \frac{\pm 4}{5} + i \frac{3}{5})^{1000}$
hence $a = I am (\pm 4 + 3i)^{1000} = Im(\sum_{n=0}^{1000}{1000 \choose b} (\pm 4)^n * (3i)^{1000-n}$
or $a= \sum_{n=1}^{499}{1000 \choose 2n+1} (\pm 4)^{1000 - (2n+ 1)} * 3 * (3i)^{2n}$
The value of a shall be above sum
as each element above is integer and multiple of 5 because $(1000 \choose n)$ is divisible by 5 for all n except 0 and 1000
because numerator has more 5's than denominator hence a is divisible by 5 or $a \pmod 5 = 0$
which step of my method is unreasonable ?
 
  • #5
Albert said:
which step of my method is unreasonable ?
The numerical accuracy is hopelessly lacking.

[sp]The approximate value $\alpha\approx 36.87^\circ$ is accurate to two decimal places. So the true value of $\alpha$ lies between $36.865^\circ$ and $36.875^\circ$. Therefore $1000\alpha$ lies between $36865^\circ$ and $36875^\circ$. This tells you that $\sin(1000\alpha)$ lies between $0.42$ and $0.57$. Then when you multiply by $5^{1000}$ (a number with nearly 700 digits) you get a possible variation in the value of $5^{1000}\sin(1000\alpha)$ somewhere in the region from $10^{698.59}$ to $10^{698.97}$. This method cannot possibly be used to show that the true answer is an integer.[/sp]
 
  • #6
Opalg said:
The numerical accuracy is hopelessly lacking.

[sp]The approximate value $\alpha\approx 36.87^\circ$ is accurate to two decimal places. So the true value of $\alpha$ lies between $36.865^\circ$ and $36.875^\circ$. Therefore $1000\alpha$ lies between $36865^\circ$ and $36875^\circ$. This tells you that $\sin(1000\alpha)$ lies between $0.42$ and $0.57$. Then when you multiply by $5^{1000}$ (a number with nearly 700 digits) you get a possible variation in the value of $5^{1000}\sin(1000\alpha)$ somewhere in the region from $10^{698.59}$ to $10^{698.97}$. This method cannot possibly be used to show that the true answer is an integer.[/sp]
thanks a lot
 
  • #7
Hint:

It might be helpful to define $p_n = 5^n \sin(n\alpha) ...$
 
  • #8
Hint:

It might also be helpful to define $q_n = 5^n \cos(n\alpha) ...$
 
  • #9
Suggested solution:

Define $p_n = 5^n \sin(n\alpha)$ and $ q_n = 5^n \cos(n\alpha)$.

Then we have:

\[p_{n+1}=5^{n+1} \sin ((n+1)\alpha )=5^n\sin (n\alpha )5\cos (\alpha )+5\sin(\alpha )5^n \cos(n\alpha ) =\pm 4p_n+3q_n \\\\ q_{n+1}=5^{n+1}\cos ((n+1)\alpha )=5^n\cos (n\alpha )5\cos (\alpha )-5\sin(\alpha )5^n \sin(n\alpha ) =-3p_n\pm 4q_n\]

Now, $p_1 = 3$ and $q_1 = \pm 4$ are integers, and on the second level we get a new pair of integers:\[p_2 = \pm 4 p_1+3q_1 = \pm 4\cdot 3+3\cdot (\pm 4) = \pm 24 \\\\ q_2 = -3p_1 \pm4 q_1 = -3\cdot 3\pm 4 (\pm 4)=7\], so by induction the $j$th level also is expressed by integers, hence $a = p_{1000}$ is an integer.

Now, define $r_n = p_n \:\: (mod\:\:5)$ and $s_n = q_n \:\: (mod\:\:5)$.

($r_1 = p_1 \:\: (mod \:\: 5) = 3$ and $s_1 = q_1 \:\: (mod \:\: 5) = \pm 4 = \mp 1$).It follows, that

\[ r_{n+1} = \pm 4p_n+3q_n \:\: (mod \:\: 5) = \pm 4 r_n + 3s_n = \mp r_n+3s_n.\]

and

\[s_{n+1} = -3p_n \pm 4 q_n \:\: (mod \:\: 5) =-3r_n \mp s_n.\]The two modulo sequences (for $q_1 = \pm 4$) are periodic and both have period $4$, and we get:

$q_1 = 4$: $r_1 = 3, r_2 =4 , r_3 =2 , r_4 =1 , r_5 =3, r_6 = 4, …$

$q_1=-4$: $r_1 = 3, r_2 =1 , r_3 =2 , r_4 =4 , r_5 =3, r_6 = 1, …$

- hence
\[a\: \: \: (mod\: \: 5)=\left\{\begin{matrix} 1,\: \: q_1 = 4\\4,\: \: q_1 = -4 \end{matrix}\right.\]
 
  • #10
you only get $p_1,p_2,q_1,q_2$ are integers
to prove for all $p_n,q_n$ are integers, by inductive method ,you should suggest $p_n,q_n$ are integers
and then you have to prove $p_{n+1}, q_{n+1}$ also are integers
in fact to prove $p_1,p_2,q_1,q_2$ integers quite easy
$p_1=5\times \dfrac {3}{5}=3$
$q_1=\pm 4=\pm\sqrt {5^2-3^2}$
$p_2=\pm25\times (\dfrac {2\times 3\times 4}{5\times 5})=\pm24$
$q_2=25\times \dfrac {\sqrt{25^2-24^2}}{25}=7$
$p_n=5^nsin (n\alpha)$
$q_n=5^ncos(n\alpha)$
 
Last edited:
  • #11
Albert said:
you only get $p_1,p_2,q_1,q_2$ are integers
to prove for all $p_n,q_n$ are integers, by inductive method ,you should suggest $p_n,q_n$ are integers
and then you have to prove $p_{n+1}, q_{n+1}$ also are integers
in fact to prove $p_1,p_2,q_1,q_2$ integers quite easy
$p_1=5\times \dfrac {3}{5}=3$
$q_1=\pm 4=\pm\sqrt {5^2-3^2}$
$p_2=\pm25\times (\dfrac {2\times 3\times 4}{5\times 5})=\pm24$
$q_2=25\times \dfrac {\sqrt{25^2-24^2}}{25}=7$
$p_n=5^nsin (n\alpha)$
$q_n=5^ncos(n\alpha)$

Yes, you´re right, Albert: I should in principle use a full proof by induction. The reason I omitted this, was that the result (that $p_{n+1}$ and $q_{n+1}$ are in fact integers) is quite obvious
 

FAQ: Is $a$ an Integer and What is its Modulo 5 Value?

What does it mean to prove that a is an integer?

Proving that a is an integer means demonstrating that a is a whole number, with no fractional or decimal parts. In other words, a can be divided evenly by 1 with no remainder.

How can I prove that a is an integer?

There are several methods for proving that a is an integer. One way is to show that a is a solution to an equation involving only integers. Another way is to use mathematical induction, which involves proving that a statement is true for a base case and then showing that if the statement is true for one integer, it is also true for the next integer.

Can I use a counterexample to prove that a is not an integer?

Yes, a counterexample can be used to disprove that a is an integer. A counterexample is a value of a that does not satisfy the definition of an integer, and therefore proves that a is not an integer.

Is it possible for a to be a non-integer number and still be considered an integer?

No, an integer is defined as a whole number with no fractional or decimal parts. Therefore, a must be a whole number to be considered an integer.

Why is it important to prove that a is an integer?

Proving that a is an integer is important because it establishes that a certain property or statement is true for all whole numbers. This can be useful in many fields of science, such as number theory, algebra, and computer science.

Similar threads

Back
Top