Anmol 3

import java.io.
*; public class sum {

static double sum(int n) { double i, s = 0.0;
for (i = 1; i <= n; i++) s = s + 1 / i;
return s;
}
public static void main(String args[]) { int n = 5;

System.out.printf("Sum is %f", sum(n));
}
}
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class prime {

public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);

List<Integer> list = new ArrayList<>();
List<Integer> h = new ArrayList<>();

int k;
while (true) {
while (true) {
System.out.println("enter number to be prime ");
int i = scanner.nextInt();
k = i;
System.out.println("exit for 1");
i = scanner.nextInt();
if (i == 1) {
break;
} else {
}
}
int o, u = 0, c = 0, min = 0, max, lc = 0;
o = 0;
for (int j = 2; j < k; j++) {

if (k % j == 0) {
min++;
break;
}
}
if (min > 0) {
System.out.println("not prime");
} else {
System.out.println(" prime");
}
System.out.println("exit for 1"); int i = scanner.nextInt();
if (i == 1) { break;
} else {
import java.util.ArrayList;
public class reverse {

Scanner scanner = new Scanner(System.in);

List<Integer> list = new ArrayList<>();
List<Integer> h = new ArrayList<>();
while (true) {
System.out.println("enter number to be reverse");
int o = i, c = 0;
while (o != 0) {
o /= 10;
c += 1;
}
System.out.println(c);
int u = c / 2;
Double r = Math.pow(10, u);
System.out.println(r + " " + u);
double t = (i % r);
double y = (i / r);
double g = (t * r * 10) + y;
System.out.println(t + " " + y);
System.out.println(g);
if (i == 1) {
break;
} else {
}
}
import java.util.ArrayList; import java.util.List; import java.util.Scanner;
public class lcm {

Scanner scanner = new Scanner(System.in); List<Integer> list = new ArrayList<>();
List<Integer> h = new ArrayList<>(); int lcm;

while (true) {
while (true) {
System.out.println("enter number to be lcm ");
list.add(i); System.out.println("exit for 1");
if (i == 1) {
break;
} else {
}
}
int o, u = 0, c = 0, min, max, lc = 0;

c = list.size();
o = 0;
System.out.println("all element to be lcm");
for (int j = 0; j <= (c - 1); j++) {

System.out.println(list.get(j));
}
for (int j = 0; j <= (c - 1); j++) {
for (int p = 0; p <= (c - 1); p++) {

if (list.get(j) > list.get(p)) {
min = list.get(p);
max = list.get(j);
} else {
min =
list.get(j); max
= list.get(p);
}
for (int k = 0; k < c + 2; k++) {
int x = k * max;
if (x % min == 0) {
lc = x;
lcm = lc;
}
}
}
}
System.out.println("LCM of the given array of numbers : " + lc);

int y = scanner.nextInt();
if (y == 1) {
break;
} else {
}
list.clear();
}
}
import
java.util.ArrayList;
public class devision_sum_by_it_self {

public static void main(String[] args)
{
Scanner scanner = new

Scanner(System.in); List<Integer> list
= new ArrayList<>();
List<Integer> h = new
ArrayList<>(); int k;
while (true) {
while (true)
{
if (i == 1) {
break;
} else {
}
}
int o, u = k, c = 0, min = 0, max, lc = 0;
o = 0;
for (int j = 0; j <= k;) {

c = k % 10;
list.add(c);
if (k == 0) {
break;
}
k = k / 10;
}
c = list.size();
for (int j = 0; j <= c - 1; j++) {
lc += list.get(j);
}
if (u % lc == 0) {
System.out.println("yes");
} else {
System.out.println("no");
}

if (i == 1) {
break;
} else {
}
}
import
public class seed {


ArrayList<>(); int k, p;
while (true) {
while (true)
k = i;
System.out.println("x is seed ");
p = i;
if (i == 1) {
break;
} else {
}
}
int o, u = k, c = 0, min = 0, max, lc = 0;
o = 0;
for (int j = 0; j <= k + 11; j++) {

if (k == 0) {
break;
} else {
c = k % 10;
list.add(c);
}
k = k / 10;
}
c = list.size();
min = u;
for (int j = 0; j <= c - 1; j++) {

System.out.println(list.get(j) + " " + min);
lc = list.get(j);
min *= lc;
}
if (min == p) {
System.out.println("yes" + min + " " + p);
} else {
System.out.println("no" + min + " " + p);
}
System.out.println("exit for 1"); int i = scanner.nextInt();
if (i == 1) { break;
} else {
import
public class arm_strong_number {


ArrayList<>(); int lcm;
System.out.println("enter number to be arm strong number like
153 ");
int o = i, g = 0;
for (int j = 0; j <= 8; j++) {

int t = o % 10;
if (o == 0) {
break;
} else {
}
int p = t * t * t;
g += p;
o /= 10;
}
if (i == g) {
System.out.println("arm strong number of the given array of
numbers : " + g);
} else {
System.out.println(
"No. It is not an Armstrong No.");
}

int y = scanner.nextInt();
if (y == 1) {
break;
} else {
}
list.clear();
}
}

Anmol 3

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Anmol 3

Uploaded by

Copyright:

Available Formats

import java.io.

*; public class sum {

public static void main(String args[]) { int n = 5;

public class prime {

Scanner scanner = new Scanner(System.in);

List<Integer> h = new ArrayList<>();

for (int j = 2; j < k; j++) {

public class reverse {

Scanner scanner = new Scanner(System.in);

List<Integer> h = new ArrayList<>();

public class lcm {

Scanner scanner = new Scanner(System.in); List<Integer> list = new ArrayList<>();

List<Integer> h = new ArrayList<>(); int lcm;

int o, u = 0, c = 0, min, max, lc = 0;

for (int j = 0; j <= (c - 1); j++) {

for (int p = 0; p <= (c - 1); p++) {

System.out.println("LCM of the given array of numbers : " + lc);

System.out.println("exit for 1");

public class devision_sum_by_it_self {

Scanner scanner = new

for (int j = 0; j <= k;) {

for (int j = 0; j <= c - 1; j++) {

System.out.println("exit for 1");

public class seed {

Scanner scanner = new

for (int j = 0; j <= k + 11; j++) {

for (int j = 0; j <= c - 1; j++) {

public class arm_strong_number {

Scanner scanner = new

for (int j = 0; j <= 8; j++) {

System.out.println("exit for 1");

You might also like