用反证法证明命题“a,b∈N,如果ab可被5整除,那么a,b至少有1个能被5整除.”则假设的内容是( )
A.a,b都能被5整除
B.a,b都不能被5整除
C.a,b不能被5整除
D.a,b有1个不能被5整除
0 97786 97794 97800 97804 97810 97812 97816 97822 97824 97830 97836 97840 97842 97846 97852 97854 97860 97864 97866 97870 97872 97876 97878 97880 97881 97882 97884 97885 97886 97888 97890 97894 97896 97900 97902 97906 97912 97914 97920 97924 97926 97930 97936 97942 97944 97950 97954 97956 97962 97966 97972 97980 266669
A.a,b都能被5整除
B.a,b都不能被5整除
C.a,b不能被5整除
D.a,b有1个不能被5整除