The following pages link to Michael Filaseta (Q213630):
Displaying 42 items.
- (Q4250383) (← links)
- (Q4252157) (← links)
- An extension of a theorem by Ljunggren (Q4267275) (← links)
- A result on the digits of aⁿ (Q4275444) (← links)
- The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable (Q4285917) (← links)
- An estimate for the number of reducible Bessel polynomials of bounded degree (Q4322346) (← links)
- The distribution of squarefull numbers in short intervals (Q4324600) (← links)
- Norms of factors of polynomials (Q4369672) (← links)
- On a limit point associated with the abc-conjecture (Q4386277) (← links)
- (Q4431737) (← links)
- On testing the divisibility of lacunary polynomials by cyclotomic polynomials (Q4452173) (← links)
- A generalization of a second irreducibility theorem of I. Schur (Q4484439) (← links)
- The irreducibility of the Bessel polynomials (Q4539582) (← links)
- On mth order Bernoulli polynomials of degree m that are Eisenstein (Q4548911) (← links)
- On the Galois group over $\mathbb Q$ of a truncated binomial expansion (Q4562586) (← links)
- Irreducibility testing of lacunary 0,1-polynomials (Q4675486) (← links)
- Classes of polynomials having only one non-cyclotomic irreducible factor (Q4703808) (← links)
- The Distribution of Fractional Parts with Applications to Gap Results in Number Theory (Q4715313) (← links)
- (Q4718187) (← links)
- On the irreducibility of the generalized Laguerre polynomials (Q4790131) (← links)
- A generalization of a third irreducibility theorem of I. Schur (Q4811275) (← links)
- On the irreducibility of 0,1-polynomials of the form f(x) x<sup>n</sup>+ g(x) (Q4821090) (← links)
- Squarefree values of polynomials all of whose coefficients are 0 and 1 (Q4877380) (← links)
- (Q4885316) (← links)
- Widely Digitally Stable Numbers (Q5051821) (← links)
- Consecutive primes which are widely digitally delicate (Q5096037) (← links)
- (Q5109423) (← links)
- Primes that become composite after changing an arbitrary digit (Q5145107) (← links)
- On the irreducibility of the non-reciprocal part of polynomials of the form $f(x) x^n + g(x)$ (Q5146466) (← links)
- (Q5188090) (← links)
- Computationally classifying polynomials with small Euclidean norm having reducible non-reciprocal parts (Q5226549) (← links)
- A CLASS OF IRREDUCIBLE POLYNOMIALS ASSOCIATED WITH PRIME DIVISORS OF VALUES OF CYCLOTOMIC POLYNOMIALS (Q5230050) (← links)
- An explicit dense universal Hilbert set (Q5242506) (← links)
- Two Diophantine approaches to the irreducibility of certain trinomials (Q5293287) (← links)
- A distribution problem for powerfree values of irreducible polynomials (Q5948340) (← links)
- On the factorization of lacunary polynomials (Q6071852) (← links)
- A generalization of a fourth irreducibility theorem of I. Schur (Q6121318) (← links)
- On \(n\)th order Euler polynomials of degree \(n\) that are Eisenstein (Q6146223) (← links)
- Generalized Sierpiński numbers (Q6187579) (← links)
- Covering systems with the sum of the reciprocals of the moduli close to $1$ (Q6737401) (← links)
- On the distance between factorials and repunits (Q6753368) (← links)
- On extreme values of $r_3(n)$ in arithmetic progressions (Q6756266) (← links)
