中文
相关论文

相关论文: Elementary results on the binary quadratic form a^…

200 篇论文

For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for…

组合数学 · 数学 2021-03-30 C P Anil Kumar

In this paper, we prove that every pair of sufficiently large odd integers can be represented in the form of a pair of one prime, four prime cubes and $48$ powers of $2$.

数论 · 数学 2024-01-23 Xue Han , Huafeng Liu

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

Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…

数论 · 数学 2021-06-04 Alessandro Languasco , Alessandro Zaccagnini

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

数论 · 数学 2022-11-17 Konstantinos A. Draziotis

We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…

综合数学 · 数学 2007-07-10 Leopoldo Garavaglia , Mario Garavaglia

Given a squarefree positive integer $d$, we want to find integers (or rational numbers with denominators not divisible by large primes) $a_0,a_1,a_2,\ldots$ such that for sufficiently large primes $p$ we have $\sum_{k=0}^{p-1}a_k\equiv…

数论 · 数学 2014-02-21 Zhi-Wei Sun

In this paper we study some structure properties of primitive weird numbers in terms of their factorization. We give sufficient conditions to ensure that a positive integer is weird. Two algorithms for generating weird numbers having a…

Let $k$ be a positive integer, and let $a,b$ be coprime positive integers with $\min\{a,b\}>1$. In this paper, using a combination of some elementary number theory techniques with classical results on the Nagell-Ljunggren equation, the…

数论 · 数学 2023-08-24 Maohua Le , Gökhan Soydan

Let $D<0$ be a fundamental discriminant and $h(D)$ be the class number of $\mathbb{Q}(\sqrt{D})$. Let $R(X,D)$ be the number of classes of the binary quadratic forms of discriminant $D$ which represent a prime number in the interval…

数论 · 数学 2019-08-13 Naser T. Sardari

For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…

数论 · 数学 2023-02-09 Aliaksei Semchankau

We show conditions on $k$ such that any number $x$ in the interval $[0, k/2]$ can be represented in the form $x_1^{a_1} x_2^{a_2} + x_3^{a_3} x_4^{a_4} + \cdots + x_{k-1}^{a_{k-1}} x_k^{a_k}$, where the exponents $a_{2i-1}$ and $a_{2i}$ are…

数论 · 数学 2025-07-15 Haotian Zhao

In 1997 K. Ono and K. Soundararajan [Invent. Math. 130(1997)] proved that under the generalized Riemann hypothesis any positive odd integer greater than 2719 can be represented by the famous Ramanujan form $x^2+y^2+10z^2$, equivalently the…

数论 · 数学 2010-08-18 Ben Kane , Zhi-Wei Sun

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

数论 · 数学 2025-05-14 Likun Xie

We study divisibility properties of certain sums and alternating sums involving binomial coefficients and powers of integers. For example, we prove that for all positive integers $n_1,..., n_m$, $n_{m+1}=n_1$, and any nonnegative integer…

数论 · 数学 2012-04-10 Victor J. W. Guo , Jiang Zeng

Given a binary quadratic form $F \in \mathbb{Z}[X, Y]$, we define its value set $F(\mathbb{Z}^2)$ to be $\{F(x, y) : (x, y) \in \mathbb{Z}^2\}$. If $F$ and $G$ are two binary quadratic forms with integer coefficients, we give necessary and…

数论 · 数学 2024-04-30 Étienne Fouvry , Peter Koymans

This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…

综合数学 · 数学 2013-02-20 N. A. Carella

Let $p$ be an odd prime, $k,\ell$ be positive integers, $q=p^k, Q=p^{\ell}$. In this paper we characterise planar functions of the form $f_{\underline{c}}(X)=c_0X^{qQ+q}+c_1X^{qQ+1}+c_2X^{Q+q}+c_3X^{Q+1}$ over $\mathbb{F}_{q^2}$ for any…

数论 · 数学 2025-05-14 Chin Hei Chan , Maosheng Xiong

We give some new canonical representations for forms over $\cc$. For example, a general binary quartic form can be written as the square of a quadratic form plus the fourth power of a linear form. A general cubic form in $(x_1,...,x_n)$ can…

代数几何 · 数学 2016-01-20 Bruce Reznick

Let $k\ge 2$ and $a_1, a_2, \cdots, a_k$ be positive integers with \[ \gcd(a_1, a_2, \cdots, a_k)=1. \] It is proved that there exists a positive integer $G_{a_1, a_2, \cdots, a_k}$ such that every integer $n$ strictly greater than it can…

数论 · 数学 2025-09-11 Yuchen Ding , Weijia Wang , Hao Zhang
‹ 上一页 1 8 9 10 下一页 ›