Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA Shifted Sum for the Congruent Number Problem
161
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We introduce a shifted convolution sum that is parametrized by the squarefree natural number $t$. The asymptotic growth of this series depends explicitly on whether or not $t$ is a emph{congruent number}, an integer that is the area of a rational right triangle. This series presents a new avenue of inquiry for The Congruent Number Problem.
rate research
Read More
In this article, we discuss whether a single congruent number $t$ can have two (or more) distinct triangles with the same hypotenuse. We also describe and carry out computational experimentation providing evidence that this does not occur.
We take an approach toward counting the number of n for which the curves E_n: y^2=x^3-n^2x have 2-Selmer groups of a given size. This question was also discussed in a pair of Invent. Math. papers by Roger Heath-Brown. We discuss the connection between computing the size of these Selmer groups and verifying cases of the Birch and Swinnerton-Dyer Conjecture. The key ingredient for the asymptotic formulae is the ``independence of the Legendre symbol evaluated at the prime divisors of an integer with exactly k prime factors.
Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of representing $n$ as an ordered product of $j+r$ factors, of which the first $j$ must be non-trivial, and their natural extension to negative integers $r.$ We give recurrence properties and explicit formulae for these novel arithmetic functions. Specifically, the functions $c_j^{(-j)}(n)$ count, up to a sign, the number of ordered factorisations of $n$ into $j$ square-free non-trivial factors. These functions are related to a modified version of the Mobius function and turn out to play a central role in counting the number of sum systems of given dimensions. par Sum systems are finite collections of finite sets of non-negative integers, of prescribed cardinalities, such that their set sum generates consecutive integers without repetitions. Using a recently established bijection between sum systems and joint ordered factorisations of their component set cardinalities, we prove a formula expressing the number of different sum systems in terms of associated divisor functions.
We solve the sup-norm problem for spherical Hecke-Maass newforms of square-free level for the group GL(2) over a number field, with a power saving over the local geometric bound simultaneously in the eigenvalue and the level aspect. Our bounds feature a Weyl-type exponent in the level aspect, they reproduce or improve upon all known special cases, and over totally real fields they are as strong as the best known hybrid result over the rationals.
In this paper, $p$ and $q$ are two different odd primes. First, We construct the congruent elliptic curves corresponding to $p$, $2p$, $pq$, and $2pq,$ then, in the cases of congruent numbers, we determine the rank of the corresponding congruent elliptic curves.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
