Diophantine equations in semiprimes

IF 1 3区 数学 Q1 MATHEMATICS Discrete Analysis Pub Date : 2017-09-11 DOI:10.19086/da.11075
S. Yamagishi
{"title":"Diophantine equations in semiprimes","authors":"S. Yamagishi","doi":"10.19086/da.11075","DOIUrl":null,"url":null,"abstract":"A semiprime is a natural number which is the product of two (not necessarily distinct) prime numbers. Let $F(x_1, \\ldots, x_n)$ be a degree $d$ homogeneous form with integer coefficients. We provide sufficient conditions, similar to that of the seminal work of B. J. Birch, for which the equation $F (x_1, \\ldots, x_n) = 0$ has infinitely many solutions whose coordinates are all semiprimes. Previously it was known due to \\'A. Magyar and T. Titichetrakun that under the same hypotheses there exist infinite number of integer solutions to the equation whose coordinates have at most $384 n^{3/2} d (d+1)$ prime factors. Our main result reduces this bound on the number of prime factors from $384 n^{3/2} d (d+1)$ to $2$.","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2017-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.19086/da.11075","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 4

Abstract

A semiprime is a natural number which is the product of two (not necessarily distinct) prime numbers. Let $F(x_1, \ldots, x_n)$ be a degree $d$ homogeneous form with integer coefficients. We provide sufficient conditions, similar to that of the seminal work of B. J. Birch, for which the equation $F (x_1, \ldots, x_n) = 0$ has infinitely many solutions whose coordinates are all semiprimes. Previously it was known due to \'A. Magyar and T. Titichetrakun that under the same hypotheses there exist infinite number of integer solutions to the equation whose coordinates have at most $384 n^{3/2} d (d+1)$ prime factors. Our main result reduces this bound on the number of prime factors from $384 n^{3/2} d (d+1)$ to $2$.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
半素数中的丢番图方程
半素数是一个自然数,它是两个(不一定不同)素数的乘积。设$F(x_1,\ldots,x_n)$是具有整数系数的次$d$齐次形式。我们提供了充分的条件,类似于B.J.Birch的开创性工作,其中方程$F(x_1,\ldots,x_n)=0$具有无限多个坐标都是半素数的解。以前它是由于“”而为人所知。Magyar和T.Titichtrakun认为,在相同的假设下,方程存在无限多个整数解,其坐标至多为$384n^{3/2}d(d+1)$素因子。我们的主要结果将素数的这个界从$384n^{3/2}d(d+1)$减少到$2$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Analysis
Discrete Analysis Mathematics-Algebra and Number Theory
CiteScore
1.60
自引率
0.00%
发文量
1
审稿时长
17 weeks
期刊介绍: Discrete Analysis is a mathematical journal that aims to publish articles that are analytical in flavour but that also have an impact on the study of discrete structures. The areas covered include (all or parts of) harmonic analysis, ergodic theory, topological dynamics, growth in groups, analytic number theory, additive combinatorics, combinatorial number theory, extremal and probabilistic combinatorics, combinatorial geometry, convexity, metric geometry, and theoretical computer science. As a rough guideline, we are looking for papers that are likely to be of genuine interest to the editors of the journal.
期刊最新文献
Stronger arithmetic equivalence Random volumes in d-dimensional polytopes Joints formed by lines and a $k$-plane, and a discrete estimate of Kakeya type An efficient container lemma A characterization of polynomials whose high powers have non-negative coefficients
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1