Intereting Posts

cusp and node are not isomorphic
General solution to wave equation of half-line with nonhomogeneous Neumann boundary
Showing that if a subset of a complete metric space is closed, it is also complete
Evaluate $\displaystyle\int_0^\pi \frac{x}{1+\sin^2x} \ dx$
Prove weak convergence of a sequence of discrete random variables
Switching from Mathematica to MATLAB: As a text editor?
$\operatorname{Im} A = (\operatorname{ker} A^*)^\perp$
Prime divisibility in a prime square bandtwidth
Which functions on N extend uniquely to a continuous function on the Stone-Cech Compactification of N?
prove or disprove that every positive integer is the sum of a perfect square and a prime number or 1
Follow-up regarding right-continuous $f:\mathbb{R} \to\mathbb{R}$ is Borel measurable
Log concavity of binomial coefficients: $ \binom{n}{k}^2 \geq \binom{n}{k-1}\binom{n}{k+1} $
If $n$ is composite, so is $2^n-1$
The last 2 digits of $7^{7^{7^7}}$
Does there exist a nowhere differentiable, everywhere continous, monotone somewhere function?

$$x\equiv a \pmod {100}$$

$$x\equiv a^2 \pmod {35}$$

$$x\equiv 3a-2 \pmod {49}$$

- Is it impossible to recover multiplication from the division lattice categorically?
- The $\gcd$ operator commutes with functions defined by linear recurrence relations
- $ 0 < a < b\,\Rightarrow\, b\bmod p\, <\, a\bmod p\ $ for some prime $p$
- Why (directly!) does every number divide 9, 99, 999, … or 10, 100, 1000, …, or their product?
- GCD Proof with Multiplication: gcd(ax,bx) = x$\cdot$gcd(a,b)
- Probability that two random numbers are coprime

I’m trying to solve this system of congruences, but I’m only familiar with a method for solving when the mods are pairwise coprime. I feel like there ought to be some simplification I can make to reduce it to a system where they are coprime, and then try to proceed from there, but I’m not sure how to go about it. Also, the fact that two are squares seems to suggest some kind of simplification in that direction.

Hopefully someone can point me in the right direction.

p.s. First time posting so formatting may have gone awry…

- A number system
- If $p$ and $q = 2p + 1$ are both odd primes, show that $-4$ and $2(-1)^{(1/2)(p-1)}$ are both primitive roots modulo $q$.
- Finding the summation of the floor of the series identity
- show that if $a | c$ and $b | c$, then $ab | c$ when $a$ is coprime to $b$.
- Prove if $n$ has a primitive root, then it has exactly $\phi(\phi(n))$ of them
- Why is $n\choose k$ periodic modulo $p$ with period $p^e$?
- Relations of a~b iff b = ak^2
- Proving that the sum and difference of two squares (not equal to zero) can't both be squares.
- Product of $5$ consecutive integers cannot be perfect square
- Showing that $(\mathbb{Z}/p^{a}\mathbb{Z})^*$ is a cyclic group

**Hint** $\ $ A solution exists of $\ x\equiv a_i \pmod{m_i}\iff a_i\equiv a_j \pmod{\gcd(m_i,m_j)}\ $ for all $\,i,j.$

This yields $\ {\rm mod}\ 5\!:\ 0\equiv a^2-a = \color{#c00}a(a-\color{#c00}1),\,$ $\ {\rm mod}\ 7\!:\ 0\equiv a^2-3a+2\equiv (a-\color{#0a0}1)(a-\color{#0a0}2).\,$

Hence the system is solvable iff $\ a\equiv \color{#c00}{0\ \ {\rm or}\ \ 1\pmod{5}}\ \ \ $ and $\ \ \ a\equiv\color{#0a0}{1 \ \ {\rm or}\ \ 2\pmod{7}}$.

This yields $4$ possible combinations $\ {\rm mod}\ (\color{#c00}5,\color{#0a0}7)\!:\,\ a\equiv (\color{#c00}0,\color{#0a0}1),\, (\color{#c00}0,\color{#0a0}2),\, (\color{#c00}1,\color{#0a0}1),\, (\color{#c00}1,\color{#0a0}2)$ which, by CRT, yields $4$ values mod $35,\,$ namely

$\quad {\rm mod}\ (\color{#c00}5,\color{#0a0}7)\!:\,\ a\equiv (\color{#c00}1,\color{#0a0}1)\iff \color{#c00}5,\color{#0a0}7\mid a-1\iff 35\mid a-1\iff a\equiv \ 1\ \pmod{35}$

$\quad {\rm mod}\ (\color{#c00}5,\color{#0a0}7)\!:\,\ a\equiv (\color{#c00}0,\color{#0a0}1)\iff \!a=\color{#c00}5n\ \ \&\ \ a\in \{\color{#0a0}{1,8,15,\ldots}\}\iff a\equiv \color{orange}{15}\pmod{35}$

$\quad {\rm mod}\ (\color{#c00}5,\color{#0a0}7)\!:\,\ a\equiv (\color{#c00}0,\color{#0a0}2) = (0,1)+(0,1)\iff a\equiv \color{orange}{15}+\color{orange}{15}\equiv 30\pmod{35}$

$\quad {\rm mod}\ (\color{#c00}5,\color{#0a0}7)\!:\,\ a\equiv (\color{#c00}1,\color{#0a0}2) = (1,1)+(0,1)\iff a\equiv \ 1\ +\color{orange}{15}\equiv 16\pmod{35}$

*Fixed* Had some arithmetic errors.

From first, $x = 100k+a$. Then from the third, $100k+a – 3a+2 \equiv 0 \pmod {49} \implies 2k-2a+2 \equiv 0 \implies k \equiv a-1 \implies k = 49j+a-1$. Then plug into second.

$100(49j+a-1)-a^2 \equiv 0 \pmod {35} \implies 100a-100-a^2 \equiv 0 \implies -a^2+30a-30 \equiv 0 \pmod {35}$

WA says this has no solutions. I still dont know how I missed $a \equiv 1$..

- Definite integral $\int_1^2 \sqrt{1+\left(-x^{-2}+x^2/4\right)^2}\,dx$
- Prove that $\int\limits_0^1 x^a(1-x)^{-1}\ln x \,dx = -\sum\limits_{n=1}^\infty \frac{1}{(n+a)^2}$
- What is the metric tensor on the n-sphere (hypersphere)?
- $C(M)=\{A\in M_n(\mathbb{C}) \mid AM=MA\}$ is a subspace of dimension at least $n$.
- Generic Elements of a Set.
- Counting non-isomorphic trees from a degree sequence
- Graph theory problem (edge-disjoint matchings)
- Weak Formulations and Lax Milgram:
- how many permutations of {1,2,…,9}
- Numerical methods book
- How to prove that $\lim\limits_{x\to0}\frac{\tan x}x=1$?
- Pullback expanded form.
- Asymptotic integral expansion of $\int_0^{\infty} t^{3/4}e^{-x(t^2+2t^4)}dt$ for $x \to \infty$
- What are the last two digits of $77^{17}$?
- What does E mean in 9.0122222900391E-5?