N个正整数，其乘积等于m乘以它们的和

Bulletin of Mathematical Sciences and Applications Pub Date : 2014-09-01 DOI:10.18052/WWW.SCIPRESS.COM/BSMASS.11.21

Satish Kumar, H. Kishan

{"title":"N个正整数，其乘积等于m乘以它们的和","authors":"Satish Kumar, H. Kishan","doi":"10.18052/WWW.SCIPRESS.COM/BSMASS.11.21","DOIUrl":null,"url":null,"abstract":"In this article, the problem proposed by Hitesh Jain (2014) has been solved and generalized. Introduction: Recently,Hitesh Jain (2014), presented an open problem that for each positive integer , find N positive integers (not necessarily distinct) whose sum is equal to their roduct. In this article, the above problem has been generalized. It is presented and solved that the product of N positive integers (not necessarily distinct) is M-times of their sum.","PeriodicalId":252632,"journal":{"name":"Bulletin of Mathematical Sciences and Applications","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"N Positive Integers Whose Product is Equal to M-Times of their Sum\",\"authors\":\"Satish Kumar, H. Kishan\",\"doi\":\"10.18052/WWW.SCIPRESS.COM/BSMASS.11.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, the problem proposed by Hitesh Jain (2014) has been solved and generalized. Introduction: Recently,Hitesh Jain (2014), presented an open problem that for each positive integer , find N positive integers (not necessarily distinct) whose sum is equal to their roduct. In this article, the above problem has been generalized. It is presented and solved that the product of N positive integers (not necessarily distinct) is M-times of their sum.\",\"PeriodicalId\":252632,\"journal\":{\"name\":\"Bulletin of Mathematical Sciences and Applications\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of Mathematical Sciences and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18052/WWW.SCIPRESS.COM/BSMASS.11.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Mathematical Sciences and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18052/WWW.SCIPRESS.COM/BSMASS.11.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在这篇文章中，Hitesh Jain(2014)提出的问题得到了解决和推广。最近，Hitesh Jain(2014)提出了一个开放问题，对于每个正整数，找到N个正整数(不一定不同)，其和等于它们的乘积。本文对上述问题进行了推广。给出并求解了N个正整数(不一定是不同的)的乘积是它们和的m倍。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

N Positive Integers Whose Product is Equal to M-Times of their Sum

In this article, the problem proposed by Hitesh Jain (2014) has been solved and generalized. Introduction: Recently,Hitesh Jain (2014), presented an open problem that for each positive integer , find N positive integers (not necessarily distinct) whose sum is equal to their roduct. In this article, the above problem has been generalized. It is presented and solved that the product of N positive integers (not necessarily distinct) is M-times of their sum.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Bulletin of Mathematical Sciences and Applications

自引率

0.00%

发文量