All Questions
Tagged with polynomials elementary-number-theory
668
questions
-6
votes
0
answers
32
views
How is this rough draft of a proof that $(x^2+10x-3=0)∉Qred? [closed]
I wanted to prove that the above quadratic is irreducible over Q without using common methods such as quadratic formula, discriminate, completing the square, rational root theorem, Eisensteins ...
5
votes
1
answer
82
views
Given nonzero $p(x)\in\mathbb Z[x]$. Are there infinitely many integers $n$ such that $p(n)\mid n!$ is satisfied?
This problem comes from a famous exercise in elementary number theory:
Prove that there are infinitely many $n\in\mathbb Z_+$ such that $n^2+1\mid n!$.
I know a lot of ways to do this. A fairly easy ...
- 786
1
vote
1
answer
36
views
Factoring integer polynomials by factoring their values then interpolating
Let $f\in\mathbb Z[x]$ be a non-constant integer polynomial, and let $n$ be a positive integer which is at least $\deg f$. Choose positive integers $a_1<\cdots<a_n$ such that $f(a_i)\neq 0$ for ...
- 1,101
0
votes
3
answers
103
views
Does there exists an integer-coefficient polynomial that extracts the highest digit of an integer in base p? [closed]
Given an odd prime $p$, a positive integer $1 \lt n$, and an integer $x \in \mathbb{Z}/p^n\mathbb{Z}$, does there exist an an integer-coefficient polynomial that extracts the highest digit of $x$?
The ...
- 9
3
votes
1
answer
149
views
Find non-zero polynomials $f(n)$ and $g(n)$ with integer coefficients such that $(n^2+3)f(n)^2+1=g(n)^2$
Find non-zero polynomials $f(n)$ and $g(n)$ with integer coefficients such that $(n^2+3)f(n)^2+1=g(n)^2$.
This problem comes from Pell's equation, which states that for $\forall m\in\mathbb{N}^*$, ...
- 681
-4
votes
1
answer
70
views
Does this proof of $f(X)\not\equiv0\pmod{n}$ (for this specific $f$) imply there is an integer $k$ such that $f(k)\not\equiv0\pmod{n}$? [closed]
A generalization of the following statement is proven in "Primes is in P":
$(X+1)^n-X^n-1\equiv0\pmod{n}$ iff $n$ is prime.
Their proof of the only if part goes something like: if $q^k\Vert ...
- 133
3
votes
2
answers
147
views
A conjecture about the sum of Faulhaber polynomials mod 2.
Context: In this question I asked about "Finding a polynomial function for alternating $m$ numbers of odds and even numbers in sequences" I noticed that all Faulhaber polynomials are ...
- 6,620
8
votes
1
answer
169
views
Finding a polynomial function for alternating m numbers of odds and even numbers in sequences
Context: The function $(-1)^n$ alternates between $1,-1$ because $n$ alternates between odd and even, I was trying to find a function $f(n)$ that will give $m$ positives then $m$ negatives and so on ...
- 6,620
2
votes
1
answer
68
views
Polynomial Divisibility by Factorial Plus One [closed]
Find all polynomials with integer coefficients $f$ such that $f(p) \mid (p-1)! + 1$ for all primes $p$.
Using Wilson’s theorem we find that $f(p)=p;-p$ satisfy the problem. I also thought about using ...
- 637
1
vote
0
answers
157
views
Prove $a^n+\frac{1}{a^n}$ is rational if $a+\frac{1}{a}$ is rational [duplicate]
Assume
$$a+\frac{1}{a}$$
is a rational number.
Prove that $a^n+\frac{1}{a^n}$ is a rational number.
I can easily prove it using induction. I would like to know if is it possible to prove it without ...
- 392
3
votes
2
answers
172
views
Sufficient condition for a polynomial $f$ over $\mathbb Q$ to be linear is $f(\mathbb Q)=\mathbb Q$.
I am reading a book (Polynomial Mappings by W. Narkiewicz) on invariance of polynomial maps where I found the following result along with a proof:
Theorem: Let $f\in\mathbb Q[x]$ be a polynomial such ...
- 1,101
1
vote
0
answers
55
views
Do polynomials taken modulo integers compose?
Intuitive Idea:
Say we have polynomials modulo positive integers; for instance, $f(x) = 3x + 1\pmod 5$ and $g(x) = 5x^2 - x + 3 \pmod 7$. (Yes, there is some abuse of notation here.) We may "...
- 181
19
votes
2
answers
766
views
Is the smallest root of a polynomial always complex if the coefficients is the sequence of prime numbers?
The smallest root of a polynomial is defined as the root which has the smallest absolute value. Consider the polynomial $a_0 + a_1 x + a_2 x^2 + \cdots + a_n x^n$. I observed that if $a_n$, is the ...
- 20.8k
0
votes
0
answers
45
views
Proof of existence of composite number P(x) if P is a non-constant polynomial [duplicate]
Prove that if $P$ is a polynomial with integer coefficients, which is not a constant polynomial, then there is a natural number $x$ such that $P(x)$ is a composite number.
My first thought was to ...
- 11
1
vote
0
answers
70
views
Divisibility of sum of powers of $2$ and $3$
I am looking at the question, whether for some positive integers $h,k,l\in\mathbb{N}$ we have that
$$\left(3^{h+l}-2^{2(k+h)+l}\right)\,\big| \left( 2^{2k+l+1}-2^2 3^{l-1}-2^{2k+1}3^l\right).$$
I ...
- 1,271
3
votes
0
answers
40
views
Calculating $P(x) \bmod x^{k}$ at target value by sampling $P(x)$
Motivation
The motivation behind this question is from a computational mathematics and combinatorics background. It is often convenient to express a problem as a product of polynomials so that the ...
- 294
0
votes
0
answers
24
views
Difference between polynomials with integer and non integer coefficiants regarding number of roots of polynomial [duplicate]
There is a prior question to show that polynomial of degree 7 with all integer coefficiants has 7 integer values $ P(x1,x2...x7)=+-1$ cant be expressed as product of two polynomials with integer ...
- 33
-1
votes
1
answer
82
views
Prove that if polynomial with integral coefficients has a solution in integers, then the congruence is solvable for any value of modulus $m$. [duplicate]
Prove that if $F(x_1, x_2, \ldots, x_n) = 0$, where $F$ is a polynomial with integral coefficients, has a solution in integers, then the congruence $F(x_1, x_2, \ldots, x_n) \equiv 0 \pmod{m}$ is ...
- 402
3
votes
0
answers
90
views
On thickness of binary polynomials
OEIS A169945 introduces the concept of thickness of a polynomial as the magnitude of the largest coefficient in the expansion of the square of the polynomial. Considering the $2^{n+1}$ polynomials $p(...
- 9,592
0
votes
0
answers
49
views
Can you check this proof? Find all polynomials $P(x)$ with integer coefficients such that for each natural number $n, n$ divides $P(2^n)$ [duplicate]
Is this a good proof? I think it is allright but I am not sure. I want to prove this polynomial must be constant, with P(x)=0.
Suppose P isn't constant Let ord_p(2) denote the smallest number 0<k ...
- 27
2
votes
0
answers
69
views
Unsure about a step in proving $e$ is transcendental
I'm currently trying to understand the proof of e being transcendental in Julian Havil The Irrationals, but not sure how the following is concluded.
A polynomial of degree $mp+p-1$ is defined on the ...
- 107
20
votes
4
answers
578
views
When can products of linear terms differ by a constant?
We have
$$ X(X+3) + 2 = (X+1)(X+2)$$
and
$$ X(X+4)(X+5) + 12 = (X+1)(X+2)(X+6)$$
and
$$ X(X+4)(X+7)(X+11) + 180 = (X+1)(X+2)(X+9)(X+10).$$
Do similar polynomial identities exist for each degree?
That ...
- 2,071
0
votes
0
answers
53
views
Extended Euclidian algorithm for polynomials [duplicate]
this question follows one from yesterday that got deleted because it was a duplicate.
The problem was about solving this equation (in $ℚ[x]$) :
$$f(x)(2x^3 + 3x^2 + 7x + 1) + g(x)(5x^4 + x + 1) = x + ...
- 93
0
votes
0
answers
54
views
Simplest failures of Hasse principle
I’m trying to understand the simplest cases where a Diophantine equation has solutions in the reals and modulo all prime powers, but not in the integers.
I know classes of examples of degree 6 in 1 ...
- 361
4
votes
1
answer
84
views
When is $3136 - 6272 n + 3136 n^2 + n^{14}$ a perfect square?
When is $3136 - 6272 n + 3136 n^2 + n^{14} =z^2$ for $z \in \mathbb N$?
Here was my approach: Consider $3136 - 6272 n + 3136 n^2 + n^{14} \pmod 5$. Since any integral square must be equivalent to 0, 1,...
- 972
1
vote
1
answer
39
views
Can relative (or even absolute) quotient size be calculated from a list of polynomials which are multiples of a given variable?
I am working on a Diophantine equation in integers $x$ and $y$. The equation has been solved, so I already know the solutions (there are four) — I am trying to find a more elementary solution.
Through ...
- 7,929
8
votes
0
answers
200
views
Prove that $\Phi_{420}(69) > \Phi_{69}(420)$
Let $\Phi_n(x)$ denote the nth cyclotomic polynomial. Prove that $\Phi_{420}(69) > \Phi_{69}(420)$.
Observe that if $\phi$ denotes the Euler-phi function, \begin{align}
\phi(420) &= (2^2-2) \...
- 1,225
0
votes
0
answers
46
views
Prove that the order of 2 modulo 2n+1 is odd
Let $n$ be a positive integer such that there exists a polynomial $f(x) \in \mathbb{F}_2[x]$ of degree n such that $f(x)\cdot x^n f(1/x) = 1+x+\cdots + x^{2n}\in \mathbb{F}_2[x]$. Prove that the order ...
- 1,225
6
votes
1
answer
300
views
Multiply an integer polynomial with another integer polynomial to get a "big" coefficient
I am new to number theory, I was wondering if the following questions have been studied before.
Given $f(x) = a_0 + a_1 x + a_2 x^2 \cdots + a_n x^n \in \mathbb Z[x]$, we say that $f(x)$ has a big ...
- 1,641
1
vote
0
answers
133
views
$\lfloor a^m\rfloor \equiv -1\mod n $ for $a = n+\sqrt{n^2 - n}$
Let $n \ge 2$ be an integer. Let $a = n+\sqrt{n^2 - n}$. Prove that for any positive integer m, we have $\lfloor a^m\rfloor \equiv -1\mod n$.
Suppose $(x-a)(x-c) = x^2 + ux + v \in \mathbb{Z}[x]$ (...
- 869