i HAVE PASTED THE QUESTION,ITS SPECIFIC AND SHORT TOO SO U ALL CAN REPLY. Lov u all

One of the proofs of modern mathematics is George Cantors demonstration that the set of rational numbers is enumerable.This proof works by using an explicit enumeration of rational numbers as shown below 1/1 1/2 1/3 1/4 1/5 .... 2/1 2/2 2/3 2/4 3/1 3/2 3/3 4/1 4/2 5/1 In the time above the first term is 1/1 second is 1/2 ,the third is 2/2,the fourth term is 3/1,the fifth is 2/2 and so on. INPUT AND OUTPUT You are to write a program that will read a list of numbers in the range from 1 to 10 raised to the power 7 and will print for each number the corresponding cantor's enumeration as given below.No blank line should appear after the last number. Th einput list contains a single number per line and will be terminated by the end of -file. SAMPLE INPUT 3 14 7 SAMPLE OUTPUT TERM 3 is 2/1 TERM 14 is 2/4 Term 7 is 1/4 Lov u all

One of the proofs of modern mathematics is George Cantors demonstration that the set of rational numbers is enumerable.This proof works by using an explicit enumeration of rational numbers as shown below 1/1 1/2 1/3 1/4 1/5 .... 2/1 2/2 2/3 2/4 3/1 3/2 3/3 4/1 4/2 5/1 In the time above the first term is 1/1 second is 1/2 ,the third is 2/2,the fourth term is 3/1,the fifth is 2/2 and so on. INPUT AND OUTPUT You are to write a program that will read a list of numbers in the range from 1 to 10 raised to the power 7 and will print for each number the corresponding cantor's enumeration as given below.No blank line should appear after the last number. Th einput list contains a single number per line and will be terminated by the end of -file. SAMPLE INPUT 3 14 7 SAMPLE OUTPUT TERM 3 is 2/1 TERM 14 is 2/4 Term 7 is 1/4 Lov u all

Q;the factorial of a number B ia defined recursively as 1!=1 N!=N*(N-1)! Factorials can be represented as the number of times prime number occurs in it ,example 825 could be specified as(0 1 2 0 1)meaning no twos,1 three,2 fives,no sevens and 1 eleven. Write a program that will readin a number N(2<=N<=100) and write out its factorial in terms of the numbers of the prime it contains. INPUT It will contain a series of lines each containing a single letter N The file will bw terminated by a line consisting of a single 0. OUTPUT It will contain a series of blocks of lines, one block for each line of input. Each block will start with the number N,right justified in a field of width 3 and the characters '!',space, and '='.This will be followed by a list of the number of times each prime numbers occurs in !N. There should be right justified in fields of width 3 and each line (except the last of a block, which may be shorter)should contain 15 numbers.Any lines after the first should be indented .Follow the layout of the example shown below exactly. SAMPLE INPUT 5 53 0 SAMPLE OUTPUT !5= 3 1 1 53!= 49 23 12 8 4 4 3 2 2 1 1 1 1 1 1 1 Lov u all

Write a program that takes two wordss and finds any common letters that they have. For example, the words 'computer' and 'program' have the letters 'o','m','p','r' in common. The output should be both words with all common letters in capitals. Neither word will have more than 8 letters. Sample Input Enter two words : computer program Sample Output cOMPuteR PROgRaM Lov u all

an integer substring of an integer is formed by consecutive digits of the original integer. For examp[le, the number 6158 contains the substrings 6,1,5,8,61,15,58,615,158,6158. you must find the largest substring of an integer that is also a prime. input the input will be an integer N,(0<=N<=1 000 000 000). Output The output will be the largest prime substring of N. If no substring is a prime, then your program should print "No Primes". Sample Input 1 2319 Sample Output 1 31 Sample input 23 6804 Sample Output No Primes Lov u all