PL
 |
EN
Ten serwis zostanie wyłączony 2025-02-11.
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 12

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Squarefree values of polynomials
100%
Filaseta M.
Acta Arithmetica
|
1991-1992
|
tom 60
|
nr 3
213-231
2
Content available remote Short interval results for k-free values of irreducible polynomials
100%
Filaseta M.
Acta Arithmetica
|
1993
|
tom 64
|
nr 3
249-270
3
Content available remote On a limit point associated with the abc-conjecture
63%
Filaseta M. , Konyagin S.
Colloquium Mathematicum
|
1998
|
tom 76
|
nr 2
265-268
4
Content available remote The distribution of squarefull numbers in short intervals
63%
Filaseta M. , Trifonov O.
Acta Arithmetica
|
1994
|
tom 67
|
nr 4
323-333
5
Content available remote A polynomial investigation inspired by work of Schinzel and Sierpiński
63%
Filaseta M. , Harrington J.
Acta Arithmetica
|
2012
|
tom 155
|
nr 2
149-161
6
Content available remote A generalization of a second irreducibility theorem of I. Schur
63%
Allen M. , Filaseta M.
Acta Arithmetica
|
2003
|
tom 109
|
nr 1
65-79
7
Content available remote On the irreducibility of 0,1-polynomials of the form f(x)xⁿ + g(x)
63%
Filaseta M. , Matthews M.
Colloquium Mathematicum
|
2004
|
tom 99
|
nr 1
1-5
EN
If f(x) and g(x) are relatively prime polynomials in ℤ[x] satisfying certain conditions arising from a theorem of Capelli and if n is an integer > N for some sufficiently large N, then the non-reciprocal part of f(x)xⁿ + g(x) is either identically ±1 or is irreducible over the rationals. This result follows from work of Schinzel in 1965. We show here that under the conditions that f(x) and g(x) are relatively prime 0,1-polynomials (so each coefficient is either 0 or 1) and f(0) = g(0) = 1, one can take N = deg g + 2max{deg f, deg g}.
8
Content available remote Norms of factors of polynomials
63%
Filaseta M. , Solan I.
Acta Arithmetica
|
1997
|
tom 82
|
nr 3
243-255
9
Content available remote On mth order Bernoulli polynomials of degree m that are Eisenstein
63%
Adelberg A. , Filaseta M.
Colloquium Mathematicum
|
2002
|
tom 93
|
nr 1
21-26
EN
This paper deals with the irreducibility of the mth order Bernoulli polynomials of degree m. As m tends to infinity, Eisenstein's criterion is shown to imply irreducibility for asymptotically > 1/5 of these polynomials.
10
Content available remote Squarefree values of polynomials all of whose coefficients are 0 and 1
63%
Filaseta M. , Konyagin S.
Acta Arithmetica
|
1996
|
tom 74
|
nr 3
191-205
11
Content available remote A generalization of a third irreducibility theorem of I. Schur
63%
Allen M. , Filaseta M.
Acta Arithmetica
|
2004
|
tom 114
|
nr 2
183-197
12
Content available remote On an irreducibility theorem of I. Schur
32%
Filaseta M.
Acta Arithmetica
|
1991
|
tom 58
|
nr 3
251-272
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.