Let $K=\mathbb{Q}(\alpha)$, where $\alpha$ is a root of $f(x)=x^3+x+1$. If $p$ is a rational prime. What can you say about factorization of $p\mathcal{O}_K$ in $\mathcal{O}_K$? I have this: The discriminant is -31 and the minkowski bound, $M_K \leq 1.57$. Then $N(\mathcal{A})=1$, $\mathcal{A}$ a ideal class. I can say anything about the question?

I was told that sometimes in characteristic 2 that $X^n + X + 1$ is reducible mod 2. What is the smallest $n$ where that is true?

Is there a way to find all integer primitive solutions to the equation $x^2+y^2+z^2+t^2 = w^2$? i.e., is there a parametrization which covers all the possible solutions?

If I have a set of matrices, call this set U, how can I make this a UFD (unique factorization domain)? In other words, given any matrix $X \in U$, I would be able to factorize X as $X_1 X_2 … X_n$ where $X_i \in U$ and this factorization is unique? We may assume the […]

$$x\equiv a \pmod {100}$$ $$x\equiv a^2 \pmod {35}$$ $$x\equiv 3a-2 \pmod {49}$$ 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 […]

Given the prime power factors of $N$, is there a non-quadratic algorithm for finding the largest idempotent of ring $\mathbb{Z}/N\mathbb{Z}$? (That is, the largest number $A \lt N$ such that $A^{2} \equiv A \text{mod} N$.) I know that there are at most $8$ prime power factors ($=K$) for $N$ in the range of interest, thus […]

The precise problem is in how many ways I can write a number $n$ as sum of $4$ numbers say $a,b,c,d$ where $a \leq b \leq c \leq d$. I know about Jacobi’s $4$ square problem which is number of ways to write a number in form of sum of $4$ squares number. There is […]

Find all quartuples $(a,b,c,d)$ with non-negative integers $a,b,c,d$ satisfying $$2^a3^b-5^c7^d=1$$ One solution is $$(2,2,1,1)$$

The question is the natural generalization of the Find all positive integers solutions such that $3^k$ divides $2^n-1$ . Let $p$ to be a prime number and let $k$ & $a$ be fixed natural numbers. Find all natural numbers $n$, such that $p^k \mid a^n-1$?

This must be a basic question. But i need some help. What is the number of decimal places that needs to be considered normally in division operations in order to represent the dividend value as a multiple of divisor and quotient by rounding off. Example: Say i want to divide 3475934 and 3475935 by 65536. […]

Intereting Posts

Is the zero map (between two arbitrary rings) a ring homomorphism?
Formula for the $n$th prime number: discovered?
Finding integers of the form $3x^2 + xy – 5y^2$ where $x$ and $y$ are integers, using diagram via arithmetic progression
If $x^{2}-x\in Z(R)$ for all $x\in R$, then $R$ is commutative.
What are the primitive notions of real analysis?
Evaluation of complete elliptic integrals $K(k) $ for $k=\tan(\pi/8),\sin(\pi/12)$
Learning differential calculus through infinitesimals
Is the embedding problem with a cyclic kernel always solvable?
How to understand the combination formula?
For an outer measure $m^*$, does $m^*(E\cup A)+m^*(E\cap A) = m^*(E)+m^*(A)$ always hold?
When is $\mathbb{Z}$ dense in $\mathbb{C}$?
Why is $\pi$ the Limit of the Absolute Value of the Prime $\zeta$ Function?
$m \times n$ persons stand in $m$ rows and $n$ columns
Proofs of the Cauchy-Schwarz Inequality?
Naive proof that $\sum_{n=1}^{N-1}\cos(2\pi\frac{n}{N})=-1$