中文
相关论文

相关论文: On the representation of friable integers by linea…

200 篇论文

We use sums of Liouville type to count the number of ways a positive integer can be represented by the forms $(a+c)^{1/3}x + (b+d)y$, $(a+c)x + \bigl(k(b+d) \bigr)^{1/3} y$, and $\bigl(k(a+c) \bigr)^{1/3} x + l(b+d) y$ for nonnegative…

数论 · 数学 2014-03-11 Mohamed El Bachraoui

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

历史与综述 · 数学 2020-02-04 Alberto Fraile , Roberto Martinez , Daniel Fernandez

We establish two new Waring--Goldbach type representations: every sufficiently large odd integer $n$ can be expressed as \[ n = p_1^2 + p_2^2 + p_3^3 + p_4^3 + p_5^5 + p_6^6 + p_7^c, \] where each $p_i$ is prime and $c \in \{6,7\}$.

数论 · 数学 2025-12-08 Geovane Matheus Lemes Andrade , Hemar Godinho

We study a linear form in the values of Euler's series $F(t)=\sum_{n=0}^\infty n!t^n$ at algebraic integer points $\alpha_1, \ldots, \alpha_m \in \mathbb{Z}_{\mathbb{K}}$ belonging to a number field $\mathbb{K}$. Let $v|p$ be a…

数论 · 数学 2018-10-01 Louna Seppälä

We prove a highest weight theorem classifying irerducible finite--dimensional representations of quantum affine algebras and survey what is currently known about the structure of these representations.

高能物理 - 理论 · 物理学 2008-02-03 V. Chari , A. N. Pressley

Let $1\leq i \leq k < n$ be integers. We prove the following exact inequalities for any convex body $K\subset\mathbb{R}^n$ with centroid at the origin, and any $k$-dimensional subspace $E\subset \mathbb{R}^n$: \begin{align*} &V_i \big(…

度量几何 · 数学 2018-09-18 Matthew Stephen , Vladyslav Yaskin

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

数论 · 数学 2022-01-06 Błażej Żmija

Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…

数论 · 数学 2012-10-16 Jhon J. Bravo , Florian Luca

Let $1 < c < 24/19$. We show that the number of integers $n \le N$ that cannot be written as $[p_1^c] + [p_2^c]$ ($p_1$, $p_2$ primes) is $O(N^{1-\sigma+\varepsilon})$. Here $\sigma$ is a positive function of $c$ (given explicitly) and…

数论 · 数学 2021-11-19 Roger Baker

Let f(x_1,x_2,...,x_m) = u_1x_1+u_2 x_2+... + u_mx_m be a linear form with positive integer coefficients, and let N_f(k) = min{|f(A)| : A \subseteq Z and |A|=k}. A minimizing k-set for f is a set A such that |A|=k and |f(A)| = N_f(k). A…

数论 · 数学 2021-01-06 Melvyn B. Nathanson

Let $P_1,\dots,P_k \colon {\bf Z} \to {\bf Z}$ be polynomials of degree at most $d$ for some $d \geq 1$, with the degree $d$ coefficients all distinct, and admissible in the sense that for every prime $p$, there exists integers $n,m$ such…

数论 · 数学 2016-03-28 Terence Tao , Tamar Ziegler

We investigate the problem of succinctly representing an arbitrary permutation, \pi, on {0,...,n-1} so that \pi^k(i) can be computed quickly for any i and any (positive or negative) integer power k. A representation taking (1+\epsilon) n lg…

数据结构与算法 · 计算机科学 2011-08-10 J. Ian Munro , Rajeev Raman , Venkatesh Raman , S. Srinivasa Rao

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

Let $E$ be an elliptic curve over the finite field $\mathbb F_q$. We prove that, when $n$ is a sufficiently large positive integer, $\#E(\mathbb F_{q^n})$ has a prime factor exceeding $n\exp(c\log n/\log\log n)$.

数论 · 数学 2021-12-15 Yuri Bilu , Haojie Hong , Florian Luca

We give upper and lower bounds for the largest integer not representable as positive linear combination of three given integers, disproving an upper bound conjectured by Beck, Einstein and Zacks.

数论 · 数学 2011-05-10 Jan-Christoph Schlage-Puchta

For a positive integer $n>1$ denote by $\omega(n)$ the maximal possible number $k$ of different functions $f_1,\dots,f_k:\mathbb{Z}/n\mathbb{Z}\mapsto \mathbb{Z}/n\mathbb{Z}$ such that each function $f_i-f_j,i<j$, is bijective. Recently A.…

组合数学 · 数学 2019-01-03 D. Cherkashin , F. Petrov , V. Sokolov

The inverse problem for representation functions takes as input a triple (X,f,L), where X is a countable semigroup, f : X --> N_0 \cup {\infty} a function, L : a_1 x_1 + ... + a_h x_h an X-linear form and asks for a subset A \subseteq X…

数论 · 数学 2007-12-31 Peter Hegarty

Let $\{ {U_{n}\}_{n \geq 0} }$ be a non-degenerate binary recurrence sequence with positive discriminant. Let $\{p_1,\ldots, p_s\}$ be fixed prime numbers and $\{b_1,\ldots ,b_s\}$ be fixed non-negative integers. In this paper, we obtain…

数论 · 数学 2016-12-20 N. K. Meher , S. S. Rout

Let g_j denote the largest integer that is represented exactly j times as a non-negative integer linear combination of { x_1, ... , x_n. We show that for any k > 0, and n = 5, the quantity g_0 - g_k is unbounded. Furthermore, we provide…

数论 · 数学 2010-09-08 Jeffrey Shallit , James Stankewicz

Let $f$ be a non-CM Hecke eigencusp form of level 1 and fixed weight, and let $\{\lambda_f(n)\}_n$ be its sequence of normalized Fourier coefficients. We show that if $K/ \mathbb{Q}$ is any number field, and $\mathcal{N}_K$ denotes the…

数论 · 数学 2022-06-07 Alexander P. Mangerel