Let a= {a, b} and let s be the set of all strings with alphabet a. define f: s -> s as follows:
for any string %u03c3, define f(%u03c3) = the string resulting by replacing all a's by b's and all b's by a's in the string.
select all true statements below:
f is an onto function
for all input strings x, f(x)= f(f(x))
f is a one-to-one function
f has an inverse

the 2 figures are congruent bc if you reflect abcd over the y axis then over the d axis the figures overlap

what do u need to know

step-by-step explanation:

his first public project he is asked to create a small scale drawing. the garden is a right triangle with base 25m and height 30m. are you trying to solve for the last side/hypotenuse? the irrational form of the answer would be 5\sqrt{61}

aloha~! my name is zalgo and i am here to you out on this amazing day. to answer your question, yes, nonzero numbers can have a greatest common factor and that would be 1. still don't get it? let me considering every number is divisible by 1 and hence every number has 1 as a factor of theirs. so, if 2 nonzero numbers didn't share any gcf (greatest common factor), they would still have a factor in common and that would be 1.

i hope that this ! : p

"stay and stay proud! " - zalgo

(by the way, do you mind marking me as brainliest? i'd greatly appreciate it! mahalo! x3)