$19 x \equiv 1 \pmod{35}$ For this, may I know how to get the smallest value of $x$. I know that there is a theorem like $19^{34} = 1 \pmod {35}$. But I don’t think it is the smallest.

Definitions For $a,b \in \mathbb{Z}$, a positive integer $c$ is said to be a common divisor of $a$ and $b$ if $c\mid a$ and $c\mid b$. $c$ is the greatest common divisor of $a$ and $b$ if it is a common divisor of $a,b$ and for any common divisor $d$ of $a$ and $b$, we […]

how can I solve these type of questions : using congruences find the last digit or last two digit of $27^{27^{26}}$ and find remainder when $53^{103}$ is divided by 7. I can solve 2nd question and a simpler case of first question with binomial theorem but in questions like 1st this does not seem to […]

Knowing that the two equations $x^2-2y^2=\pm1$ have infinitely many solutions in $\mathbb{Z}\times \mathbb{Z}$ (i.e., that there are infinitely many elements with norm $\pm 1$ in $\mathbb{Z}[\sqrt{2}]$), how does one prove that the two equations $x^2-2y^2=\pm p$ also have infinitely many solutions in $\mathbb{Z}\times \mathbb{Z}$ for every prime $p$ satisfying $p\equiv_8 \pm 1$?

Show that if $q$ is a number that can be expressed as the sum of two perfect squares, then $2q$ and $5q$ can also be expressed as the sum of two perfect squares. EDIT: I’ve recently revisited this problem and I found an elementary answer which I posted as an answer below.

Let $p$ be an odd prime. Suppose that $a$ is an odd integer and also $a$ is a primitive root modulo $p$. Show that a is also a primitive root modulo $2p$. Any hints will be appreciated. Thanks very much.

Find all pairs of positive integers $(a,b)$ that satisfy $13^a+3=b^2$. If $a$ is even then $3=(b-13^{a/2})(b+13^{a/2})$ which have no solutions. Now if the case $a=2k+1$ is odd then $b^2-13.(13^k)^{2}=3$ I cant proceed from here, please help. Any other methods for the latter case?

Find all the 7 digit numbers that have only 5 and 7 as their digits and divisible by both 5 and 7. I have no clue how to use divisibility of 7 to solve this problem. DO i need to check all the 64 combinations?

Let $a,b,c,m \in \mathbb{Z}$, is it always the case that $$a((b+c) \text{ mod } q) \text{ mod } q = (ab \text{ mod } q + ac \text{ mod } q) \text{ mod } q$$

A series of questions. Explanations would be useful. I have done the first four parts. I am confused on how to go about the last two. Show that for any prime $p$ the largest power of $p$ that divides $n!$ is $$ \left\lfloor \frac{n}{p}\right\rfloor +\left\lfloor \frac{n}{p^2} \right\rfloor +\cdots +\left\lfloor\frac{n}{p^r}\right\rfloor$$ where $p^r\le n < p^{r+1}$ Use […]

Intereting Posts

Prove that the sequence converges
How to prove a trigonometric identity
Approximation of measurable function by simple functions
Circles Of Descartes
Swatting flies with a sledgehammer
Does $\int_{1}^{\infty}\sin(x\log x)dx $ converge?
Group of order $48$ must have a normal subgroup of order $8$ or $16$
There is a subspace $W$ of $V$ such that $V = U \oplus W$
Weak Hausdorff space not KC
integrate $\int \frac{1}{e^{x}+e^{ax}+e^{a^{2}x}} \, dx$
A tough series related with a hypergeometric function with quarter integer parameters
When can L'Hospital rule be used on Multivariable limits.
Why are nets not used more in the teaching of point-set topology?
Almost complex structures on spheres
How to prove that the collection of rank-k matrices forms a closed subset of the space of matrices?