Abstract: Ramanujan’s lost notebook contains many results on mock theta functions. In particular, the lost notebook contains eight identities for tenth order mock theta functions. Previously many authors proved the first six of Ramanujan’s tenth order mock theta function identities. It is the purpose of this paper to prove the seventh and eighth identities of Ramanujan’s tenth order mock theta function identities which are expressed by mock theta functions and also a definite integral. The properties of modular forms are used for the proofs of theta function identities and L. J. Mordell’s transformation formula for the definite integral.Keywords: Mock Theta Functions from Ramanujan’s Lost Notebook.
Title: Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)
Author: MOHAMMADI BEGUM JEELANI SHAIKH
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
On Some Double Integrals of H -Function of Two Variables and Their ApplicationsIJERA Editor
This paper deals with the evaluation of four integrals of H -function of two variables proposed by Singh and
Mandia [7] and their applications in deriving double half-range Fourier series for the H -function of two
variables. A multiple integral and a multiple half-range Fourier series of the H -function of two variables are
derived analogous to the double integral and double half-range Fourier series of the H -function of two
variables.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Fast Algorithm for Computing the Discrete Hartley Transform of Type-IIijeei-iaes
The generalized discrete Hartley transforms (GDHTs) have proved to be an efficient alternative to the generalized discrete Fourier transforms (GDFTs) for real-valued data applications. In this paper, the development of direct computation of radix-2 decimation-in-time (DIT) algorithm for the fast calculation of the GDHT of type-II (DHT-II) is presented. The mathematical analysis and the implementation of the developed algorithm are derived, showing that this algorithm possesses a regular structure and can be implemented in-place for efficient memory utilization.The performance of the proposed algorithm is analyzed and the computational complexity is calculated for different transform lengths. A comparison between this algorithm and existing DHT-II algorithms shows that it can be considered as a good compromise between the structural and computational complexities.
On Some Integrals of Products of H -FunctionsIJMER
The object of the present paper is to evaluate an integral involving products of three H -function of different arguments which not only provides us the Laplace transform, Hankel transform ([8],p.3), Meijer’s Bessel transform ([8],p.121) and various other integral transforms of the product of two H -functions but also generalizes the result given earlier by many writers notably by Bailey ([3],
p.38), Meijer ([8],p.422) and Slater ([20], p.54(3.7.2).
On Some Double Integrals of H -Function of Two Variables and Their ApplicationsIJERA Editor
This paper deals with the evaluation of four integrals of H -function of two variables proposed by Singh and
Mandia [7] and their applications in deriving double half-range Fourier series for the H -function of two
variables. A multiple integral and a multiple half-range Fourier series of the H -function of two variables are
derived analogous to the double integral and double half-range Fourier series of the H -function of two
variables.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Fast Algorithm for Computing the Discrete Hartley Transform of Type-IIijeei-iaes
The generalized discrete Hartley transforms (GDHTs) have proved to be an efficient alternative to the generalized discrete Fourier transforms (GDFTs) for real-valued data applications. In this paper, the development of direct computation of radix-2 decimation-in-time (DIT) algorithm for the fast calculation of the GDHT of type-II (DHT-II) is presented. The mathematical analysis and the implementation of the developed algorithm are derived, showing that this algorithm possesses a regular structure and can be implemented in-place for efficient memory utilization.The performance of the proposed algorithm is analyzed and the computational complexity is calculated for different transform lengths. A comparison between this algorithm and existing DHT-II algorithms shows that it can be considered as a good compromise between the structural and computational complexities.
On Some Integrals of Products of H -FunctionsIJMER
The object of the present paper is to evaluate an integral involving products of three H -function of different arguments which not only provides us the Laplace transform, Hankel transform ([8],p.3), Meijer’s Bessel transform ([8],p.121) and various other integral transforms of the product of two H -functions but also generalizes the result given earlier by many writers notably by Bailey ([3],
p.38), Meijer ([8],p.422) and Slater ([20], p.54(3.7.2).
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
The second and third authors have recently introduced the concepts of fuzzy C –boundary [3] and fuzzy C –semi boundary [6] where C :[0, 1] [0, 1] is a function. The purpose of this paper is to introduce the concept of fuzzy C -pre boundary and investigate its properties in a fuzzy topological space. MSC 2010: 54A40, 3E72.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
International Journal of Engineering Research and Development is an international premier peer reviewed open access engineering and technology journal promoting the discovery, innovation, advancement and dissemination of basic and transitional knowledge in engineering, technology and related disciplines.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
A generalization of fuzzy semi-pre open sets.IJESM JOURNAL
The authors introduced and studied fuzzy C -closed sets in fuzzy topological space where C : [0, 1] [0, 1] is a complement function. Let X be a non empty set. For any fuzzy subset of X, the complement C of is defined to be C (x)= C ( (x)) for every xX. This C is called a complement function and C is called the complement of with respect to C. Using this, we introduced fuzzy C -regular closed sets, fuzzy C --closed sets, fuzzy C -semi closed sets and fuzzy C -pre closed sets and discussed their basic properties. The purpose of this paper is to introduce fuzzy C - semi pre open sets, fuzzy C -semi-pre closed sets and to discuss their properties.
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Networkpaperpublications3
Abstract: Vehicular ad hoc networks (VANETs) can provide scalable and cost-effective solutions for applications such as traffic safety, dynamic route planning, and context-aware advertisement using short-range wireless communication. To function properly, these applications require efficient routing protocols. However, existing mobile ad hoc network routing and forwarding approaches have limited performance in VANETs. This dissertation shows that routing protocols which account for VANET-specific characteristics in their designs, such as position and mobility of Vehicle, can provide good performance for a large spectrum of applications.
Increased vehicular traffic demands smart vehicles which can interact with each other and roadside infrastructure to prevent accidents. Vehicular Ad-hoc Network (VANET) provides this flexibility to the vehicles. In this desertion we initially analyze the performance of AODV and OLSR, and further we improve the performance of AODV by selecting the node on the basis of trust value of the successive nodes, we also reduce the neighbor hood expiry time and correspondingly update the route table of AODV, with this purposed approach we would be able to reduce the end-to-end delay of AODV sufficiently also the performance of AODV increase in terms of Throughput and packet delivery ratio.Keywords: VANET, AODV, ROUTING, ROUT TABLE.
Title: Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
Author: Dalbir Singh, Amit Jain (Asst. Prof.)
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Study of Color Image Processing For Capturing and Comparing Imagespaperpublications3
Abstract: Study of processing techniques applicable to full color images. Although the process followed by the human brain in perceiving and interpreting color is a phenomenon that is fully understood, the physical nature of color can be expressed on the formal basis supported by experimental and theoretical results. By examining some principal areas it can be applied for detecting, Capturing, Comparing the images. The objective of this article is to educate newcomer to basic and fundamental techniques of detecting & Comparing images and to find out the compared result. All fundamental algorithms of color image processing will be discussed and quality of processed image output comparison will be shown to find out comparison.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
The second and third authors have recently introduced the concepts of fuzzy C –boundary [3] and fuzzy C –semi boundary [6] where C :[0, 1] [0, 1] is a function. The purpose of this paper is to introduce the concept of fuzzy C -pre boundary and investigate its properties in a fuzzy topological space. MSC 2010: 54A40, 3E72.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
International Journal of Engineering Research and Development is an international premier peer reviewed open access engineering and technology journal promoting the discovery, innovation, advancement and dissemination of basic and transitional knowledge in engineering, technology and related disciplines.
International Journal of Engineering Inventions (IJEI) provides a multidisciplinary passage for researchers, managers, professionals, practitioners and students around the globe to publish high quality, peer-reviewed articles on all theoretical and empirical aspects of Engineering and Science.
A generalization of fuzzy semi-pre open sets.IJESM JOURNAL
The authors introduced and studied fuzzy C -closed sets in fuzzy topological space where C : [0, 1] [0, 1] is a complement function. Let X be a non empty set. For any fuzzy subset of X, the complement C of is defined to be C (x)= C ( (x)) for every xX. This C is called a complement function and C is called the complement of with respect to C. Using this, we introduced fuzzy C -regular closed sets, fuzzy C --closed sets, fuzzy C -semi closed sets and fuzzy C -pre closed sets and discussed their basic properties. The purpose of this paper is to introduce fuzzy C - semi pre open sets, fuzzy C -semi-pre closed sets and to discuss their properties.
Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Networkpaperpublications3
Abstract: Vehicular ad hoc networks (VANETs) can provide scalable and cost-effective solutions for applications such as traffic safety, dynamic route planning, and context-aware advertisement using short-range wireless communication. To function properly, these applications require efficient routing protocols. However, existing mobile ad hoc network routing and forwarding approaches have limited performance in VANETs. This dissertation shows that routing protocols which account for VANET-specific characteristics in their designs, such as position and mobility of Vehicle, can provide good performance for a large spectrum of applications.
Increased vehicular traffic demands smart vehicles which can interact with each other and roadside infrastructure to prevent accidents. Vehicular Ad-hoc Network (VANET) provides this flexibility to the vehicles. In this desertion we initially analyze the performance of AODV and OLSR, and further we improve the performance of AODV by selecting the node on the basis of trust value of the successive nodes, we also reduce the neighbor hood expiry time and correspondingly update the route table of AODV, with this purposed approach we would be able to reduce the end-to-end delay of AODV sufficiently also the performance of AODV increase in terms of Throughput and packet delivery ratio.Keywords: VANET, AODV, ROUTING, ROUT TABLE.
Title: Deterministic AODV Routing Protocol for Vehicular Ad-Hoc Network
Author: Dalbir Singh, Amit Jain (Asst. Prof.)
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Study of Color Image Processing For Capturing and Comparing Imagespaperpublications3
Abstract: Study of processing techniques applicable to full color images. Although the process followed by the human brain in perceiving and interpreting color is a phenomenon that is fully understood, the physical nature of color can be expressed on the formal basis supported by experimental and theoretical results. By examining some principal areas it can be applied for detecting, Capturing, Comparing the images. The objective of this article is to educate newcomer to basic and fundamental techniques of detecting & Comparing images and to find out the compared result. All fundamental algorithms of color image processing will be discussed and quality of processed image output comparison will be shown to find out comparison.
Applying Agile Methodologies on Large Software Projectspaperpublications3
Abstract: Agile is suitable for Small projects as contrasted with the large projects. There is some problem in the execution of large projects. Large Projects are not easy to execute. When we use agile methodologies, Large projects are very difficult to implement. To construct a product framework by utilizing agile methodologies we found that the large projects need more practices as compare them with Small projects.
In this paper, I will present an arrangement of latest and changed development practices, which will help in building up a large project. The Agile Framework for Large Projects (AFLP) was connected to four industry cases. The AFLP gives a structured approach to programming associations to adopt agile practices and evaluate the outcomes. The system incorporates an extended Scrum procedure and agile practices, which consist of agility and critical success factors in agile software projects under that chosen from the XP, Scrum and Crystal Clear.Keywords: Agile Methods (Scrum), Large Software Projects, Industrial Case Study.
Title: Applying Agile Methodologies on Large Software Projects
Author: Nida Rashid
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Research on Lexicographic Linear Goal Programming Problem Based on LINGO and ...paperpublications3
Abstract: Lexicographic Linear Goal programming within a pre-emptive priority structure including Column-dropping Rule has been one of the useful techniques considered in solving multiple objective problems. The basic ideas to solve goal programming are transforming goal programming into single-objective linear programming. An optimal solution is attained when all the goals are reached as close as possible to their aspiration level, while satisfying a set of constraints. One of the Goal Programming algorithm – the Lexicographic method including Column-dropping Rule and the method of LINGO software are discussed in this paper. Finally goal programming model are applied to the actual management decisions, multi-objective programming model are established and used LINGO software and Column-dropping Rule to achieve satisfied solution.Keywords: Goal programming, Lexicographic Goal programming, multi-objective, LINGO software, Column-dropping Rule.
Title: Research on Lexicographic Linear Goal Programming Problem Based on LINGO and Column-Dropping Rule
Author: N. R. Neelavathi
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Using ψ-Operator to Formulate a New Definition of Local Functionpaperpublications3
Abstract:In this paper, we use ψ-operator in order to get a new version of local function. The concepts of maps, dense, resolvable and Housdorff have been investigated in this paper, as well as modified to be useful in general الخلاصة: استخدمنافيهذاالبحثالعمليةابسايمنأجلالحصولعلىنسخهجديدهمنالدالةالمحلية.وقدتمالتحقيقفيمفاهيمالدوال, الكثافة,المجموعاتالقابلةللحلوفضاءالهاوسدورف,وكذلكتعديلهالتكونمفيدةبشكلعام. Keywords:ψ-operator, dense, resolvable and Housdorff.
Title:Using ψ-Operator to Formulate a New Definition of Local Function
Author:Dr.Luay A.A.AL-Swidi, Dr.Asaad M.A.AL-Hosainy, Reyam Q.M.AL-Feehan
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: With development of the information technology, the scale of data is increasing quickly. The massive data poses a great challenge for data processing and classification. In order to classify the data, there were several algorithm proposed to efficiently cluster the data. One among that is the random forest algorithm, which is used for the feature subset selection. The feature selection involves identifying a subset of the most useful features that produces compatible results as the original entire set of features. It is achieved by classifying the given data. The efficiency is calculated based on the time required to find a subset of features, the effectiveness is related to the quality of the subset of features. The existing system deals with fast clustering based feature selection algorithm, which is proven to be powerful, but when the size of the dataset increases rapidly, the current algorithm is found to be less efficient as the clustering of datasets takes quiet more number of time. Hence the new method of implementation is proposed in this project to efficiently cluster the data and persist on the back-end database accordingly to reduce the time. It is achieved by scalable random forest algorithm. The Scalable random forest is implemented using Map Reduce Programming (An implementation of Big Data) to efficiently cluster the data. In works on two phases, the first step deals with the gathering the datasets and persisting on the datastore and the second step deals with the clustering and classification of data. This process is completely implemented using Google App Engine’s hadoop platform, which is a widely used open-source implementation of Google's distributed file system using MapReduce framework for scalable distributed computing or cloud computing. MapReduce programming model provides an efficient framework for processing large datasets in an extremely parallel mining. And it comes to being the most popular parallel model for data processing in cloud computing platform. However, designing the traditional machine learning algorithms with MapReduce programming framework is very necessary in dealing with massive datasets.Keywords: Data mining, Hadoop, Map Reduce, Clustering Tree.
Title: Big Data on Implementation of Many to Many Clustering
Author: Ravi. R, Michael. G
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: Distributed computing is a situated of IT administrations that are given to a client more than a system on a rented premise and with the capacity to scale up or down their administration necessities. Generally cloud registering administrations are conveyed by an outsider supplier who possesses the foundation. It favorable circumstances to specify yet a couple incorporate versatility, strength, adaptability, productivity and outsourcing non-center exercises. Distributed computing offers an imaginative plan of action for associations to receive IT benefits without forthright speculation. Notwithstanding the potential increases accomplished from the distributed computing, the associations are moderate in tolerating it because of security issues and difficulties connected with it. Security is one of the significant issues which hamper the development of cloud. The thought of giving over vital information to another organization is troubling; such that the shoppers should be cautious in comprehension the dangers of information breaks in this new environment. This paper presents a point by point examination of the distributed computing security issues furthermore, difficulties concentrating on the distributed computing sorts and the administration conveyance sorts.Keywords: Cloud Computing, Scalability, Infrastructure, IT.
Title: Cloud Computing Security Issues and Challenges
Author: Nishant Katiyar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: Traditional approaches for document classification need data which is labelled for the construction reliable classifiers which are even accurate. Unfortunately, data which is already labelled are rarely available, and often too costly to obtain. For the given learning task for which data which is trained is unavailable, abundant labelled data may be there for a different and related domain. One would like to use the related labelled data as auxiliary information to accomplish the classification task in the target domain. Recently, the paradigm of transfer learning has been introduced to enable effective learning strategies when auxiliary data obey a different probability distribution. A co-clustering based classification algorithm has been previously proposed to tackle cross-domain text classification. In this work, we extend the idea underlying this approach by making the latent semantic relationship between the two domains explicit. This goal is achieved with the use of Wikipedia. As a result, the pathway that allows propagating labels between the two domains not only captures common words, but also semantic concepts based on the content of documents. We empirically demonstrate the efficacy of our semantic-based approach to cross-domain classification using a variety of real data.Keywords: Classification, Clustering, Cross-domain Text Classification, Co-clustering, Labelled data, Traditional Approaches.
Title: Co-Clustering For Cross-Domain Text Classification
Author: Rayala Venkat, Mahanthi Kasaragadda
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: We extend some existing results on the zeros of polar derivatives of polynomials by considering more general coefficient conditions. As special cases the extended results yield much simpler expressions for the upper bounds of zeros than those of the existing results.
Mathematics Subject Classification: 30C10, 30C15.Keywords: Zeros of polynomial, Eneström - Kakeya theorem, Polar derivatives.
Title: On the Zeros of Polar Derivatives
Author: P. Ramulu, G.L. Reddy
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: This paper tackles, studying and introducing a new types of Kc – spaces that are called be βKc_i-spaces where (i = 1 , 2 , 3 ) . As well as discussion the important results which are arriving to during this studying.Keywords: βω-open, βω-closed, β-closed map, βω-compactβ Kc_i-spaces.
Title:Study Kc - Spaces Via ω-Open Sets
Author: Dr. Luay A.A.AL-Swidi, Salam. H. Ubeid
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: An edge dominating set D of a fuzzy graph G= (σ, µ) is a non-split edge dominating set if the induced fuzzy sub graph H= (<e-d>, σ¢, µ¢) is connected. The split edge domination number γ¢ns(G)or γ¢ns is the minimum fuzzy cardinality of a non-split edge dominating set. In this paper we study a non-split edge dominating set of fuzzy graphs and investigate the relationship of γ¢ns(G)with other known parameter of G. Keywords: Fuzzy graphs, fuzzy domination, fuzzy edge domination, fuzzy non split edge domination number.
Title: Non Split Edge Domination in Fuzzy Graphs
Author: C.Y. Ponnappan, S. Basheer Ahamed, P. Surulinathan
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Enhance The Technique For Searching Dimension Incomplete Databasespaperpublications3
Abstract: Data ambiguity is major problem in the information retrieval ambiguity is due to the loss in the data dimension it causes lot of problem in various real life application. Database may incomplete due to missing dimension and value. In previous work is totally based on the missing value. We focus on the problem is to find the missing dimension in our work. Missing dimension leads towards the problem in the traditional query approach. Missing dimension information create computational problem, so large number of possible combinations of missing dimensions need to be examined to check similarity between the query object and the data objects . Our aim is to reduce the all recovery version to increase the system performance as number of possible recovery data is reduces the time to estimate the true result is also reduces. Keywords: Missing Dimensions, Similarity search, Whole sequence query, Probability triangle inequality, Temporal data.
Title: Enhance The Technique For Searching Dimension Incomplete Databases
Author: Mr. Amol Patil, Prof. Saba Siraj, Miss. Ashwini Sagade
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: Smartphones have become very common. It has claims in all the fields such as private use, in government groups such as defence, military etc. It has become common because of occurrence of huge number of applications. Smartphones convey large amount of personal material, such as user’s private details, contacts, messages, emails, credit card information, etc. This delicate- materialpresent, needs security and privacy. The project suggests the idea of securing the Private information such as contacts, browsing history, cookies, credit card information etc, present on the user profile of a personalized search engine. Security is provided by locking and wiping the data of the phone from a remote server, in the event of phone getting lost or stolen. To achieve this, message authentication code technique is used. The authenticity and integrity of the message is proved by a short piece of information. Integrity governs accidental and intentional message changes and authenticity governs the message’s origin. It stops malicious users from launching denial of service attacks. A Secure Hash Algorithm is used to produce a hash value which Converts plaintext to encoded message and outputs a MAC. The MAC defends both message data integrity and its authenticity by permitting receivers who also possess the secret key to detect any changes to message content.Keywords: Clickthrough data, abstraction, location search, mobile search engine, ontology, user profiling.
Title: Private Mobile Search Engine Using RSVM Training
Author: Ms. Mayuri A. Auti, Dr. S. V. Gumaste
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Delay Constrained Energy Efficient Data Transmission over WSNpaperpublications3
Abstract: In wireless sensor network generally concentrate on minimization of energy Consumption, Also reducing energy saving and end to end delay. Reduced the end to end delay is one of the main challenges in the Wireless Sensor Networks. In TDMA providing reliable packet transmission and two transmission scheduling schemes are used to maximize the end-end reliability within a delay bound in packet transmission called dedicated scheduling and shared scheduling. In addition, they formulate solutions for implementing two algorithms into two basic routing algorithms, single-path routing and any-path routing algorithm. The proposed system presented energy efficient sleep scheduling algorithm for reducing the energy for delay constrained in WLAN. This algorithm to maximize the energy saving for packet delay constraints and it determines sleep period and wake up time to be minimized, the aim of this project is proposed to maximize the length of sleep time under packet deadline constraints using green call algorithm. Keywords: Delay-constrained applications, energy efficiency, Sleep scheduling, wireless sensor network.
Title: Delay Constrained Energy Efficient Data Transmission over WSN
Author: H. Hasina Begaum
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: This paper displays the main 6 information mining calculations distinguished by the IEEE Global Conference on Data Mining (ICDM: C4.5, k-Means, SVM, Apriori, EM, Page Rank. These main 6 calculations are among the most persuasive information mining calculations in the examination community. With each calculation, we give a depiction of the calculation, examine the effect of the calculation, and review current and further research on the calculation. These 6 calculations spread grouping, bunching, measurable learning, affiliation examination, and connection mining, which are all among the most vital subjects in information mining innovative work.Keywords: Data mining, K-Means, Apriori.
Title: An Algorithm Analysis on Data Mining
Author: Nida Rashid
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Abstract: Object Classification is an important task within the field of computer vision. Image classification refers to the labelling of images into one of a number of predefined categories. Classification includes image sensors, image pre-processing, object detection, object segmentation, feature extraction and object classification. Many classification techniques have been developed for image classification. In this survey various classification techniques are considered; Artificial Neural Network (ANN), Decision Tree (DT), Support Vector Machine (SVM) and Fuzzy Classification.Keywords: Image Classification, Artificial Neural Network, Decision Tree, Support Vector Machine, Fuzzy Classifier.
Title: Analysis of Classification Approaches
Author: Robin Kumar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Comparative Performance Analysis & Complexity of Different Sorting Algorithmpaperpublications3
Abstract: An Algorithm is mix of guidelines without further order in offered request to take care of the predetermined issue. Sorting considered as the crucial operation for masterminding the rundown of components in a specific request either in rising or diving request in view of their key quality. Sorting system like: Insertion, Bubble, and Selection all have the quadratic time multifaceted ideal models O (N2) that breaking point their utilization as per the amount of parts. The objective of this paper audited different type of sorting algorithm like Insertion Sort, Selection, Bubble, Merge sort their execution investigation as for their time complexity nature.Keywords: Sorting Algorithm, Bubble, Selection, Insertion, Merge Sort, Complexity.
Title: Comparative Performance Analysis & Complexity of Different Sorting Algorithm
Author: Shiv Shankar Maurya, Arti Rana, Ajay Vikram Singh
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
An Advanced IR System of Relational Keyword Search Techniquepaperpublications3
Abstract: Now these days keyword search to relational data set becomes an area of research within the data base and Information Retrieval. There is no standard process of information retrieval, which will clearly show the accurate result also it shows keyword search with ranking. Execution time is retrieving of data is more in existing system. We propose a system for increasing performance of relational keyword search systems. In the proposed system we combine schema-based and graph-based approaches and propose a Relational Keyword Search System to overcome the mentioned disadvantages of existing systems and manage the information and user access the information very efficiently. Keyword Search with the ranking requires very low execution time. Execution time of retrieving information and file length during Information retrieval can be display using chart.Keywords: Keyword Search, Datasets, Information Retrieval Query Workloads, Schema-based Systems, Graph-based Systems, ranking, relational databases.
Title: An Advanced IR System of Relational Keyword Search Technique
Author: Dhananjay A. Gholap, Gumaste S. V
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)paperpublications3
Abstract: This paper presents an evaluation of open source e-learning platforms with the aim of finding the most suitable platform for extending to an adaptive one. The extended platform will be utilized in an operational teaching environment. Therefore, the overall functionality of the platform is as important as the adaptation capabilities, and the evaluation treats both issues in this paper .in this paper we will explain the proper and best learning platform for Users . In this we will compare one of the best learning platforms (Moodle and Blackbox) both are all of them best virtual learning platform. We will compare both virtual system its functionality and using best tool. This paper is focused on the Moodle Architecture and comparative study of Moodle, thus we discusses comparisons it between different virtual learning platform at last conclusion we will describe which learning platform is best for users.Keywords: E-learning, Blackboard, Moodle, tools, function, methodology.
Title: A SURVEY AND COMPARETIVE ANALYSIS OF E-LEARNING PLATFORM (MOODLE AND BLACKBOARD)
Author: Kanak Sachan, Dr. Rajiv Singh
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELETpaperpublications3
Abstract: The Security is the most important aspect of Database, for maintain the integrity and as well as security of the system image watermarking is technique proposed at the year of 1996, in this paper we also implement image watermarking using 2-D biorthogonal Wavelt. The importance of transmitting digital information in digital watermarking system and the dissymmetric digital watermarking framework lived on media content communication is also being discussed in this paper. Then we apply watermarking embedding algorithm to keep the balance between watermarks’ imperceptibility and its robustness while the data is being sent on the communication channel.Keywords: Discrete Wavelet Transform (DWT), Gray Scale, Peak Signal to Noise Ratio (PSNR).
Title: Entropy based Digital Watermarking using 2-D Biorthogonal WAVELET
Author: Abhinav Kumar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Research on 4-dimensional Systems without Equilibria with ApplicationTELKOMNIKA JOURNAL
Recently chaos-based encryption has been obtained more and more attention. Chaotic systems
without equilibria may be suitable to be used to design pseudorandom number generators (PRNGs)
because there does not exist corresponding chaos criterion theorem on such systems. This paper
proposes two propositions on 4-dimensional systems without equilibria. Using one of the propositions
introduces a chaotic system without equilibria. Using this system and the generalized chaos
synchronization (GCS) theorem constructs an 8-dimensional discrete generalized chaos synchronization
(8DBDGCS) system. Using the 8DBDGCS system designs a 216-word chaotic PRNG. Simulation results
show that there are no significant correlations between the key stream and the perturbed key streams
generated via the 216-word chaotic PRNG. The key space of the chaotic PRNG is larger than 21275. As
an application, the chaotic PRNG is used with an avalanche-encryption scheme to encrypt an RGB image.
The results demonstrate that the chaotic PRNG is able to generate the avalanche effects which are similar
to those generated via ideal chaotic PRNGs.
The stochastic system is very importment in many aspacts. Wiener processes is a sort of importment
stochastic processes. Wiener square processes is a class of useful stochastic processes in practies,its study is very
value.In this paper,we study Wiener square processes using haar wavelet and wavelet transform.we study its some
properties and wavelet expansion. Index Wiener Integral processes is a class of useful stochastic processes in
practies,its study is very value.In this paper,we study it using haar wavelet and wavelet transform on [0,t].we study
its some properties and wavelet expansion
In this paper, an accurate numerical method is presented to find the numerical solution of the singularinitial value problems. The second-order singular initial value problem under consideration is transferredinto a first-order system of initial value problems, and then it can be solved by using the fifth-order RungeKutta method. The stability and convergence analysis is studied. The effectiveness of the proposed methodsis confirmed by solving three model examples, and the obtained approximate solutions are compared withthe existing methods in the literature. Thus, the fifth-order Runge-Kutta method is an accurate numericalmethod for solving the singular initial value problems.
ACCURATE NUMERICAL METHOD FOR SINGULAR INITIAL-VALUE PROBLEMSaciijournal
In this paper, an accurate numerical method is presented to find the numerical solution of the singular
initial value problems. The second-order singular initial value problem under consideration is transferred
into a first-order system of initial value problems, and then it can be solved by using the fifth-order Runge
Kutta method. The stability and convergence analysis is studied. The effectiveness of the proposed methods
is confirmed by solving three model examples, and the obtained approximate solutions are compared with
the existing methods in the literature. Thus, the fifth-order Runge-Kutta method is an accurate numerical
method for solving the singular initial value problems.
ACCURATE NUMERICAL METHOD FOR SINGULAR INITIAL-VALUE PROBLEMSaciijournal
In this paper, an accurate numerical method is presented to find the numerical solution of the singular initial value problems. The second-order singular initial value problem under consideration is transferred into a first-order system of initial value problems, and then it can be solved by using the fifth-order Runge Kutta method. The stability and convergence analysis is studied. The effectiveness of the proposed methods is confirmed by solving three model examples, and the obtained approximate solutions are compared with the existing methods in the literature. Thus, the fifth-order Runge-Kutta method is an accurate numerical method for solving the singular initial value problems.
Accurate Numerical Method for Singular Initial-Value Problemsaciijournal
In this paper, an accurate numerical method is presented to find the numerical solution of the singular initial value problems. The second-order singular initial value problem under consideration is transferred into a first-order system of initial value problems, and then it can be solved by using the fifth-order Runge Kutta method. The stability and convergence analysis is studied. The effectiveness of the proposed methods is confirmed by solving three model examples, and the obtained approximate solutions are compared with the existing methods in the literature. Thus, the fifth-order Runge-Kutta method is an accurate numerical method for solving the singular initial value problems.
Accurate Numerical Method for Singular Initial-Value Problemsaciijournal
In this paper, an accurate numerical method is presented to find the numerical solution of the singular
initial value problems. The second-order singular initial value problem under consideration is transferred
into a first-order system of initial value problems, and then it can be solved by using the fifth-order Runge
Kutta method. The stability and convergence analysis is studied. The effectiveness of the proposed methods
is confirmed by solving three model examples, and the obtained approximate solutions are compared with
the existing methods in the literature. Thus, the fifth-order Runge-Kutta method is an accurate numerical
method for solving the singular initial value problems.
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
International Journal of Mathematics and Statistics Invention (IJMSI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJMSI publishes research articles and reviews within the whole field Mathematics and Statistics, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Exponential State Observer Design for a Class of Uncertain Chaotic and Non-Ch...ijtsrd
In this paper, a class of uncertain chaotic and non-chaotic systems is firstly introduced and the state observation problem of such systems is explored. Based on the time-domain approach with integral and differential equalities, an exponential state observer for a class of uncertain nonlinear systems is established to guarantee the global exponential stability of the resulting error system. Besides, the guaranteed exponential convergence rate can be calculated correctly. Finally, numerical simulations are presented to exhibit the feasibility and effectiveness of the obtained results. Yeong-Jeu Sun "Exponential State Observer Design for a Class of Uncertain Chaotic and Non-Chaotic Systems" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-1 , December 2018, URL: http://www.ijtsrd.com/papers/ijtsrd20219.pdf
http://www.ijtsrd.com/engineering/electrical-engineering/20219/exponential-state-observer-design-for-a-class-of-uncertain-chaotic-and-non-chaotic-systems/yeong-jeu-sun
A Boundary Value Problem and Expansion Formula of I - Function and General Cl...IJERA Editor
In the present paper, we make a model of a boundary value problem and then obtain its solution involving
products of I -function and a general class of polynomials.
Similar to Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV) (20)
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
State of ICS and IoT Cyber Threat Landscape Report 2024 preview
Some Continued Mock Theta Functions from Ramanujan’s Lost Notebook (IV)
1. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 162
Paper Publications
Some Continued Mock Theta Functions from
Ramanujan’s Lost Notebook (IV)
MOHAMMADI BEGUM JEELANI SHAIKH
Assistant Professor, Faculty of Mathematics and Statistics, Al Imam Mohammed IBN Saud Islamic, University, Riyadh,
Kingdom Of Saudi Arabia
Abstract: Ramanujan’s lost notebook contains many results on mock theta functions. In particular, the lost
notebook contains eight identities for tenth order mock theta functions. Previously many authors proved the first
six of Ramanujan’s tenth order mock theta function identities. It is the purpose of this paper to prove the seventh
and eighth identities of Ramanujan’s tenth order mock theta function identities which are expressed by mock theta
functions and also a definite integral. The properties of modular forms are used for the proofs of theta function
identities and L. J. Mordell’s transformation formula for the definite integral.
Keywords: Mock Theta Functions from Ramanujan’s Lost Notebook.
Let us start from the famous quote on Ramanujan by one of the prominent mathematician:
I still say to myself when I am depressed and find myself forced to listen to pompous and tiresome people, ’Well I have
done one thing you could never have done, and that is to collaborated with Little wood and Ramanujan on something
like equal terms’.
G.H.HARDY
1. INTRODUCTION
In S. Ramanujan’s last letter to G. H. Hardy [BR], Ramanujan described a mock theta function, which is a function f(q)
defined by a q-series which converges for | q |< 1 and which satisfies the following two conditions:
(1) For every root of unity ζ, there is a theta function θζ (q) such that the difference f(q) − θζ (q) is bounded as q → ζ
radially.
(2) There is no single theta function which works for all ζ: i.e., for every theta function θ(q) there is some root of unity ζ
for which f(q) − θ(q) is unbounded as q → ζ radially.
He then provided a long list of ‘third order,’ ‘fifth order,’ and ‘seventh order’ mock theta functions together with identities
satisfied by them. Further identities can be found in Ramanujan’s lost notebook [RA]. In his lost notebook [RA, p. 9],
Ramanujan also gave a list of eight identities involving the following four Ramanujan’s tenth order mock theta functions:
φ(q) :=
( 1)/2
2
0 1( ; )
n n
n n
q
q q
, ψ(q) :=
( 1)( 2)/2
2
0 1( ; )
n n
n n
q
q q
X(q) :=
2
0 2
( 1)
( ; )
n n
n n
q
q q
, and χ(q) :=
2
( 1)
0 2 1
( 1)
( ; )
n n
n n
q
q q
2. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 163
Paper Publications
Where (a; q)n :=
1
0
(1 )
n
m
m
aq
The seventh and eighth identities of Ramanujan’s identities each expresses a combination of φ(q), ψ(q), and a definite
integral. The main purpose of this paper is to prove Ramanujan’s seventh and eighth identities. The first six of
Ramanujan’s identities were proved by the author [C1], [C2], [C3]. The seventh and eighth identities are
2
( )
5
0
1
2 1 5
cosh
45
nnx
e
n
e
dx e
x n
(1.1)
( ) ( )
5 5
5 5 5 1
2 2
n nn
e e
n
e e
n
And
(1.2)
2
( )
5
0
( ) ( )
5 5
1
2 1 5
cosh
45
5 5 5 1
2 2
n
n n
nx
e
n
n
e e
n
e
dx e
x n
e e
n
G. N. Watson [WG] also provided several third order mock theta function identities which include the definite integral.
Those identities are derived from the generalized Lambert series for the third order mock theta functions by using
Cauchy’s theorem.
We first need to define a few notations. Throughout the paper, summation indices run through all integers, or through all
integers satisfying the conditions listed under the summation sign.
Notation..
For a complex number q with | q |< 1 and | bc |< 1, set
0
( ; ) : (1 )m
m
a q aq
And
(1.3)
( 1) 2 ( 1)/2
( , ): j j j j
j
f b c b c
We can easily verify the following identity
(1.4)
2 2 2 2 2 2 2
( ; ) ( ; ) ( ; ) ( ; ) ( ; ) ( ; )a q a q a q q a q a q a q q
Note that
(1.5)
( 1) 2 ( 1)/2
( ; ) ( ; ) ( ; )j j j j
j
b c b bc c bc bc bc
Is called the Jacobi triple product identity and
(1.6)
2
( , ) ( ; )f q q q q
is called Euler’s pentagonal number theorem [B1, p. 36]. In [C1], the author derived the following results:
(1.7)
1 10 1 10 2 5
1 1( ) ( , ) ( , ) ( ) ( , ) 2 ( , , )q f z z q L q z a q f z z q qA zq q q
3. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 164
Paper Publications
And
(1.8)
1 10 1 10 4 2 5
2 2( ) ( , ) ( , ) ( ) ( , ) 2 ( , , )q f z z q L q z a q f z z q qA zq q q
Where
(1.9)
2
5 5 1
1 10 3
1
, 2 ,
1 z
n n n
n
n
n
q z
L q z
q
(1.10)
2
5 5 1 1
2 10 1
1
, 2 ,
1 z
n nn n
n
n
q z
L q z
q
(1.11)
2 2 2 2 1 1
1 1
( ; ) ( ; ) ( , )
A(z,x,q)=
( , ) ( , ) ( , )
q q q q f zx z x q
f q q f x x q f zq z q
(1.12)
5 5 10 10 2 8
1 4 4 6
( ; ) ( ; ) ( ; )
( ) ,
( ; ) ( ; )
q q q q q f q q
q
f q q f q q
And
(1.13)
5 5 10 10 2 8
2 4 4 6
4 2 3 4 6 3 7 9 2 8
2 8 3 7 2 4 6
9 2 8 2 3 7 4 6 5 5
( ; ) ( ; ) ( ; )
( ) ,
( ; ) ( ; )
( , ) ( , ) ( , ) ( , ) ( , ) ( , ).
( , ) ( , ) ( , )
( , ) ( , ) ( , ) ( , ) ( , ) / (
q q q q f q q
q
f q q f q q
f q q f q q f q q f q q qf q q f q q
f q q f q q f q q
f q q f q q f q q f q q f q q
10 10 3
5 5 10 10 2 8 5 5 2 10 10 2
4 4 6 5 5 2 2 8
3 7 9 2 8
10 4 5 3
2 8 3 7
9 2 2 8 4 6
2
, ) ,
( ; ) ( ; ) ( , ) ( ; ) ( ; )
2 ,
( , ) ( , ) ( , ) ( , )
( , ) ( , ) ( , )
, , , , ,
( , ) ( , )
( , ) ( , ) ( , )
(
q q
q q q q f q q q q q q
f q q f q q f q q f q q
f q q f q q f q q
q q q q q
f q q f q q
qf q q f q q f q q
f q
8 2 3 7 5 5 9 3 7 4 6 2
9 4 6
9 4 6 4 2 3
9 3 7 4 6 2 2 8 2 3 7 5 5
9 2 8
, ) ( , ) ( , ) ( , ) ( , ) ( , )
( , ) ( , )
( , ) ( , ) ( , ) ( , )
2 ( , ) ( , ) ( , ) ( , ) ( , ) ( , ).
( , ) ( , ) (
q f q q f q q f q q f q q f q q
f q q f q q
f q q f q q f q q f q q
f q q f q q f q q f q q f q q f q q
f q q f q q f q
3 7 4 6 2 5 5 10 10 3
, ) ( , ) ( , ) / ( , ) ,q f q q f q q q q
These two identities (1.7) and (1.8) show that two tenth order mock theta functions can be expressed in terms of
generalized Lambert series and theta functions. D. Hickerson [H1], [H2] derived similar results for fifth and seventh order
mock theta functions, and G. E. Andrews and Hickerson [AH] derived similar results for sixth order mock theta functions.
4. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 165
Paper Publications
The author [C2] also derived similar results for the other tenth order mock theta funcions X(q) and χ(q). We will prove
(1.1) and (1.2) with (1.7), (1.8), and the transformation formula for the definite integral [ML] which is provided by L. J.
Mordell. In [ML, p. 333], Mordell provided the following formula related to the definite integral:
(1.14)
2
2
2
( 2 2 )
2 2
11
[( ) / , 1/ ] ( , )
( , )
i t xt
i x
t i
e F x i F x
dt e
e e x
Where
i
q e
with I(w)>0 ,
(1.15)
2
1/4 (2 1)
2 1
( 1)
( , )
1
m m m m ix
m
m
q e
iF x
q
And
(1.16)
2
1/4 (2 1)
11( , ) ( 1)m m m m ix
m
i x q e
.
In Section 2, we prove nine theta function identities. Six of them are proved by using properties of modular forms. In
Section 3, using (1.14), we derive an identity which shows that the definite integral in (1.1) can be expressed by F(x, ω)
and 11 (x, ω). Then, applying the generalized Lambert series (1.9) and (1.10), and the two identities (1.7) and (1.8) to the
identity, we find that the definite integral in (1.1) is represented by φ(q), ψ(q), and theta functions. Simplifying the sum of
theta functions by using the identities in Section 2, we complete the proof of (1.1). In Section 4, we will also prove
Ramanujan’s eighth identity by methods similar to those in Section 3.
2. PROOFS OF THETA FUNCTION IDENTITIES
In this section, we will prove nine theta function identities. To prove first three identities, we need the next three
theorems.
Theorem 2.1. For 0 1q , 0, 0,x y
1 1 1 2 1 1
( , ) ( , ) ( ,( ) ) ( , )f x x q f y y q f xy xy q f x yq xy q
1 1 1 2
( ,( ) ) ( , )xf xyq xy q f x y xy q
Proof: See Theorem (1.1) in [H1:p:643]
Theorem 2.2. . For 0 1q , and a, b, c, and d are nonzero complex numbers, then
1 1
0 ( , ( ) ) ( , ) ( , ( ) ) ( , )
b a c d
af ab ab q f q f cd cd q f q
a b d c
1 1
( , ( ) ) ( , ) ( , ( ) ) ( , )
c b a d
bf bc bc q f q f ad ad q f q
b c d a
1 1
( , ( ) ) ( , ) ( , ( ) ) ( , ).
a c b d
cf ac ac q f q f bd bd q f q
c a d b
Proof. See Theorem (3.5) in [C1, p. 545].
Theorem 2.3. If ab = cd, then
5. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 166
Paper Publications
(i) f(a, b)f(c, d) + f(−a, −b)f(−c, −d)=2f(ac, bd)f(ad, bc)
And
(ii) f(a, b)f(c, d) − f(−a, −b)f(−c, −d)=2af(
b
c
,
c
b
abcd)f(
b
d
,
d
b
abcd).
Proof. See Entry 29 in [B1, p. 45].
Theorem 2.4. If 1q then,
5 5 10 10 4 6 5 5 2 10 10 2
2 3 2 8 5 5 2 4 6
( ; ) ( ; ) ( ; ) ( ; ) ( ; )
2
( ; ) ( ; ) ( ; ) ( ; )
q q q q f q q q q q q
q
f q q f q q f q q f q q
9 3 17 4 6
4 6 9
( ; ) ( ; ) ( ; )
( ; ) ( ; )
f q q f q q f q q
f q q f q q
Proof. Replacing q, x, and y by
5
q , -q, and
2
q , respectively, in Theorem 2.1, we
find that
(2.1)
4 2 3 3 7 4 6 9 2 8
( , ) ( , ) ( , ) ( , ) ( , ) ( , ).f q q f q q f q q f q q qf q q f q q
Replacing q, a, b, c, and d by
10
q ,
3
q ,
2
q ,
5
q , and q, respectively, in Theorem 2.2,
We find that
(2.2)
2 8 3 7 2 4 6
( , ) ( , ) ( , )f q q f q q f q q
9 4 6 2 5 5 9 2 8 2 3 7
( , ) ( , ) ( , ) ( , ) ( , ) ( , )f q q f q q f q q qf q q f q q f q q .
Multiplying both sides of (2.1) by
2 8
( , )f q q 3 7
( , )f q q , and using (2.2), we find that
(2.3)
2 8 3 7
( , ) ( , )f q q f q q 4 2 3
( , ) ( , )f q q f q q
9 4 6 2 5 5 9 2 8 2 3 7
( , ) ( , ) ( , ) 2 ( , ) ( , ) ( , )f q q f q q f q q qf q q f q q f q q .
Now, dividing both sides of (2.3) by
9 2 8 2 3 7 4 6 5 5 10 10 3
( , ) ( , ) ( , ) ( , ) ( , ) / ( , ) ,f q q f q q f q q f q q f q q q q
Using (1.4), and replacing q by -q, we complete the proof of theorem.
Theorem 2.5. If 1q then,
5 5 10 10 2 8 5 5 2 10 10 2
4 4 6 5 5 2 2 8
( ; ) ( ; ) ( , ) ( ; ) ( ; )
2 ,
( , ) ( , ) ( , ) ( , )
q q q q f q q q q q q
f q q f q q f q q f q q
3 7 9 2 8
2 8 3 7
( , ) ( , ) ( , )
( , ) ( , )
f q q f q q f q q
f q q f q q
.
6. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 167
Paper Publications
Proof. Replac ing q, x, and y by
5
q , q, and -
3
q , respectively, in Theorem 2.1, we find that
(2.4)
4 2 3 4 6 3 7 9 2 8
( , ) ( , ) ( , ) ( , ) ( , ) ( , ).f q q f q q f q q f q q qf q q f q q
Replacing q, a, b, c, and d by
10 4 5 3
, , , ,q q q q q , respectively , in Theorem 2.2
and dividing both sides of Theorem 2.2 by q, we find that
(2.5)
9 2 2 8 4 6
( , ) ( , ) ( , )qf q q f q q f q q
2 8 2 3 7 5 5 9 3 7 4 6 2
( , ) ( , ) ( , ) ( , ) ( , ) ( , )f q q f q q f q q f q q f q q f q q .
Multiplying both sides of (2.4 ) by
9 4 6
( , ) ( , )f q q f q q , and using (2.5), we find that
(2.6)
9 4 6 4 2 3
9 3 7 4 6 2 2 8 2 3 7 5 5
( , ) ( , ) ( , ) ( , )
2 ( , ) ( , ) ( , ) ( , ) ( , ) ( , )
f q q f q q f q q f q q
f q q f q q f q q f q q f q q f q q
Now, dividing both sides of (2.6) by
9 2 8 3 7 4 6 2 5 5 10 10 3
( , ) ( , ) ( , ) ( , ) ( , ) / ( , ) ,f q q f q q f q q f q q f q q q q
Using (1.4) , and replacing q by -q, we complete the proof of theorem.
Theorem 2.6 . If 1q then
15 35 25 25 3 5 45 25 25
( , ) ( , ) ( , ) ( , )f q q f q q q f q q f q q
25 25 15 35 4 5 45 15 35
( , ) ( , ) ( , ) ( , )f q q f q q q f q q f q q
3 25 25 5 45 4 15 35 5 45
( , ) ( , ) ( , ) ( , )q f q q f q q q f q q f q q
(2.7)
4 16 8 12
2 ( , ) ( , ).f q q f q q
Proof. Let ab = cd = q50 in Theorem 2.3. Replacing a and c by
15
q and
25
q
respectively, in Theorem 2.3 (i), we find that
(2.8)
15 35 25 25
( , ) ( , )f q q f q q 25 25 15 35
( , ) ( , )f q q f q q 40 60 2
2 ( , ) .f q q
Replacing a and c by
5
q and
25
q , respectively, in Theorem 2.3 (ii), we find that
5 45 25 25 25 25 5 45 5 20 80 2
( , ) ( , ) ( , ) ( , ) 2 ( , ) .f q q f q q f q q f q q q f q q
Replacing a and c by -
5
q and
15
q respectively, in Theorem 2.3 (i), we find that
(2.10)
5 45 15 35 15 35 5 45 20 80 40 60
( , ) ( , ) ( , ) ( , ) 2 ( , ) ( , ) .f q q f q q f q q f q q f q q f q q
Thus, by (2.8), (2.9), and (2.10), the left side of (2.7) equals
40 60 2 8 20 80 2 4 20 80 40 60
2 ( , ) 2 ( , ) 2 ( , ) ( , )f q q q f q q q f q q f q q .
Now, in [B2, p. 191], we find that, for 1x ,
f(xA;,x/A)f(xB, x/B)=
5 2 5 2 1 5 1 2 5 2
( , ) ( , )f x A B x A B f x A B x A B
7. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 168
Paper Publications
(2.11)
7 2 3 2 1 9 1 2 2
1 7 2 7 2 1 1 2 2
9 2 2 1 3 1 2 7 2
1 2 9 2 1 7 1 2 3 2
( , ) ( , )
( , ) ( , )
( , ) ( , )
( , ) ( , )
xBf x A B x A B f x A B x A B
xB f x A B x A B f x A B x A B
xAf x A B x A B f x A B x A B
xA f x A B x A B f x A B x A B
Multiplying both sides of (2.11) by 2, and replacing x, A, and B by
10 6
,q q and 2
q
Respectively, in (2.11), we find that
4 16 8 12
40 60 2 8 20 80 2 4 20 80 40 60
2 ( , ) ( , )
2 ( , ) 2 ( , ) 2 ( , ) ( , )
f q q f q q
f q q q f q q q f q q f q q
Thus, we have completed the proof of this theorem.
We will prove six eta-function identities by using the properties of modular forms.
Defnition of the Dedekind eta-function.
Let H = {z : Im z > 0}. For z H ,
2 iz
q = e and any positive integer n, define
inz
2 imnz 212 24 24
1
(2.12) (nz) := n = e (1 e ) ( , ) ( , ).
n n
n n n n
m
q q q q f q q
Definition of the generalized Dedekind eta-function.
Let H = {z : Im z > 0}. For z H
,
2 iz
q = e and any positive integer n and m,define
2
2 ikz 2 ikz
, ,
1 1
(mod ) (mod )
(z) := (1 e ) (1 e )
m
iP nz
n
n m n m
k k
k m n k m n
e
(2.13)
2
2 ( , )
( ; )
m n m n mP
n
n n
f q q
q
q q
.
In this paper, we only consider the cases with m 0(mod )n for ,n m
Definition of the modular group. The modular group is the set of linear fractional transformations , ,
az b
T T z
cz d
where a, b, c, and d are rational integers such that ad – cd = 1. The modular group is denoted by T(1). Let 1( )T N , where
N is a positive integer, be the set of linear factional transformations ,
az b
U U z
cz d
where a, b, c, and d are rational
integers such that ad – bc = 1, c 0 (mod N), and a d 1 (mod N).
Clearly 1( )T N is a subgroup of T(1).
Definition of a fundamental region. Let T be a subgroup of T(1). A fundamental region for T is an open subset R of H
such that (a) for any two distinct points 1 2,z z in R, there is no T T such that 3T z z for some T T .
Definition of a standard fundamental region. Let T be a subgroup of T (1) with cosets 1 2, ,....,A A A in the sense that
T(1) 1 1.iU TA
Then
8. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 169
Paper Publications
1
1
.
i
R U A
(a fundamental region for T(1))
is called a standard fundamental region for T.
Definition of a cusp. Let R be a fundamental region of T. A parabolic cusp of T in R is any real point q, or q= , such
that q R
, the closure of R in the topology of the Riemann sphere.
Definition of a modular form of weight, r. Let r be a real number. A function F(z), defined and meromorphic in H, is
said to be a modular form of weight r with respect to, T, with multiplier system v, if
(a) F z satisfied r
F Mz v M cz d F z for any z H and M T ,
(b) there exists a standard fundamental region R such that F z has at most finitely many poles in
_
R H and
(c) F z is meromorphic at ,jq for each cusp ,jq in
_
R .
The multiplier system v v M for the group T is a complex-valued function of absolute value 1 satisfying the
equation.
1 2 3 3 1 2 1 2 1 2 2
r r r
z z zv M M c d v M v M c M d c d
For 1 2,M M T, where
3 31 1 2 2
1 2 3 1 2
1 1 2 2 3 3
,
z z z
a z ba z b a z b
M z M z and M z M M z
c d c d c d
Let {T, r,v} denote the space of modular forms of weight r and multiplier system v on T, where T is a subgroup of T(1) of
finite index.
Let or d (f;z) denote the invariant order of a modular form f at z. Let ;TOrd f z denote the order of f with respect to T,
defined by
1
; : ; ,TOrd f z ord f z
e
where l is the order of f at z as a fixed point of T.
Theorem 2.7. The Dedekind eta-function n z is a modular form of weight ½ on the full modular group T(1).
Proof. See Theorem 10 in [KM, p.43].
Theorem 2.8. The multiplier system nv of the modular from is given by the following formula : for each
1
a b
M T
c d
,
2
2
2
1 3
24
1 3 1
24
1 3 1
24
, ,
, 0 0,
, , 0, 0,
bd c c a d c
ac d d b c d
n
ac d d b c d
d
if c is odd
c
c
v M if d is odd andeitherc or d
d
c
if d is odd c d
d
( )n z
9. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 170
Paper Publications
where 24 is a primitive 24th
root of unity.
Proof. See Theorem 2 in [KM, p. 51].
Theorem 2.9 (The valence formula). , , 0,If f T r v and f then
;T
z R
Ord f z r
,
Where R is an fundamental region for T, and
1
: 1 :
12
T T
Proof. See Theorem 4.1.4 in [RR].
Lemma 2.10. If 1 2 2..... nmm m are positive integers, n is a positive integer, N is a positive even integer, and the least
common multiple of 1 2 2..... nmm m divides N, then for z H 1 2 2 1.... , ,nn m z n m z n m z T N n v where
1 24,
a b
A T N
c d
is a primitive 24th
root of unity, and
22
1 / / 3 1
24
1
/ i i i
n
ac d m d m b c m di
i
c m
v A
d
Proof. See Lemma 2.2.4 in [C3].
Lemma 2.11. For a positive integer n, 2
1 2
/
1
(1): 1 ,
p n
T T n n
p
where the product is over all primes p
dividing n.
Proof. See Lemma 2.6.5 in [C2].
Theorem 2.12. For ,z H let ,
,
/
0
: ,n mr
n m
n N
m n
f z n z
where ,n m
r are integers.
If 2 ,
/
0
0n m
n N
m n
m
nP r
n
(mod 2) and 2 ,
/
0
0 0n m
n N
m n
N
P r
n
(mod 2), then 1 ,0f z T N I , where for
1 , 1
a b
M T N I M
c d
.
Proof. See Theorem 3 in [RS, p. 126].
Theorem 2.13. For z H ,
18 4
50 10,2 10,3 20,4 100,50n n n n n
2
50,5 50,10 50,15 50,25 100,40 50,5 50,10 50,15 50,20 50,25 100,40
2 2 2
50,15 50,20 50,25 100,20 50,5 50,15 50,20 50,25 100,40
2 2 2 2
50,5 50,20 50,25 100,30 100,40 50,5 50,15 50,20 100,40 100,5
(
2
2
x n n n n n n n n n n n
n n n n n n n n n
n n n n n n n n n n
0 )
10. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 171
Paper Publications
(2.14) =
2 16 2 4 2 2 9
10 100 10,1 10,2 20,8 50,10 50,15 50,20 50,25 100,50n n n n n n n n n n
Proof. For 1 < i < 7, let
1
if is the product of 18 eta-functions in each of the 7 products in (2.14), and
1
ig be the product
of the generalized eta-functions in each of the 7 products in (2.14). Each
1
if is the product of 18 eta-functions, and by
Theorem 2.10 and a straightforward calculation, each
1
if is a modular form of weight 9 on 1(300)T with the multiplier
system 1v where for 22
1 / / 3 1
24
1
/ i i i
n
ac d m d m b c m di
i
c m
v A
d
. By Theorem 2.12 and a straightforward
calculation, each
1
ig is a modular form of weight 0 on 1(300)T with the multiplier system I. Therefore, each
1 1
i if g is a
modular form of weight 9 on 1(300)T with multiplier 1v . By Theorem 2.11, 1(1): 300 57600T T Let 1F
denote the difference of the left and right sides of (2.14). Applying Theorem 2.9 (the valence formula), for a fundamental
region R for 1(300)T , we deduce that, for 1F ,
(2.15) 1 1 1300
9.57600
; 43200 ; ,
12T
z R
Ord F z ord F
Since both sides of (2.14) are analytic on R. Using Mathematica, we calculated the Taylor series of 1F is a constant, we
have a contradiction to (2.15). We have thus completed the proof of Theorem 2.13.
Theorem 2.14. For z H
18 16
50 10,1 10,2 20,6 20,8 100,50
2
50,5 50,10 50,15 50,20 50,25 100,50 50,5 50,15 50,20 50,25 100,20
2 2 2
50,5 50,10 50,25 100,20 50,5 50,10 50,15 50,25 100,20
2 2
50,10 50 15,25 100,10 100,20
(
2
2
n n n n n n
x n n n n n n n n n n n
n n n n n n n n n
n n n n n n
2 2
50,5 50,10 50,15 100,20 100,50 )n n n n
(2.16) =
2 16 16 2 2 9
10 100 10,2 10,3 20,4 50,5 50,10 50,20 50,25 100,50n n n n n n n n n n
Proof. For 1 1 < i < 7, let
2
if be the product of eta-functions in each of the 7 products in (2.16), and
2
ig be the product
of the generated eta-functions in each of the 7 products in (2.16). Each
2
if is the product of 18 eta-functions, and by
Theorem 2.10 and a straightforward calculation, each
2
if is a modular form of weight 9 on 1(300)T with the multiplier
system 2v where for
21
12 3 1
24
1 2 24300
c a ad d bd da b
A T v A
c d
.
By Theorem 2.12 and a straight forward calculation, each
2
ig is a modular from of weight 0 on 1(300)T with the
multiplier system I. Therefore, each
2 2
i if g is a modular form of weight 9 on 1(300)T with multiplier system 2v . Let
2F denote the difference of the left and right sides of (2.16). Applying Theorem 2.9, for a fundamental region R for
1(300)T , we deduce that, for 2F ,
(2.17) 1 2 2300
9.57600
; 43200 ; ,
12T
z R
Ord F z ord F
11. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 172
Paper Publications
Since both sides of (2.16) are analytic on R. Using Mathematica, we calculated the Taylor series of 2F about q=0 (or
about the cusp z= ) and found that 2F =0 43201
2 0F q . Unless 2F is a constant, we have a contradiction to (2.6).
We have therefore completed the proof of Theorem 2.14.
Theorem 2.15. For z H ,
(2.18)
2 2 10 3
5 100 5 ,1 6,1n n n n
3 3 2 2 2
50,5 50,10 100,40 100,50 50,15 50,20 100,20 100,50 50,10 50,20 100,25
2 2 10 3 2 2 2 2
20 25 5,1 6,1 25,5 25,5 50,10 50,20
( 3x n n n n n n n n n n n
n n n n n n n n
Proof. For 1 4,i let
3
if be the product of eta-functions in each of the 4 products in (2.18), and
3
ig be the product of
the generalized eta-functions in each of the 4 products in (2.18). Each
3
ig is the product of 14 eta-functions, and by
Theorem 2.10 and a straightforward calculation, each
3
ig is a modular form of weight 2 on 1(300)T with the multiplier
system 3v , where for
21
18 3 1
50
1 3 24300
c a ad d bd da b
A T v A
c d
.
By Theorem 2.12 and a straightforward calculation, each
3
ig is a modular form of weight 0 on 1(300)T with the
multiplier system I. Therefore, each
3 3
i if g is a modular from of weight 2 on 1(300)T with multiplier system 3v . Let
3F denote the difference of the left and rights sides of (2.18). Applying Theorem 2.9, for a fundamental region R for
1(300)T , we deduce that, for 3F ,
(2.19) 1 3 3300
2.57600
; 9600 ; ,
12T
z R
Ord F z ord F
Since both sides of (2.18) are analytic on R. Using Mathematica, we calculated the Taylor series of 3F about q = 0 ( or
about the cusp z = ) and found that 9601
3 0F q . Unless 3F is a constant, we have a contradiction to (2.19). We
have thus completed the proof of Theorem 2.15.
Theorem 2.16. For z H ,
(2.20)
2 2 2 3
4 50 10,1 10,2 10,3 20,2
50,5 50,15 50,25 100,50 50,5 50,15 50,25 100,30 50,5 50,15 50,25 100,10
2 2 2 2
50,5 50,15 100,50 50,5 50,25 100,30 50,5 50,25 100,30 50,15 50,25 100,10
2 2
10 20 10
(
2 )
n n n n n n
x n n n n n n n n n n n n
n n n n n n n n n n n n
n n n
3 3 3 3
,1 10,2 20,4 20,8 50,5 50,10 50,25n n n n n n
Proof. For 1 8,i let
4
if be the product of eta-functions in each of the 8 products in (2.20), and
4
ig be the product of
the generalized eta-functions in each of the 8 products in (2.20). Each
4
if is the product of 4 eta-functions, and by
12. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 173
Paper Publications
Theorem 2.10 and a straightforward calculation, each
4
if is a modular form of weight 2 on 1(300)T with the multiplier
system 4v , where for
23
12 3 1
50
1 4 24300
c a ad d bd da b
A T v A
c d
.
By Theorem 2.12 and a straightforward calculation, each
4
ig is a modular form of weight 0 on 1(300)T with the
multiplier system I. Therefore, each
4 4
i if g is a modular from of weight 2 on 1(300)T with multiplier system 4v . Let
4F denote the difference of the left and rights sides of (2.20). Applying Theorem 2.9, for a fundamental region R for
1(300)T , we deduce that, for 4F ,
(2.21) 1 4 4300
2.57600
; 9600 ; ,
12T
z R
Ord F z ord F
Since both sides of (2.20) are analytic on R. Using Mathematica, we calculated the Taylor series of 4F about q = 0 ( or
about the cusp z = ) and found that 9601
4 0F q . Unless 4F is a constant, we have a contradiction to (2.21). We
have thus completed the proof of Theorem 2.16.
Theorem 2.17. For z H ,
(2.22)
8 3 2
10 20 50,1 10,4 20,4 20,8 50,5 50,15 50,25 200,50 200,100
10,1 20,10 50,10 100,40 10,3 20,2 50,10 100,40
10,1 20,10 50,20 100,20 10,3 20,2 50,20 100,20
2
10,1 10,4 20,4 20,8 40,10 50,5 50
( 4
6 )
4
n n n n n n n n n n n
x n n n n n n n n
n n n n n n n n
n n n n n n n
,10 50,15 50,20 50,25 200,100
8 3 2 2 10 3
10 20 50 100 10,1 50,10 50,20 10 20 100 10,3 20,2 20,10
8 3
10 20 50 50,5 50,10 50,15 50,20 100,50 200,50 200,100
3 2
10,1 20,6 20,8 20,10 10,1 10,3 10,4 20,2
)
( 4
n n n n
n n n n n n n n n n n n n
n n n n n n n n n n
n n n n n n n n n
2 3 2
20,5 20,8 10,3 20,2 20,4 20,10
8 3
10 20 50 50,5 50,10 50,20 50,25 100,30 200,50 200,100
3 2 2 3 2
10,1 20,6 20,8 20,10 10,1 10,3 10,4 20,2 20,5 20,8 10,3 20,2 20,4 20,10
8 3
10 20 50 50,10 50,1
)
(2 2 3 )
n n n n n
n n n n n n n n n n
n n n n n n n n n n n n n n
n n n n n
5 50,20 50,25 100,10 200,50 200,100
3 2 2 3 2
10,1 20,6 20,8 20,10 10,1 10,3 10,4 20,2 20,5 20,8 10,3 20,2 20,4 20,10(3 2 2 )
n n n n n
n n n n n n n n n n n n n n
Proof. For 1 15,i let
5
if be the product of eta-functions in each of the 15 products in (2.22), and
5
ig be the product
of the generalized eta-functions in each of the 15 products in (2.22). Each
5
if is the product of 12 eta-functions, and by
Theorem 2.10 and a straightforward calculation, each
5
if is a modular form of weight 6 on 1(200)T with the multiplier
system 5v , where for
21
22 3 1
100
1 5 24
10
200
c a ad d bd da b
A T v A
c d d
.
13. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 174
Paper Publications
By Theorem 2.12 and a straightforward calculation, each
5
ig is a modular form of weight 0 on 1(200)T with the
multiplier system I. Therefore, each
5 5
i if g is a modular from of weight 6 on 1(200)T with multiplier system 5v . By
Theorem 2.11, 1(1): 200 28800T T Let 5F denote the difference of the left and rights sides of (2.22). Applying
Theorem 2.9, for a fundamental region R for 1(200)T , we deduce that, for 5F ,
(2.23) 1 5 5200
6.28800
; 14400 ; ,
12T
z R
Ord F z ord F
Since both sides of (2.22) are analytic on R. Using Mathematica, we calculated the Taylor series of 5F about q = 0 ( or
about the cusp z = ) and found that 14401
5 0F q . Unless 5F is a constant, we have a contradiction to (2.23). We
have thus completed the proof of Theorem 2.17.
Theorem 2.18. For z H ,
(2.24)
8 3 3 2 2
10 20 50 10,1 20,4 20,6 20,8 50,15 50,25 200,50 200,100
10,1 20,10 50,10 100,40 10,1 20,10 50,20 100,20 10,3 20,2 50,20 100,20
10 2 2 2 3
10 20 50 100 10,1 10,3 20,2 20,4 20,6 20,8 20,8 40,10
( 2 )
4
n n n n n n n n n n n
n n n n n n n n n n n n
n n n n n n n n n n n n
50,5 50,10 50,15 50,20
2
100,25 200,100
8 3 3
10 20 50 50,10 50,20 200,50 200,100
3 2 3 2
10,1 20,6 20,8 20,10 50,5 50,15 100,50 10,3 20,2 20,4 20,10 50,5 50,15 50,100
3 2
10,3 20,2 20,4 20,10 50,5 50,25
(
n n n n
n n
n n n n n n n
n n n n n n n n n n n n n n
n n n n n n
3 2
100,30 10,1 20,6 20,8 20,10 50,15 50,25 100,10
10,1 10,3 20,2 20,5 20,6 20,8 50,15 50,25 100,102 )
n n n n n n n n
n n n n n n n n n
Proof. For 1 10,i let
6
if be the product of eta-functions in each of the 10 products in (2.24), and
6
ig be the product
of the generalized eta-functions in each of the 10 products in (2.24). Each
6
if is the product of 14 eta-functions, and by
Theorem 2.10 and a straightforward calculation, each
6
if is a modular form of weight 7 on 1(200)T with the multiplier
system 6v , where for
21
2 3 1
20
1 6 24
10
200
c a ad d bd da b
A T v A
c d d
.
By Theorem 2.12 and a straightforward calculation, each
6
ig is a modular form of weight 0 on 1(200)T with the
multiplier system I. Therefore, each
6 6
i if g is a modular from of weight 7 on 1(200)T with multiplier system 6v . Let
6F denote the difference of the left and rights sides of (2.24). Applying Theorem 2.9, for a fundamental region R for
1(200)T , we deduce that, for 5F ,
(2.25) 1 6 6200
7.28800
; 16800 ; ,
12T
z R
Ord F z ord F
14. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 175
Paper Publications
Since both sides of (2.24) are analytic on R. Using Mathematica, we calculated the Taylor series of 6F about q = 0 ( or
about the cusp z = ) and found that 16801
6 0F q . Unless 6F is a constant, we have a contradiction to (2.25). We
have thus completed the proof of Theorem 2.18.
We have proved six eta-function identities with the properties of modular forms. In the next step, we will derive six theta
function identities from the eta-function identities above.
Theorem 2.19. For 1,q
(2.26)
5 45 40 60 50 50
6 10 40 4 20 30
220 30
50 50
3 15 35 20 80 2 5 45 40 60
10 40
25 45 40 60 50 50 100 100
2
15 35 10 90 20
, , ,
, ,
,
,
, , 2 , ,
,
, , ; ;
2
, ,
q q f q q f q q
q f q q q f q q
f q q
f q q
q f q q f q q q f q q f q q
f q q
f q q f q q q q q q
q
f q q f q q f q
80
2 35 45 40 60 50 50
25 25 10 90 20 80 30 70
29 8 12 10 10 20 20
3 7 2 18 4 16
,
, , ;
, , , ,
, , ; ;
, , ,
q
f q q f q q q q
f q q f q q f q q f q q
f q q f q q q q q q
f q q f q q f q q
Proof. By applying
2 2
100,50 100 50n n n to the right side of (2.14), dividing both sides of (2.14) by
451
18 4 2 230
50 10,2 10,3 20,2 20,4 50,10 50,15 50,20 50,25 100/q n n n n n n n n n n and applying (2.12) and (2.13) , we derive (2.26) from (2.14)
Theorem 2.20. For 1,q
(2.27)
15 35 20 80 50 50
2 10 40 4 20 30
240 40
50 50
3 5 45 40 60 4 15 35 20 80
20 30
215 35 20 80 50 50 100 100
5
5 45 30 70 4
, , ,
, ,
,
,
, , 2 , ,
,
, , ; ;
2
, ,
q q f q q f q q
q f q q q f q q
f q q
f q q
q f q q f q q q f q q f q q
f q q
f q q f q q q q q q
q
f q q f q q f q
0 60
2 315 35 20 80 50 50
25 25 10 90 30 70 40 60
23 7 4 16 10 10 20 20
9 6 14 8 12
,
, , ;
, , , ,
, , ; ;
, , ,
q
f q q f q q q q
q
f q q f q q f q q f q q
f q q f q q q q q q
f q q f q q f q q
15. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 176
Paper Publications
Proof. By applying
2 2
100,50 100 100n n n to the right side of (2.16), dividing both sides of (2.16) by
589
18 16 2 230
50 10,1 10,2 20,6 20,8 50,5 50,10 50,20 50,25 100/q n n n n n n n n n n and applying (2.12) and (2.13) , we derive (2.27) from (2.16)
Theorem 2.21. For IF 1,q
(2.28)
5 45 10 40 40 60 50 50
5
220 30
15 35 20 30 20 80 50 50
210 40
25 15
, , , ,
,
, , , ,
,
,
f q q f q q f q q f q q
q
q q
f q q f q q f q q f q q
f q q
q q
Proof. By applying 25,5 25,10 25 5n n n n to the right side of (2.18), in Theorem 2.15, dividing both sides of (2.18) by
25
2 10 3 2 24
5 5,1 6,1 50,10 50,20q n n n n n and applying (2.12) and (2.13) , we derive (2.28) from (2.18)
Theorem 2.23. For IF 1,q
(2.29)
25 25 25 25 2 15 35 15 35 8 5 45 5 45
4 25 25 5 45 15 35 25 25
5 15 35 5 45 5 5 45 15 35
9 4 4 10 10
3 7 2 18
, , , , , ,
, , , ,
2 , , , ,
, , ;
, ,
f q q f q q q f q q f q q q f q q f q q
q f q q f q q f q q f q q
q f q q f q q q f q q f q q
f q q q q q q
f q q f q q
Proof. We can easily derive that for any integers n,
(2.30)
250 50 2 100 2
50
100 100 50
, ,
,
, ,
n n
n n
n n
q q f q q
f q q
q q f q q
Now, applying 20 20,4 20 8 4n n n n n to the right side of (2.20), dividing both sides of (2.20) by
329
2 2 330
4 10,1 10,2 10,3 20,2 50,5 50,15 50,25q n n n n n n n n and applying (2.12) and (2.13) , and (2.30) with n replaced by 5, 15 and 25,
repeatedly, we complete the Proof.
Theorem 2.23. IF 1,q
(2.31)
16. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 177
Paper Publications
29 4 4 10 10
20 20 4 4 16 8 12
3 7 2 18
29 4 4 10 10
2 10 40 4 16 8 12
3 7 2 18
29 4 4 10 10
6 50 150
3 7
, , ;
, 4 , ,
, ,
, , ;
, 6 , ,
, ,
, , ;
4 ,
,
f q q q q q q
f q q q f q q f q q
f q q f q q
f q q q q q q
q f q q q f q q f q q
f q q f q q
f q q q q q q
q f q q
f q q f
4 16 8 12
2 18
29 8 12 10 10 20 20
25 25
3 7 2 18 4 16
23 7 4 16 10 10 20 20
25 15
9 6 14 8 12
15
, ,
,
, , , ;
,
, , ,
, , ; ;
4 ,
, , ,
,
qf q q f q q
q q
f q q f q q q q q q
f q q
f q q f q q f q q
f q q f q q q q q q
qf q q q
f q q f q q f q q
qf q
29 8 12 10 10 20 20
35
3 7 2 18 4 16
23 7 4 16 10 10 20 20
25 15
9 6 14 8 12
29 8 12 10 10 20 20
4 25 25
, , , ;
2
, , ,
, , ; ;
2 , 3
, , ,
, , , ;
, 3
f q q f q q q q q q
q
f q q f q q f q q
f q q f q q q q q q
qf q q q
f q q f q q f q q
f q q f q q q q q q
q f q q
f q
3 7 2 18 4 16
23 7 4 16 10 10 20 20
25 15
9 6 14 8 12
, , ,
, , ; ;
2 , 2
, , ,
q f q q f q q
f q q f q q q q q q
qf q q q
f q q f q q f q q
Proof. applying
2 2
20 20 10 10, 20 20,4 20,8 4n n n n n n n n and 50 50,10 50,20 10n n n n to (2.22), dividing both sides of (2.22)
by
233
86
10 20 10,1 10,3 20,2 20,4 20,6 20,8 50,5 50,10 50,15 50,20 50,25 200,50 200,100q n n n n n n n n n n n n n n n and applying (2.12) and (2.13) , and
(2.30) with n replaced by 5, 10, 15, 20 and 25, repeatedly, and with q and n replaced by
4
q and
50
q , respectively, we
derive (2.32) from (2.20)
Theorem 2.24
(2.32)
( )
( )( ) ( )
( ) ( )
( ) (
( )( ) ( )
( ) ( )
( ) ( ))
+4 ( ) ( ) ( )
( ) (
( ) ( )( ) ( )
( ) ( ) ( )
( ) ( )( ) ( )
( ) ( ) ( )
)
( ) ( ( )
( ) ( )( ) ( )
( ) ( ) ( )
)
17. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 178
Paper Publications
( ) (
( ) ( )( ) ( )
( ) ( ) ( )
( ) )
Proof. Applying
, and to (2.24),
Dividing both sides of (2.24) by ,
and applying (2.12), (2.13), and (2.30) with n replaced by 5, 10, 15, 20 and 25, repeatedly, and with q and n replaced by q4
and q50
, respectively, we derive (2.32) from (2.24).
3. PROOF OF RAMANUJAN’S SEVENTH IDENTITY
In this section we will prove Ramanujan’s seventh identity, (1.1).
Theorem 3.1 (Ramanujan’s seventh tenth order mock theta function identity).
∫
√
√ √
( )
√ √
( )
√
√
( )
Proof. Replacing , x, t, and θ by 5in, –5n,
√
, and θ’ – i, respectively, in the left side of (1.14), we find that
(3.1) ∫ √
∫
√
Replacing by in (3.1), and using (1.14), we have
(3.2) ∫
√
√
( ) ( )
( )
,
and Replacing by in (3.1), and using (1.14), we have
(3.3) ∫
√
√
( ) ( )
( )
Using (3.2) and (3.3), we can easily derive that
∫
√
√
∫
√
√
∫ (
√ √
)
( ∫
√
∫
√
)
√ √
√
(
( ) ( )
( )
( ) ( )
( )
)
(3.4) Let . Then, using (1.15), (1.16), (1.3), (1.10) with q and z replaced by – q and q4
, respectively, (1.8),
(1.11) with q, z, and x replaced by –q5
, 1 and q2
, respectively, (1.13) with q replaced by – q, and Theorem 2.4, we can
derive that
18. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 179
Paper Publications
√ √
(
( )
( )
( )
( )
)
√ √
(
∑
( )
( )
∑
( )
( )
)
√ √ ( )
( )
√ √
( ( )
( ) ( ) ( )
( ) ( )
( ) ( )
( ) ( )
)
(3.5) √ √
( ) √ √ ( ) ( ) ( )
( ) ( )
We now need to use the following transformation formula for in [ML, p. 330]:
(3.6) ( ) √ ( )
Replacing and by and , respectively, in (3.6), we find that
(3.7) ( ) √ ( )
and replacing and by and , respectively, in (3.6), we find that
(3.8) ( ) √ ( )
Let and Then, using (3.7), (3.8), (1.15), and (1.16), we find that
(3.9)
√
(
( )
( )
( )
( )
)
( )
( )
( )
( )
∑
( ) ( )
∑ ( )
By (1.3), we easily reformulate the denominator of the right hand side of (3.9):
(3.10)
∑( ) ∑ ∑( )
( ) ( ) ( ) ( )
Now, multiplying by both the numerator and the denominator of the numerator of
the right side of (3.9), we find that the numerator of the right side of (3.9) equals
(3.11)
∑
( )
* ( ) +
∑ ∑
( )
( ) ( )
19. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 180
Paper Publications
* ( ) +.
We will transform some of the generalized Lambert series in (3.11) into L1 and L2, and we need the following
hypergeometric series from [GR, p. 128] to handle the other generalized Lambert series in (3.11):
∑
( ) ( ) ( ) ( ) ( ) ( )
( ) ( ) ( ) ( ) ( ) ( )
( )
( ) ( ) ( ) ( ) ( ) ( )
( ) ( ) ( ) ( ) ( ) ( ) ( )
(3.12)
( ) ( ) ( )
( ) ( )
,
provided | |
Replacing q, a, b, and c by √ and √ , respectively, in (3.12), letting d and e tend to , and using (1.3),
(1.5), and (2.30) with n replaced by 5, we find that
∑( )
( )( ) ( )
( )
(3.13)
( ) ( ) ( )( )
( ) ( ) ( ) ( )
Replacing q, a, b, and c by √ and √ , respectively, in (3.12), letting d and e tend to , and using
(1.3), (1.5), and (2.30) with n replaced by 15, we find that
∑( )
( )( ) ( )
( )
(3.14)
( ) ( ) ( )( )
( ) ( ) ( ) ( )
With Entry 8(vii) in [B1, p. 114], we find that
(3.15)
∑
( )
( )
Using (1.9), (1.10), (3.11), (3.13), (3.14), and (3.15), we find that
(3.16)
∑
( ) ( )
(1+ )( ( ) ( ) ( ) ( ))
( )( ( ) ( ) ( ) ( ))
( ( ) ( ))
( )
( )( ) ( )
( )
( )
( )( ) ( )
( )
( )
To proceed to the next step, we need the following result, which can be proved by a the simple calculation:
20. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 181
Paper Publications
(3.17)
{
√ √
( )
√ √
( ) or √ √
( )
√ √
( )
Transforming and in the right side of (3.16) into the sums of ψ (q) and theta functions, and ϕ (q) and theta functions,
respectively, with (1.7) and (1.8), using (3.10) and (3.17) to simplify the terms related to ϕ (q) and ψ (q), using (1.11),
(1.12), and (1.13), replacing q by in Theorem 2.19, Theorem 2.20, and Theorem 2.21, and applying Theorem 2.19,
Theorem 2.20, and Theorem 2.21, we find that the right side of (3.16) equals
(3.18)
∑( ) ( √ √
( ) √ √
( ))
( )( ( ) ( ) ( )
( ) ( ) ( ) ( ) ( )
( )
( )( ) ( )
( )
)
( )( ( ) ( ) ( )
( ) ( ) ( ) ( ) ( )
( )
( )( ) ( )
( )
)
( ( ) ( ) ( ) ( ) ( )
( ) )
∑( ) ( √ √
( ) √ √
( ))
( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
Therefore, by (3.9), (3.16), and (3.18), we derive
(3.19)
√ √
√
(
( )
( )
( )
( )
)
√
( )
√
√
( )
√ √
√ ∑ ( )
21. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 182
Paper Publications
(( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) )
To complete the proof of Theorem 3.1, we need the following identities. Using (1.3), we can derive that
∑ ( ) equals
(3.20)
{
( ) ( )
if
( ) ( ) ( ) ( )
if
( ) ( ) ( ) ( ) ( )
if or
and ∑ ( ) equals
(3.21)
{
( ) ( ) ( ) ( ) ( )
if or
( ) ( ) ( ) ( ) ( )
if or
Recall that and . By (1.3), (1.16), and (3.6), we are able to derive the following four identities:
(3.22)
{
( )
√
∑ ( )
( )
√
∑ ( )
( )
√
∑ ( )
( )
√
∑ ( )
By (3.22), we find that
(3.23)
( ) ( ) ( )
( )
∑ ( ) ∑ ( ) ∑ ( )
∑ ( )
Recall that and By (3.20), (3.21), Theorem 2.22 with q replaced by and Theorem 2.6 with q
replaced by , the numerator of the right side of (3.23) equals
(( ) ( ) ( ) ( ) ( ))
( ( ) ( ) ( ) ( ) ( ))
( ( ) ( ) ( ) ( ) ( ))
(( ) ( ) ( ) ( ) ( ))
22. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 183
Paper Publications
(
( )( ) ( )
( ) ( )
( ) ( ) ( ))
( ) ( )
( )( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( )
( )( ) ( )
( ) ( )
( ) ( ) ( ) ( )
( )
( )( ) ( )
( ) ( )
(3.24) ( ) ( ) ( ) ( )
Here, we easily calculate that
√ √
and
√
Now, let the left
side of (2.31) with q replaced by q1,
√
the left side of (2.32) with q replaced by q1, the right side of
(2.31) with q replaced by q1, and
√
the right side of (2.32) with q replaced by q1. Then, we easily verify that the
right side of (3.24) equals the sum of LS1 and LS2. Therefore, we can say that the right side of (3.24) equals the sum of
RS1 and RS2. Using (3.21), we can find that the sum of RS1 and RS2 equals
( ) ( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) ( )
( ) ( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( ) ( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) ( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( ( ) ( ) ( ) ( ) ( ))
(( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) )
23. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 184
Paper Publications
∑( )
(( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
(3.25) ( ) )
By (3.7), (1.3), and (1.16), we find that
(3.26) ( )
∑ ( )
√
By (3.23), (3.24), (3.25), and (3.26), we find that
(3.27)
√ √ ( ) ( ) ( )
( ) ( )
√ √
√
∑ ( ) ∑ ( ) ∑ ( )
∑ ( )
( )
∑ ( )
√ √
∑ ( )
(( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) )
In conclusion, using (3.4), (3.5), (3.19), and (3.27), we see that we have completed the proof of Ramanujan's seventh
identity.
4. PROOF OF RAMANUJAN'S EIGHTH IDENTITY
In this section, we will prove the Ramanujan's eighth identity (1.2). The proof of eighth identity is similar to that of
seventh identity.
Theorem 4.1 (Ramanujan's eighth tenth order mock theta function identity).
∫
√
√ √
( )
√ √
( )
√
√
( )
Proof. Replacing by in (3.1), and using (1.14), we find that
24. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 185
Paper Publications
(4.1) ∫
√
√
( ) ( )
( )
,
Similarly, replacing by in (3.1), and using (1.14), we find that
(4.2) ∫
√
√
( ) ( )
( )
Using (4.1) and (4.2), we find that
∫
√
√
∫
√
√
∫ (
√ √
)
( ∫
√
∫
√
)
(4.3)
√ √
√
(
( ) ( )
( )
( ) ( )
( )
)
(3.4) Let . Then, using (1.15), (1.16), (1.3), (1.9) with q and z replaced by – q and q2
, respectively, (1.7),
(1.11) with q, z, and x replaced by –q5
, 1 and – q, respectively, (1.12) with q replaced by – q, and Theorem 2.5, we can
derive that
√ √
(
( )
( )
( )
( )
)
√ √
(
∑
( )
( )
∑
( )
( )
)
√ √ ( )
( )
√ √
( ( )
( ) ( ) ( )
( ) ( )
( ) ( )
( ) ( )
)
(4.4) √ √
( ) √ √ ( ) ( ) ( )
( ) ( )
Replacing and by and , respectively, in (3.6), we find that
(4.5) ( ) √ ( )
Replacing and by and , respectively, in (3.6), we find that
(4.6) ( ) √ ( )
Let and Then, using (4.5), (4.6), (1.15), and (1.16), we find that
(4.7)
25. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 186
Paper Publications
√
(
( )
( )
( )
( )
)
( )
( )
( )
( )
∑
( ) ( )
∑ ( )
If we replace by in the right side of (3.9), we can find that the right side of (3.9) equals the right side of (4.7). And,
it's easy to verify that (3.10), (3.11), and (3.16) are correct if we replace by in (3.10), (3.11), and (3.16). Therefore,
we find that
(4.8)
∑ ( ) ( ) ( ) ( ) ( ) and the numerator of (4.7) equals
(4.9)
(1+ )( ( ) ( ) ( ) ( ))
( )( ( ) ( ) ( ) ( ))
( ( ) ( ))
( )
( )( ) ( )
( )
( )
( )( ) ( )
( )
( )
we also need the following results, which can be obtained by an easy calculation:
(4.10)
{
√ √
( )
√ √
( ) or √ √
( )
√ √
( )
Transforming and into the sums of ψ (q) and theta functions, and ϕ (q) and theta functions with (1.7) and (1.8),
using (4.8) and (4.10) to simplify the terms related to ϕ (q) and ψ (q), replacing q by in Theorem 2.19, Theorem 2.20,
and Theorem 2.21, and applying Theorem 2.19, Theorem 2.20, and Theorem 2.21, we find that (4.9) equals
(4.11)
∑( ) ( √ √
( ) √ √
( ))
( )( ( ) ( ) ( )
( ) ( ) ( ) ( ) ( )
( )
( )( ) ( )
( )
)
( )( ( ) ( ) ( )
( ) ( ) ( ) ( ) ( )
26. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 187
Paper Publications
( )
( )( ) ( )
( )
)
( ( ) ( ) ( ) ( ) ( )
( ) )
∑( ) ( √ √
( ) √ √
( ))
( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
By (4.7), (4.9), and (4.11), we find that
(4.12)
√ √
√
(
( )
( )
( )
( )
)
√
( )
√
√
( )
√ √
√ ∑ ( )
(( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) )
By (1.3), (1.16), and (3.6), we derive the next two identities:
(4.13) {
( )
√
∑ ( )
( )
√
∑ ( )
Using (3.22) and (4.13), we find that
(4.14)
( ) ( ) ( )
( )
∑ ( ) ∑ ( ) ∑ ( )
∑ ( )
Recall that and By (3.20), (3.21), Theorem 2.22 with q replaced by and Theorem 2.6 with q
replaced by , the numerator of the right side of (4.14) equals
(4.15)
(( ) ( ) ( ) ( ) ( ))
27. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 188
Paper Publications
( ( ) ( ) ( ) ( ) ( ))
( ( ) ( ) ( ) ( ) ( ))
(( ) ( ) ( ) ( ) ( ))
(
( )( ) ( )
( ) ( )
( ) ( ) ( ))
( ) ( )
( )( ) ( )
( ) ( )
( ) ( ) ( )
( ) ( )
( )( ) ( )
( ) ( )
( ) ( ) ( ) ( )
( )
( )( ) ( )
( ) ( )
( ) ( ) ( ) ( )
Here, we easily calculate that
√ √
and
√
Let the left
side of (2.31) with q replaced by q1,
√
the left side of (2.32) with q replaced by q1, the right
side of (2.31) with q replaced by q1, and
√
the right side of (2.32) with q replaced by q1. Then, we easily
verify that the right side of (4.16) equals the sum of LS'1 and LS'2. Therefore, we can say that the right side of (4.15)
equals the sum of RS'1 and RS'2. Using (3.21), we can find that the right side of (4.15) equals
(4.16)
(( ) ( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) ( )
( ) ( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( ) ( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) ( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
)
( ( ) ( ) ( ) ( ) ( ))
28. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 189
Paper Publications
(( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) )
∑ (( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
( ) )
By (4.5), (1.3), and (1.16), we find that
(4.17) ( )
∑ ( )
√
By (4.16) and (4.17), we find that
√ √ ( ) ( ) ( )
( ) ( )
√ √
√
∑ ( ) ∑ ( ) ∑ ( )
∑ ( ) ∑ ( )
√ √
∑ ( )
(( )
( ) ( )( ) ( )
( ) ( ) ( )
( )
( ) ( )( ) ( )
( ) ( ) ( )
(4.18) ( ) )
In conclusion, using (4.3), (4.4), (4.12), and (4.18), we have completed the proof of Ramanujan's eighth identity.
REFERENCES
[1] G. E. Andrews and D. Hickerson, Ramanujan’s ”Lost” Notebook VII:The sixth order mock theta functions, Adv.
Math. 89 (1991), 60–105. MR 92i:11027
[2] B. C. Berndt, Ramanujan’s Notebooks Part III, Springer-Verlag, New York, 1991. MR 92j:01069
[3] B. C. Berndt, Ramanujan’s Notebooks Part IV, Springer-Verlag, New York, 1994. MR 95e:11028
[4] B. C. Berndt and R. A. Rankin, Ramanujan: Letters and Commentary, Amer. Math. Soc., Providence, 1995; London
Math. Soc., London, 1995. MR 97c:01034
[5] Y.-S. Choi, Tenth order mock theta functions in Ramanujan’s Lost Notebook, Invent. Math. 136 (1999), 497–569.
MR 2000f:11016
[6] Y.-S. Choi, Tenth order mock theta functions in Ramanujan’s Lost Notebook (II), Adv. Math. 156 (2000), 180–285.
CMP 2001:07
29. ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Vol. 2, Issue 1, pp: (162-190), Month: April 2015 – September 2015, Available at: www.paperpublications.org
Page | 190
Paper Publications
[7] Y.-S. Choi, Two identities for tenth order mock theta functions in Ramanujan’s Lost Note- book, submitted for
publication.
[8] G. Gasper and M. Rahman, Basic Hypergeometric Series, Cambridge University Press, Cambridge, 1990. MR
91d:33034
[9] D. Hickerson, A proof of the mock theta conjectures, Invent. Math. 94 (1988), 639–660. MR 90f:11028a
[10] D. Hickerson, On the seventh order mock theta functions, Invent. Math. 94 (1988), 661–677. MR 90f:11028b
[11] M. I. Knopp, Modular Functions in Analytic Number Theory, reprint, Chelsea Publishing Co., New York, 1993. MR
42:198 (original ed.)
[12] L. J. Mordell, The value of the definite integral, Quarterly Journal of Mathematics 48 (1920), 329–342.
[13] S. Ramanujan, the Lost Notebook and Other Unpublished papers, Narosa Publishing House, New Delhi, 1988. MR
89j:01078
[14] R. A. Rankin, Modular Forms and Functions, Cambridge University Press, Cambridge, 1977. MR 58:16518
[15] S. Robins, Generalized Dedekind η-products, Contemp. Math. 166 (1994), 119-128. MR 95k:11061
[16] G. N. Watson, The final problem:An account of the mock theta functions, J. London Math. Soc. 11 (1936), 55–80.