The waiting times between a subway departure schedule and the arrival of a passenger are uniformly distributed between 0 and 7 minutes. Find the probability that a randomly selected passenger has a waiting time greater than 1.25 minutes.

mk./km: lm

step-by-step explanation:

,mlmlm

; mk

lk

kekdkdkccc

so

step-by-step explanation:

kekdkckcldlx

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)

sorry i got nothing

step-by-step explanation: