Answer:
how many times as strong would what?
put your question in the replies to this answer and I'll gladly answer it
Explanation:
May I have brainliest please? :)
Answer:
here is what I think!
Explanation:
G-mail is:
- secure
- easy to use
- fast
- can be used to sign in anywhere!<u>(including brainly)</u>
- you don't need to pay when creating one
- can help you in billing and buying apps and their paid product
- <em><u>you </u></em> can use it because <em>why no!</em>
- some websites need G-mail to be used
thats why you should use G-mail
tell me if you have an idea!
import math
num1 = int(input("Enter a number: "))
num2 = int(input("Enter a number: "))
print(math.gcd(num1, num2))
The gcd() - greatest common divisor function, which is part of the math module works perfectly in this situation.
Answer:
The second one:
int sum = 0; for (int i = 0; i < values.length; i++) { if ((values[i] % 2) == 0) { sum += values[i]; } }
Answer:
Following are the code block in the Java Programming Language.
//define recursive function
public static long exponentiation(long x, int n) {
//check the integer variable is equal to the 0.
if (x == 0) {
//then, return 1
return 1;
}
//Otherwise, set else
else {
//set long data type variable
long q = exponentiation(x, n/2);
q *= q;
//check if the remainder is 1
if (n % 2 == 1) {
q *= x;
}
//return the variable
return q;
}
}
Explanation:
<u>Following are the description of the code block</u>.
- Firstly, we define the long data type recursive function.
- Then, set the if conditional statement and return the value 1.
- Otherwise, set the long data type variable 'q' that sore the output of the recursive function.
- Set the if conditional statement and check that the remainder is 1 and return the variable 'q'.
