Answer:
class Main {
static void printPowers(int howMany, int nrRows) {
for(int n=1; n<=nrRows; n++) {
for(int power = 1; power<=howMany; power++) {
System.out.printf("%d ", (int) Math.pow(n, power));
}
System.out.println();
}
}
public static void main(String[] args) {
printPowers(3, 5);
}
}
class Main {
static void printPowers(int howMany, int nrRows) {
int n = 1;
do {
int power = 1;
do {
System.out.printf("%d ", (int) Math.pow(n, power));
power++;
} while (power <= howMany);
System.out.println();
n++;
} while (n <= nrRows);
}
public static void main(String[] args) {
printPowers(3, 5);
}
}
Explanation:
The for loop gives the cleanest, shortest code.
Answer:
Nuclear codes allow the president to prove the individual is authorized to order the launch.
Explanation:
Hope this helps!
If not, I am sorry.
The binary representation of +3997 is 1111 1001 1101.
In one's complement this is simply adding a sign bit and inverting all the bits:
1 0000 0110 0010
The two's complement is the one's complement plus 1:
1 0000 0110 0011
That's 13 bits. Normally the sign bit would be at an 8, 16 or 32,... bit boundary.
For -436 it's 10 0100 1100 and 10 bits
no idea either lol, I mean school forces you to learn
..