Skip to main content

All Questions

5 questions with no upvoted or accepted answers
7 votes
0 answers
132 views

Is there a polynomial $p$ such that it is bijective and $ p: \mathbb{Q}^n \rightarrow \mathbb{Q}$ for $ n>1$ ??

Let us define a polynomial $p$ defined as follow $$p: \mathbb{Q}^n \rightarrow \mathbb{Q}.$$ I acrossed this question in mind. Is there a polynomial $p$ such that it is bijective and $p: \mathbb{Q}...
zeraoulia rafik's user avatar
2 votes
0 answers
66 views

A first course in abstract algebra Fraleigh 8th ed Section 5 Exercise 65

Cracker Barrel Restaurants place a puzzle called “Jump All But One Game” at each table. The puzzle starts with golf tees arranged in a triangle as in Figure 5.29a where the presence of a tee is noted ...
점시맙's user avatar
2 votes
0 answers
127 views

Polynomials and NSA

I'm looking for some applications of criteria of irreducibility of integer polynomials inside and outside mathematics. I was reading the CV of Filaseta, a great researcher in this area and he has ...
user42912's user avatar
  • 23.7k
1 vote
0 answers
72 views

Prove the application $\Phi$ is bijective.

I am working on a problem set and I need some assistance with an exercise. The exercise goes as follows: Let $A$ be a ring and $I \unlhd A$ an ideal. Given the natural projection $\pi : A \rightarrow ...
Phosphene's user avatar
  • 157
1 vote
0 answers
378 views

Application of Jordan–Hölder theorem

Jordan–Hölder theorem can be used to prove the fundamental theorem of arithmetic. But I can only prove the uniqueness part of the theorem with Jordan–Hölder theorem. That every composite number is ...
Shiksharthi Sharma's user avatar